Cracking Leetcode

😎Welcome to TimmyBeef's Cracking Leetcode
Recursion tips
Atlas
- 1366. Rank Teams by Votes
3 pointers
- 689. Maximum Sum of 3 Non-Overlapping Subarrays
two pointer
stack & queue
Tree
DFS & BFS
Binary Search (BS)
Greedy
Divide and Conquer
- 169. Majority Element
- 4. Median of Two Sorted Arrays
Linked List
Dynamic programming (DP)
1218. Longest Arithmetic Subsequence of Given Difference
940. Distinct Subsequences II
552. Student Attendance Record II
664. Strange Printer (區間型 dp
1130. Minimum Cost Tree From Leaf Values (區間型
403. Frog Jump
494. Target Sum
(array, can be dp)1014. Best Sightseeing Pair
139. Word Break
140. Word Break II (backtracking)
472. Concatenated Words
Page 10
139. Word Break
140. Word Break II
1387. Sort Integers by The Power Value
894. All Possible Full Binary Trees
Binary search + Robin karp(rolling hash)
- 1044. Longest Duplicate Substring
- 1062. Longest Repeating Substring (bs + rolling hash
HashTable, HashMap, HashSet
FB Study way
- Facebook Tips
noname
Top K elements (heap, bucket sort)
bit
String problem
array problem or interval
queue, dqueue
- mono queue
stack
Quick Sort, Quick Select, Kth smallest, Partition
Heap
1405. Longest Happy String
1642. Furthest Building You Can Reach
Sort
Design
Union Find
Topology sort
merge sort realated
- 315. Count of Smaller Numbers After Self
Path related
- Dijkstra's Algo
- 1102. Path With Maximum Minimum Value
Couting sort
- 1122. Relative Sort Array
- 825. Friends Of Appropriate Ages
Trie
Page 3
Math
Prefix Sum
Weekly Contest
O(n) to find top2 min or max number

Powered by GitBook

On this page

Was this helpful?

DFS & BFS

DFS

backtracking tips

Page 9

Previous47. Permutations II (i = 0, sort, used Next39. Combination Sum (not use befroe, so int I = start, dfs(i) -> is i !!

Last updated 2 years ago