← Back

LeetCode Notes

34 problems solved, plus concept notes I keep coming back to.

Topics

Dynamic Programming

18 sec read

Dynamic Programming splits problems into smaller overlapping subproblems and builds up solutions from base cases.

Greedy

22 sec read

Greedy algorithms iterate by always selecting the locally optimal choice at each step.

Sorting

58 sec read

Notes on sorting algorithms, time complexity bounds, and binary search patterns.

Strings

10 sec read

Started doing c++ string problems. I can do stuff like arrays and hashing kinda problems but never actually done cpp strings problem

Questions

475. Heaters

10 sec read ·

medium · array · two-pointers · binary-search · sorting

169. Majority Element

27 sec read ·

easy · array · hash-table · divide-and-conquer · sorting · counting

695. Max Area of Island

10 sec read ·

medium · array · depth-first-search · breadth-first-search · union-find · matrix

200. Number of Islands

10 sec read ·

medium · array · depth-first-search · breadth-first-search · union-find · matrix

322. Coin Change

35 sec read ·

medium · array · dynamic-programming · breadth-first-search

53. Maximum Subarray

23 sec read ·

medium · array · divide-and-conquer · dynamic-programming

70. Climbing Stairs

34 sec read ·

easy · math · dynamic-programming · memoization

455. Assign Cookies

26 sec read ·

easy · array · two-pointers · greedy · sorting