Jobdu OJ – Page 3

Solution to Greatest Sum Of Subarrays from Jobdu

28 Aug

Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1372 Question Name: Greatest Sum Of Subarrays Question Description: Given an integer array, find the non-empty subarray with the greatest sum. If there are multiple subarray with the same greatest sum, return the one with the smallest … Read More »

Solution to K Least Numbers from Jobdu

27 Aug

Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1371 Question Name: K Least Numbers Question Description: Given an integer array and an integer K, find the sorted K least numbers in the original array. Input: the input might contain multiple test cases. Each test case … Read More »

Solution to More Than Half Number from Jobdu

25 Aug

Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1370 Question Name: More Than Half Number Question Description: Give an integer array, there might be one number, which appears more than half times. If it exists, find out it. For example, in the array {1,2,3,2,2,2,5,4,2}, 2 … Read More »

Solution to String Permutation from Jobdu

24 Aug

Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1369 Question Name: String Permutation Question Description: Give a string, use all the letters of that string to construct all distinct permutations. Input: the input might contain multiple test cases. Each line contains a string as a … Read More »

Solution to Convert Binary Search Tree from Jobdu

24 Aug

Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1503 Question Name: Convert Binary Search Tree Question Description: Given a binary search tree, convert it to a sorted and double-linked list. You cannot create any new node. But the pointers in each node could be modified. … Read More »

Solution to Copy Complex List from Jobdu

20 Aug

Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1524 Question Name: Copy Complex List Question Description: In a complex list, each node has two pointers. One pointer is to the next node. And the other is to a random node of the list. Given a … Read More »

Solution to Path In Tree from Jobdu

18 Aug

Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1368 Question Name: Path In Tree Question Description: Given a binary tree and a value, show all the paths, whose sum is equal to the given value. A path is defined as the route from root to … Read More »

Solution to Sequence Of BST from Jobdu

12 Aug

Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1367 Question Name: Sequence Of BST Question Description: Give an array, check whether it is possble to be the post-order traversal result on some binary search tree. Input: the input might contain multiple test cases. Inside each … Read More »

Solution to Print Binary Tree By Level from Jobdu

11 Aug

Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1523 Question Name: Print Binary Tree By Level Question Description: Give a binary tree, print it out in level-order. Input: the input might contain multiple test cases. Inside each test case, the first line includes one interger … Read More »

Solution to Stack Push Pop Order from Jobdu

10 Aug

Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1366 Question Name: Stack Push Pop Order Question Description: give two integer arrays. The first one is the order to push the integers into stack. To check whether the second one is an valid order to pop … 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

Jay Bariya January 18, 2023 at 3:54 pm on Solution to Triangle by codilityI initially solved it using how Sheng did to just find the mere existence of a trianglular. My code can be modified to find all...
Jay Bariya January 17, 2023 at 1:23 am on Solution to Max-Product-Of-Three by codility100% Python solution. Hi @Sheng, I tried solving it without using sorting. Just min and max. I believe my complexity is O(N), but Codility shows...
Jay Bariya January 16, 2023 at 9:15 pm on Solution to Distinct by codilityUse a dictionary or just use a set. def solution(A): unique_dict = {} for int_val in A: unique_dict[int_val] = 0 return len(unique_dict.keys())
Jay Bariya January 8, 2023 at 10:34 pm on Solution to Min-Avg-Two-Slice by codilityPython solution- 100%. Detected time complexity - O(N). Even before looking at the solution, the proof that global minimum average lies in slices with 2...
Jay Bariya January 6, 2023 at 4:57 am on Solution to Genomic-Range-Query by codilityPretty neat and easy to understand solution. Thanks.
Jay Bariya January 3, 2023 at 1:02 am on Solution to Count-Div by codilityPython 100%. Time Complexity O(1). def solution(A,B,K): # solution for case K = 1 if K == 1: return B-A + 1 # solution for...
Jay Bariya January 2, 2023 at 10:55 pm on Solution to Passing-Cars by codilityPython solution - 100%. O(N) def solution(A): n_pairs= 0 to_east = 0 # iterate over directions for direction in A: # if direction is east,...
Jay Bariya December 31, 2022 at 11:53 pm on Solution to Missing-Integer by codility100% on correctness and performance. Detected Time Complexity - O(N) or O(NlogN). I've explained my code with comments. def solution(A): # sort the list A.sort()...
Jay Bariya December 30, 2022 at 7:05 pm on Solution to Max-Counters by codilityTime Complexity - O(N+M). 100%. List comprehension in the last step instead of directly applying max() inspired from one of the other comments on Python....