Overview of the questions asked
|
Problem Name |
Difficulty Level |
Reward points for that question |
Topics Related |
Approx time taken to solve by me |
Number of submissions made |
|---|---|---|---|---|---|
|
Merge Two 2D Arrays by Summing Values |
Easy |
3 |
Array, Hashtable, Two-pointers |
7 minutes |
1 |
|
Minimum Operations to Reduce an Integer to 0 |
Medium |
4 |
Dynamic Programming, Greedy, Bit manipulation |
13 minutes |
1 |
|
Count the Number of Square-Free Subsets |
Medium |
5 |
Array, Math, Dynamic Programming |
21 minutes |
3(2 WA) |
|
Find the String with LCP |
Hard |
6 |
Array, String, DP,greedy |
28-35 minutes |
2 (1 TLE) |