JAVA | Bottom Up Approach
[
Longest Common Subsequence : Unsolved
]
(1)
C++ solution using helper function
[
Path to Given Node : Solved
]
(1)
Hint Solution is not compiling
[
Class with Comparators : Unsolved
]
(1)
Why it is partially correct
[
Balance Array : Unsolved
]
(1)
Why my solution is wrong? help me
[
Balance Array : Unsolved
]
(2)
Why solution using mergesort is not considered ,it gives you 0(log n)?
[
Perfect Peak of Array : Unsolved
]
(3)
Shortest C++ solution using STL
[
Next Similar Number : Unsolved
]
(1)
Can anybody explain clearly?
[
Valid BST from Preorder : Solved
]
(1)
Simple and Easy to Understand Java Solution
[
Convert to Palindrome : Solved
]
(1)
There is no Question to solve and no python3
[
Dictionary : Unsolved
]
(1)
Incorrect test case 6 1 4 6 6 4 10 2
[
Reverse Alternate K Nodes : Unsolved
]
(1)
Java using SET data structure
[
First non-repeating character in a stre : Solved
]
(1)
Three line code
[
Remove Consecutive Characters : Solved
]
(3)
Can anyone tell me problem with this soln
[
Itertools: Infinite Iterators : Unsolved
]
(3)
O(n) solution using extra space
[
WoodCutting Made Easy! : Solved
]
(2)
Can't see question
[
Itertools: Terminating Iterators : Unsolved
]
(1)
O(2*bit_length(n))
[
Count Total Set Bits : Solved
]
(1)
Clean python3 solution
[
First Repeating element : Solved
]
(1)
Simple Matrix Exponentiation question
[
Find Nth Fibonacci : Unsolved
]
(1)
Can someone help me in reducing time complecity of my code
[
Pair With Given Difference : Unsolved
]
(1)
Simplest solution without recursion, using queue only
[
Cousins in Binary Tree : Solved
]
(4)
Chaap lo bhai (leet code hi sahi hai)
[
Maximum Sum Triplet : Solved
]
(3)
No solution in python (only partially correct)
[
Reverse Level Order : Unsolved
]
(3)
Easy C++ Recursive
[
Burn a Tree : Solved
]
(1)
Wrong output given for the first example
[
Maximum Sum Triplet : Unsolved
]
(2)
Its long but easy to understand(Hope it helps!)
[
Two teams? : Solved
]
(1)
Tle due to max func
[
Best Time to Buy and Sell Stock atmost : Unsolved
]
(1)
Help with solution
[
Path in Directed Graph : Solved
]
(1)
Pass adjacency list vector by reference only
[
Path in Directed Graph : Solved
]
(1)
Using divide and conquer appraoch time O(n/2)
[
Max Min : Unsolved
]
(1)
next page →