|
Why is Time complexity O(N+N)
|
|
1
|
2
|
April 12, 2021
|
|
No need for hashMap, space complexity can be O(v)
|
|
2
|
98
|
April 11, 2021
|
|
Start from sink, more order are valid
|
|
2
|
96
|
April 11, 2021
|
|
Alternative Solution with O(k) time complexity
|
|
1
|
2
|
April 10, 2021
|
|
Time complexity sliding window problem 1
|
|
2
|
45
|
April 10, 2021
|
|
O(N) time complexity - Alternate solution
|
|
4
|
13
|
April 9, 2021
|
|
Alternate solution with different comparison
|
|
1
|
3
|
April 9, 2021
|
|
Why don't we have `if (dp[i - 1][s])` condition just like in subset sum
|
|
1
|
3
|
April 9, 2021
|
|
Not being picky but sum is actually count in top down method
|
|
1
|
6
|
April 9, 2021
|
|
Can the challenge be visualized better?
|
|
1
|
3
|
April 9, 2021
|
|
Should canPartitionRecursive be minDiffRecursive?
|
|
1
|
2
|
April 9, 2021
|
|
What will be th time complexity of top down approach with memoization?
|
|
1
|
3
|
April 9, 2021
|
|
Alternative solution with DP
|
|
2
|
53
|
April 9, 2021
|
|
Why this pattern is called "Cyclic sort". Can we add that description too?
|
|
1
|
2
|
April 7, 2021
|
|
Solution doesn't work for a n > nums.size() + 2
|
|
2
|
3
|
April 7, 2021
|
|
Why do we need to use an external library? Can we solve this without it?
|
|
3
|
44
|
April 7, 2021
|
|
Easier solution logic
|
|
4
|
111
|
April 6, 2021
|
|
Similar Question: Given a list of appointments, find all the conflicting appointments
|
|
3
|
98
|
April 6, 2021
|
|
Possible O(n) solution changing sort algorithm
|
|
1
|
3
|
April 6, 2021
|
|
It can be done in O(n) rather than O(NlogN)
|
|
2
|
25
|
April 6, 2021
|
|
Can we have visualization of the Challenge
|
|
1
|
14
|
April 5, 2021
|
|
Isn't top down approach better than bottom up approach?
|
|
1
|
11
|
April 5, 2021
|
|
How to import HashSet in java?
|
|
1
|
6
|
April 5, 2021
|
|
Add recursion tree visualizer
|
|
1
|
8
|
April 4, 2021
|
|
Template Instantiation - Generic Programming Templates in C++
|
|
1
|
8
|
April 4, 2021
|
|
Subset Sum solved with Caterpillar Method, not DP array
|
|
1
|
8
|
April 4, 2021
|
|
Why didn't we analyse the inner loop further like the previous challenge (Challenge 4)
|
|
1
|
8
|
April 2, 2021
|
|
FYI: rangeStart = 0 is arbitrary, rangeEnd=Infinity is well thought
|
|
1
|
2
|
April 2, 2021
|
|
Confusing "Finally, if the array of the top element has more elements, we’ll insert the next element to the heap."
|
|
1
|
2
|
April 2, 2021
|
|
Time Complexity K * Log K using Max Heap (Just for fun)
|
|
1
|
3
|
April 1, 2021
|