Jobdu OJ – Page 4

Solution to Min In Stack from Jobdu

10 Aug

Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1522 Question Name: Min In Stack Question Description: implement a customized stack. It should provide a function min() to return the minimum value in the stack in O(1) time. Input: the input might contain multiple test cases. … Read More »

Solution to Print Matrix from Jobdu

10 Aug

Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1391 Question Name: Print Matrix Question Description: Give an integer matrix, print it in spiral form. Input: the input might contain multiple test cases. Inside each test case, the first line includes two intergers N and M … Read More »

Solution to Mirror Of Binary Tree from Jobdu

10 Aug

Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1521 Question Name: Mirror Of Binary Tree Question Description: Give a binary tree, find its mirror copy and print it out in pre-order. Input: the input might contain multiple test cases. Inside each test case, the first … Read More »

Solution to Substructure In Tree from Jobdu

9 Aug

Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1520 Question Name: Substructure In Tree Question Description: Give two binary tree, check whether the latter one is a substructure of the first one. Input: the input might contain multiple test cases. Inside each test case, the … Read More »

Solution to Merge Sorted List from Jobdu

8 Aug

Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1519 Question Name: Merge Sorted List Question Description: Give two sorted single-linked lists, merge them. Input: the input might contain multiple test cases. Inside each test case, the first line includes two interger N and M (0 … Read More »

Solution to Reverse List from Jobdu

7 Aug

Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1518 Question Name: Reverse List Question Description: Give an single-linked list, reverse it in place. Input: the input might contain multiple test cases. Inside each test case, the first line is one interger N (0 <= N … Read More »

Solution to Kth Node from End from Jobdu

7 Aug

Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1517 Question Name: Kth Node from End Question Description: Give an single-linked list, find the Kth last node from the end. If there are less than K nodes in the list, you should return null. Input: the … Read More »

Solution to Reorder Array from Jobdu

7 Aug

Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1516 Question Name: Reorder Array Question Description: Give an array of integers, reorder it so that, all odd numbers are before all even numbers. The order among odd numbers is kept. And so are the even numbers. … Read More »

Solution to Print One To Max Of N Digits from Jobdu

7 Aug

Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1515 Question Name: Print One To Max Of N Digits Question Description: Give an integer N, generate and print all the integers from 1 to (10^N – 1). Input: an integer. Output: the integers from 1 to … Read More »

Solution to Power from Jobdu

5 Aug

Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1514 Question Name: Power Question Description: Give a double and an integer, without using the math library, compute the base to the power of exponent. Input: may contains multiple test cases. The first line indicates how many … Read More »

tl;dr: Please put your code into a <pre>YOUR CODE</pre> section.

Hello everyone!

If you want to ask a question about the solution. DO READ the post and comments firstly.

If you had some troubles in debugging your solution, please try to ask for help on StackOverflow, instead of here.

If you want to post some comments with code or symbol, here is the guidline.

1. To post your code, please add the code inside a <pre> </pre> section (preferred), or <code> </code>. And inside the pre or code section, you do not need to escape < > and &, e.g. no need to use < instead of <.

2. To use special symbols < and > outside the pre block, please use "<" and ">" instead.

3. If you have a comment with lots of < and >, you could add the major part of your comment into a <pre class="decode:true crayon-inline "> YOUR COMMENTS </pre> section.

Finally, if you are posting the first comment here, it usually needs moderation. Please be patient and stay tuned. Thanks!

CodeSays.com Admin

Ovi February 12, 2024 at 11:14 pm on Solution to Min-Perimeter-Rectangle by codilityExactly my question too. I tried something very similar to Sheng's solution, importing the math module and using sqrt(). Codility marked it only as 80%,...
Doron Ben Ari February 11, 2024 at 4:10 am on Solution to Min-Avg-Two-Slice by codilityInspired by Sheng's great solution, I wrote the following proof: Assume you found the slice with minimal average. Assume the first two consecutive elements of...
Ovi February 4, 2024 at 9:03 am on Solution to sigma2012 (Stone-Wall) by codility def solution(H): heights = H # geometric logic: the blocks need to be cuboid, all sides are rectagular. Nothing fancy, means that the angles...
Ovidiu Oprea February 2, 2024 at 11:06 am on Solution to Fish by codilityIt's the reason why it took me 2 weeks to finish this task (in the context of adult life with non-dev job). I was trying...
Ovi January 15, 2024 at 2:40 pm on Solution to Brackets by codilityThanks for this blog post! I was banging my head against the wall thinking this is a simple / short solution, where you just build...
parikshit verma July 5, 2023 at 8:26 am on Solution to Missing-Integer by codility def missingnum(a): st=min(a) en=max(a) b=set(range(1,en+2)) if (en<1 or st>1) : return 1 else: return min(b-set(a))
Pavankumar Nandeshwar June 26, 2023 at 8:07 am on Solution to Dwarfs-Rafting by codilityOk fixed it. gives 100%: int solution(int N, string &S, string &T) { int q = N / 2 * N / 2; int lf...
Pavankumar Nandeshwar June 26, 2023 at 5:23 am on Solution to Dwarfs-Rafting by codilityCan someone explain what is wrong with my solution in C++ ? int solution(int N, string &S, string &T) { int q = N /...
Pavankumar Nandeshwar June 23, 2023 at 10:25 pm on Solution to Flood-Depth by codilityMy C++ Solution. O(N) #include <climits> int solution(vector<int> &A) { int max_depth {}; int max_lvl = {}; int min_lvl = INT_MAX; for (unsigned int i...