pondjames007 / codingpractice

Coding Practice

Records for my LeetCode coding practice, following HuaHua's Guide

Premium Problems (Video Link): $681(Medium, String), $734(Easy, HashTable), $737(Medium, Graph), $683(Hard, BinaryTree), $742 (Medium, Graph), $681 GOOGLE OA (Medium, Simulation), $683 (Hard, Simulation), $755 (Medium, Simulation)

6/24: String --- #848, #792, #784, #763, #748, #720

6/25: Binary Tree --- #208, #404, #655, #637, #617, #606, #113

6/26: Search --- #079, #200, #547, #127, #039

6/27: Hash Table --- #001, #141, #139, #676, #146, #451

6/28: Math --- #633, #504, #463, #241, #204, #611

6/30: Greedy --- #561, #628, #455, #675

7/1: Design & Data Structure --- #295, #380, #381, #297, #677, #432

7/2: Graph --- #332, #684, #690, #207, #733

7/3: Linked List --- #725, #817, #148, #707, #021, #023

• Linked List FINISHED

7/4: Binary Search --- #729, #744, #540, #719

• First Review 6/24 String --- #848, #792, #784, #763, #748, #720
• Binary Search: Only HARD left

7/5: Bit --- #169, #477, #476, #762, #289

• First Review 6/25 Binary Tree --- #208, #404, #655, #637, #617, #606, #113

7/8: Geometry --- #218, #056, #057, #149, #731, #452

7/9: Dynamic Programming --- #303, #070

7/10: Dynamic Programming --- #120, #053, #062

7/14: String --- #551, #680, #409, #678

• String: Only HARD and Premium $681(Medium) left

7/15: Binary Tree --- #100, #110, #102, #671, #669, #654, #145

7/16: Search --- #040, #216, #017, #322, #787, #801

7/17: Hash Table --- #692, #347, #560, #438, #567, #525

• First Review 6/26: Search --- #079, #200, #547, #127, #039

7/18: Math --- #268, #728, #754, #263, #264, #069

• First Review 6/27: Hash Table --- #001, #141, #139, #676, #146, #451

7/19: Greedy --- #621, #826, #334

• Greedy: Only HARD left
• First Review 6/28: Math --- #633, #504, #463, #241, #204, #611

7/22: Design & Data Structure --- #895, #745, #715, #460

• Design & Data Structure: FINISHED (715, 460 haven't watched the video)

7/22: Graph --- #399, #743

7/23: SP: Algo and DS ---

• Union Find Set: #684, #547, $737,
• Input Size VS Time Complexity
• Fenwick Tree: #307
• Time/Space Complexity of Recursive Algorithms: #741, #312

7/24: SP: Algo and DS ---

• Binary Search: #069, #278, #875, #378
• Amortized Analysis: #901
• Dynamic Programming I: #070, #062
  • 1D, 2 sets of sub-problems: #926, #845
  • 1D with multiple states: #801, #926, #790, #818
• Dynamic Programming II:
  • 1.1 O(n): #070, #198, #746, #790,#801
  • 1.2 O(n): #139, #818
  • 1.3 O(n)+O(m): #072, #712
  • 1.4 O(n): #312, #664, #673
  • 1.5 O(n): #546
  • 1.6 O(n), k: #322, #494
  • 1.7 O(n), k: #813
  • 2.1 O(nm): #062, #063, #064
  • 2.2 O(nm): #688, #576, #741, Floyd-Warshall

7/25: SP: Algo and DS ---

• Knapsack Problem I:
• Knapsack Problem II:
• Trees I: #100, #101, #951
• Segment Tree: #307
• Binary Search II: #278, #069

7/29: Union Find Set --- #685, #839, #959

7/29: Dynamic Programming --- #901, #926

7/30: Dynamic Programming --- #790

8/1: Bit --- #078, #898

• Bit: Only HARD left

8/1: Geometry --- #973

• Geometry: Only HARD left

8/1: Binary Tree --- #687, #543

8/2: Search --- #967, #417

• Search: Only HARD left

8/2: Graph --- #210, #841, #802, #886

8/6: Dynamic Programming --- #198, #746, #712, #072, #673

8/7: Dynamic Programming --- #494, #813

8/9: Dynamic Programming --- #063, #064, #688, #576

8/9: Binary Tree --- #104, #111, #112, #101, #951

8/12: Divide and Conquer --- #153, #154, #775

• Divide and Conquer: FINISHED

8/13: Recursion --- #726, #736, #464, #856, #1106

• Recursion: FINISHED

8/14: Simulation --- #657, #566, #682, #461, #735, #636, #799

• Simulation: Only HARD and Premium $681 GOOGLE OA (Medium), $683 (Hard), $755 (Medium) left

8/15: Math --- #470, #923, #1017

• Math: Only HARD left

8/15: Hash Table --- #873, #1124

• Hash Table: Only HARD left

8/16: Graph --- #934, #1129

1/6: Others --- #239