NMTLE
Introduction
Data Structure
- Linked List
- Tree
  - Traversal
  - Level Order Traversal
  - Populating Next Right Pointers in Each Node
  - Right Side View
  - Path Sum
  - Maximum path sum
  - Binary Tree Paths
  - Sum Root to Leaf Numbers
  - Same Tree
  - Symmetric Tree
  - Max depth of tree
  - Min depth of tree
  - Validate Tree
  - Invert Tree
  - Upside Down
  - Flatten Tree
  - Longest Consecutive Sequence
  - Count the number of nodes of complete binary tree
  - Lowest common ancestor
  - Binary Search Tree
  - Recover Binary Search Tree
  - Decodes & encoded data to tree
  - Construct Binary Tree
  - Valid Serialization
  - Successor
  - Closest Binary Search Tree Value
  - Unique Binary Search Trees
  - Unique Binary Search Trees II
  - Prefix Tree
    - Implement Trie
    - Word Dictionary
  - Segment Tree
    - Range Sum Query - Mutable
  - Binary Index Tree
    - Range Sum Query - Mutable
    - Range Sum Query 2D - Mutable
- Heap
  - Find Median from Data Stream
  - Kth Largest Element in an Array
  - Sliding Window Maximum
  - The Skyline Problem
  - Ugly Number
    - Ugly Number
    - Super Ugly Number
    - Ugly Number II
- Stack & Queue
- Iterator
  - Peeking Iterator
  - Zigzag Iterator
Search
- Binary Search
  - Search Insert Position
  - Find Peak Element
  - Search in Rotated Sorted Array
  - Search in Rotated Sorted Array II
  - Find Minimum in Rotated Sorted Array
  - Find Minimum in Rotated Sorted Array II
  - Search for a Range
  - Find the Duplicate Number
  - Median of Two Sorted Arrays
  - Search a 2D Matrix
  - Search a 2D Matrix II
  - Smallest Rectangle Enclosing Black Pixels
- Hash
  - Valid Anagram
  - Group Anagram
  - Word Pattern
  - Isomorphic Strings
  - Happy Number
  - Longest Substring
    
    Longest Substring Without Repeating Characters
    
    Longest Substring At most k
    
    Minimum Window Substring
  - Bulls and Cows
  - Count Primes
Dynamic Programming
- Count
- Matrix
- Sequence
  - Interleaving String
  - Distinct Subsequences
  - Edit Distance
  - Longest Increasing Subsequence
- Jump Game
- House Robber
- Paint House
- Gas Station
- Dungeon Game
- Maximal Square
- Maximal Rectangle
- Best Time to Buy and Sell Stock
- Coin Change
- Perfect Squares
- Subarray
  - Maximum Subarray
  - Maximum Product Subarray
- Range Sum Query - Immutable
- Decode Ways
Sorting
- Intervals
- Sort Colors
- Wiggle Sort
- Wiggle Sort II
- Largest Number
- H-Index
- Group Shifted Strings
- Maximum Gap
- Best Meeting Point
Graph
- BFS
  - Clone Graph
  - Word Ladder
- DFS
  - Combination
    - Combination Sum
    - Letter Combinations of a Phone Number
    - Generate Parentheses
    - Factor Combinations
    - Subsets
    - Restore IP Addresses
  - Permutation
    - Permutations
    - Permutations II
    - Next Permutation
    - Permutation Sequence
    - Palindrome Permutation
    - Palindrome Permutation II
    - Palindrome Partitioning
    - Palindrome Partitioning II
  - Different Ways to Add Parentheses
  - Palindrome Permutation
  - Word Search
  - Word Search II
  - Word Break
  - Word Break II
  - Burst Balloons
  - N-Queens
  - N-Queens II
  - Sudoku
  - Sudoku Solver
  - Expression Add Operators
  - Additive Number
  - Generalized Abbreviation
  - Longest Increasing Path in a Matrix
  - Walls and Gates
  - Nested List Weight Sum
- Union Find
- Topological sort
  - Course Schedule
  - Course Schedule II
Math
Bit Manipulation
Backtracking
Array & String
Other
- Nested List
  - Flatten Nested List Iterator
  - Nested List Weight Sum
Numbers
Geometry
- Self Crossing
- Container With Most Water
- Trapping Rain Water
Palindrome Pairs

Powered by GitBook

Segment Tree

Segment Tree

Runtime Complexity

Tree construction: O(N) Query/Update: O(logN)

Space Complexity Total nodes: O(2n-1)

results matching ""

No results matching ""