List of problems to be refactored 102. Binary Tree Level Order Traversal / 103 Solve using a While loop.
116. Populating Next Right Pointers In Each Node Do it better.
132. Palindrome Partitioning II Do it using use dynamic programming (determine which substrings are palindromes).
redo
152. Maximum Product Subarray redo
learn bucket sort
188. Best Time to Buy and Sell Stock IV redo
Do it with Tries.
Do it better.
redo
316. Remove Duplicate Letters redo
redo
The task was solved with a HashMap and an X-doubly linked list. The doubly linked list should be implemented as a class that can be used later.
As an alternative, a solution with OrderedDict should be implemented.
redo
847. Shortest Path Visiting All Nodes redo
redo using DP
880. Decoded String at Index redo
920. Number of Music Playlists redo
Check sample solution.
958. Check Completeness of a Binary Tree Check sample solution.
983. Minimum Cost For Tickets redo
1187. Make Array Strictly Increasing redo
1489. Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree redo
Refactor it. The solution is supposed to be faster and consume less memory.
2608. Shortest Cycle in a Graph redo with union find
2809. Minimum Time to Make Array Sum At Most x redo