algonotes
Introduction
Sort
mergeSort
quickSort
selection sort
Recursion1 & Binary search
Fibonacci
Binary Search
a to the power of b
closest number in sorted array
K closest in sorted array
search in unknown sized sorted array
search in 2D sorted Matrix
Binary Tree & Binary Search Tree
In-order Traversal Of Binary Tree
Balanced Binary Tree
Symmetric Binary Tree
Delete in BST
postOrder traversal
preOrder traversal
Tweaked Identical binary tree
is BST or not
get keys in bst in given rage
LinkedList
Reverse LinkedList
find middle of linkedList
check if LinkedList has a circle
insert in sorted LinkedList
merge two sorted linkedlist
reOrder linkedlist
partition linkedList
PriorityQueue， BFS，BFS2
Kth Smallest Number In Sorted Matrix
Kth smallest in unsorted array
check if binary tree is complete
tree level traversal
DFS
All Subsets
String I
String II
Reverse Words in a sentence
String Replace
Bit Representation and Bit operation
power of 2
number of different bits
All Unique Characters ||
Hexadecimal Representation
DP 1
Longest Ascending Array
Max Product of Cutting Rope
Jump Game
DP2
Dictionary Word
Jump Game 2
Edit Distance
Largest square of 1s'
Largest subarray sum
DP 3
longest consecutive 1s
Largest X of 1s
Longest Cross of 1s
largest sub square surrounded by 1
queries (any two index's sum)
Largest SubMatrix Sum
Data Structures' Implementation
Queue
Stack
Queue by two stacks
stack with min()
HashMap
Implement Min Heap
Probability, Sampling, Random
Perfect shuffle
Reservoir Sampling
Singleton
Powered by
GitBook
Recursion1 & Binary search
Recursion1 & Binary search
results matching "
"
No results matching "
"