Interview
Interview
Notes for interview preparation, patterns, and post-interview review.
alg
Algorithm Study Notes
Core algorithm concepts and patterns for interview preparation — from basic traversal and data structures to advanced DP, backtracking, and bit manipulation.
1.1 Common Sorting & Searching Algorithms
Common sorting and searching algorithms with Java implementations — binary search, quick sort, merge sort, and bubble sort explained for interview prep.
1.2 Two Pointer Technique
Two-pointer technique explained with classic code challenges and Java solutions — inward traversal, unidirectional traversal, and staged traversal patterns.
2.1 HashMap
HashMap data structure explained — O(1) key-value lookups, common Java methods, and the classic Two Sum problem as a space-for-time tradeoff example.
2.2 HashSet
HashSet data structure — O(1) membership checks, deduplication patterns, and common use cases in algorithm problems.
2.3 Queue & Stack
Queue and Stack data structures — LIFO vs FIFO, Java implementations, and when to use each for algorithm problems.
2.4 Linked List
Linked list data structure explained with classic interview problems — dummy node technique, fast-slow pointers, and merging sorted lists with Java solutions.
2.5 Tree & DFS / BFS
Binary tree fundamentals, DFS traversals (pre/in/post-order, recursive and iterative), BFS level-order traversal, and heap data structure explained for interview prep.
design
general
tech