Jobdu OJ – Page 2

Solution to Two Numbers With Sum from Jobdu

8 Sep

Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1352 Question Name: Two Numbers With Sum Question Description: within a sorted integer array, find two integers, whose sum is the given target value. If there are multiply pairs, find the one with the smallest product. Input: … Read More »

Solution to Numbers Appear Once from Jobdu

8 Sep

Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1351 Question Name: Numbers Appear Once Question Description: in an int array, every number appears even count of times, except two numbers, which appear only once. Find the two numbers. Input: the input might contain multiple test … Read More »

Solution to Tree Depth from Jobdu

7 Sep

Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1350 Question Name: Tree Depth Question Description: compute the depth of a binary tree. Input: the input might contain multiple test cases. Inside each test case, the first line includes one integers N (1 <= N <= … Read More »

Solution to Number Of K from Jobdu

7 Sep

Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1349 Question Name: Number Of K Question Description: count the occurrence of a number in a sorted integer arrray. Input: the input might contain multiple test cases. Inside each test case, the first line includes one integers … Read More »

Solution to First Common Nodes In Lists from Jobdu

7 Sep

No test case content is given. No response from the admin. No clear statement is provided. I spent a whole day on the input issue. And I still do not know what is wrong with my original input handler. Save … Read More »

Solution to Inverse Pairs from Jobdu

6 Sep

Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1348 Question Name: Inverse Pairs Question Description: Given an integer array, for any two numbers, if the former one is less than the latter one, they are an inversion pair. Compute the total count of inversion pairs … Read More »

Solution to First No Repeating Char from Jobdu

1 Sep

Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1283 Question Name: First No Repeating Char Question Description: Given a string with only upper-case letters, find the first non-repeating char. Input: the input might contain multiple test cases. Each line is a test case. Only upper-case … Read More »

Solution to Ugly Number from Jobdu

31 Aug

Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1214 Question Name: Ugly Number Question Description: Ugly numbers are the integers, whose prime factors could only be 2, 3, and/or 5. Typically 1 is also considered as an ugly number. We need to find the i(th) … Read More »

Solution to Sort Array For Min Number from Jobdu

31 Aug

Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1504 Question Name: Sort Array For Min Number Question Description: Given an integer array, concatenate them as in their string representation, and find out the minimum one among the concatenated results. Input: the input might contain multiple … Read More »

Solution to Number Of Ones from Jobdu

31 Aug

Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1373 Question Name: Number Of Ones Question Description: Given an integer, find the number of 1s in the string representation of all integers from 0 to it. Input: the input might contain multiple test cases. Each test case … 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...