Solutions to LeetCode 394 Decode String. LeetCode 394Decode String (Medium) [link] Time complexity O(n). Space complexit

Solutions to LeetCode 973 K Closest Points to Origin LeetCode 973K Closest Points to Origin (Medium) [link] 1] Python So

Solutions to LeetCode 937 Reorder Data in Log Files LeetCode 937Reorder Data in Log Files (Medium) [link] class Solutio

Template Summary. Template of 0-1 Knapsack Problem0-1 knapsack problem: 2-d dp array: Outer for loop is iterating item

Summary of Recursion. LeetCode 77 Combinationsn is the width of the recursion tree. k is the depth of the recursion tree

Summary of Dynamic Programming IV. LeetCode 300 Longest Increasing SubsequenceDefine dp[i] the longest length of the su

Summary of Dynamic Programming III. (House Robber and Stock) LeetCode 198 House RobberWe can consider recursion as a top

Summary of Dynamic Programming II. (Knapsack problems) LeetCode 416 Partition Equal Subset SumWe want to find a subset o

Summary of Dynamic Programming I. (Basics) DP 5 Steps: Define dp table, i, j Determine recurrent relation Initialize dp

Summary of Binary Search Tree. LeetCode 700 Search in a Binary Search Tree# Definition for a binary tree node. # class

Summary of Binary Tree. (preorder, inorder, postorder, level-order traversal not included) LeetCode 101 Symmetric Tree#

Summary of Stack & Queue. LeetCode 232 Implement Queue using Stacksclass MyQueue: def __init__(self): s