Skip to content

todo.md

Latest commit

 

History

History
19 lines (16 loc) · 1.19 KB

todo.md

File metadata and controls

19 lines (16 loc) · 1.19 KB

  • Add KMP algorithm to js/implement-strStr.js

  • Understand and code the divide and conquer approach for js/maximum-subarray.js

  • Solve the sqrt problem in log(n) time (binary search) js/sqrt(x).js

  • Solve The Longest Common Prefix problem with a Trie js/longest-common-prefix.js

  • Implement the divide and conquer algorithm for Merge K Sorted Lists problem (both js and python)

  • Refactor Next Permutation both for JS and PY.

  • Add intuition and thought process for Bulb Switcher.

  • Solve Predict the Winner

  • Add other approaches, including sorting and Two Pointers and sorting and Binary Search for Smallest String Starting from Leaf

  • Add JS solution for Smallest Subtree with all the Deepest Nodes (LC 865)

  • Learn and implement the elegant solution from LT for Smallest Subtree with all the Deepest Nodes (LC 865)

  • Solve Insufficient Nodes in Root to Leaf Paths by returning nodes instead of the maximum value (LC 1080)

  • Solve Remove All Adjacent Duplicates in String II with two pointers method (1209)

  • Refactor Spiral Matrix and solve like official solution (LC 54)

  • Refactor Spiral Matrix II (LC 59)

  • Write all solutions in Python