Technical Interview Preparation Notes
Introduction
Algorithm
Array
Partition Array
Small Difference
Sub-array Sum I
Sub-array Sum II
Longest Common Sub-sequence
Longest Increasing Continuous I Sub-sequence
Longest Increasing Continuous Sub-sequence II
Matrix
Max Points on A line
Search In Matrix I
Search In Matrix II
Set Zero
Rotate Matrix
Sub-matrix Sum
String
Longest Sub-string has K Distinct Character
Longest Sub-string Windows has Non-repeat Characters
Minimum Window
Word Pattern
Longest Palindromic Substring
Shortest Word Distance
Group Shifted String
Encode String
Encode and Decode Strings
Palindrome Permutation
Sort
Elementary Sort
Advanced Sort
Linear Sort
Sort Color I
Sort Color II
Largest Number
Wiggle Sort
Sort Letters by Case
Binary Search
Closest Number
3 Sum Smaller
Count Smaller Number
Triangle Count
Recursion
Print Numbers by Recursion
Permutation
Permutation Index I
Permutation Index II
Permutation Sequence
Next Permutation
Previous Permutation
Backtracking
K Sum II
N Queen I
N Queen II
Subsets
Phone Number
Boggle Game
Scramble Number Pair Calculator
Strobogrammatic Number
Factor Combinations
Dynamic Programming
Home Robber
Backpack I
Backpack II
Edit Distance
Longest Increasing Subsequence
Minimum Adjustment Cost
Coins in A Line (I ~ III)
Distinct Subsequences
Maximal Square
Interleaving String
Word Break
Scramble String
Maximum Subarray III
Paint House
Linked List
Remove Linked List Element
Remove Nth Element from End of List
Swap Nodes by Pairs in Linked List
Intersection of Linked List
Flatten Binary Tree to Linked List
Palindrome Linked List
Reverse List in K-Group
Copy Random Pointer
Merge K Sorted Linked List
Convert Linked List to Binary Search Tree
Tree
Tree Traversal
Invert Tree
Depth of Tree
Balanced Tree
Lowest Common Ancestor
Search Range in Binary Search Tree
Count Univalue Subtree
Verify Preorder Sequence in BST
Closest BST Value
Graph
Route Between Directed Graph
Graph Valid Tree
Find the Celebrity
Alien Dictionary
Segment Tree
Segment Tree Build I
Segment Tree Build II
Segment Tree Query I
Segment Tree Query II
Segment Tree Modify
Interval Sum I
Interval Sum II
Interval Minimum Number
Count Smaller Number before itself
Math
Integer To Roman
Roman to Integer
Ugly Number I
Ugly Number II
Fast Power
Square Root
Binary Representation
Divide Two Integers
Digit Counts
Expression
Reverse Polish Notation (RPN)
Convert Expression to RPN
Convert Expression to PN
Calculator
Expression Tree Build
Bit Manipulation
Update Bits
Data Structure
Primitive Type
Collection
Array List
Linked List
Stack
Queue
Hash Set
Map
Hash Map
Iterator
Iterator for Two Dimension Array
Iterator of Iterators
Peek Iterator
Even Iterator
Jump Iterator
Joint Set
Prefix Tree
Trie Tree
Segment Tree
Object Oriented Programming
Design Pattern
Practice
Deck Card
Chess Game
Online Reader
Parking Lot
Vending Machine
System Design
Distributed System Knowledge
Behavior Questions
Questions on Past Projects
Powered by
GitBook
Practice
results matching "
"
No results matching "
"