Problem title
Difficulty
Avg time to solve
Ninja And Alternating Largest
Easy
15 mins
Unequal Adjacent Elements
Moderate
25 mins
Minimum Path Sum
Moderate
15 mins
Amusement park
Moderate
35 mins
Rotate DLL
Moderate
10 mins
Minimum sum of squares of character counts in a given string after removing k characters.
Easy
--
BST to greater tree
Easy
--
Similar Strings
Ninja
70 mins
Count Messages
Easy
15 mins
Find K Pairs with Smallest Sums
Moderate
25 mins