Skip to content

paulonteri/data-structures-and-algorithms

Advanced Binary Search

paulonteri/data-structures-and-algorithms

Data Structures and Algorithms
Data Structures and Algorithms
Data Structures and Algorithms 16913c6fbd244de481b6b1705cbfa6be
Data Structures and Algorithms 16913c6fbd244de481b6b1705cbfa6be
- Complexity Analysis & Big O
- Greedy Algorithms
- Hashtables & Hashsets
- Heaps & Priority Queues
- Math Tricks
- One of those
- Python basics
- Quick Tips
- Recursion, DP & Backtracking
- Searching
- Sorting
- Stacks & Queues
- Strings, Arrays & Linked Lists
- TODO
- Trees & Graphs
- Trie (Keyword Tree)
- _Object-Oriented Analysis and Design
- _Patterns for Coding Questions
- Strings, Arrays & Linked Lists 81ca9e0553a0494cb8bb74c5c85b89c8
  Strings, Arrays & Linked Lists 81ca9e0553a0494cb8bb74c5c85b89c8
  - Untitled Database a6aee36cf3b9470ea0f88713ab30a9e6
    Untitled Database a6aee36cf3b9470ea0f88713ab30a9e6
    
    adds all elements of a list to another list
    
    adds an element to the end of the list
    
    inserts an item at the defined index
    
    removes all items from the list
    
    removes an item from the list
    
    returns a shallow copy of the list
    
    returns and removes an element at the given index
    
    returns the count of the number of items passed as an argument
    
    returns the index of the first matched item
    
    reverse the order of items in the list
    
    sort items in a list in ascending order
- Trees & Graphs edc3401e06c044f29a2d714d20ffe185
  Trees & Graphs edc3401e06c044f29a2d714d20ffe185
  - Operations afa24885f0c94372b3f16d911d3c5e13
    Operations afa24885f0c94372b3f16d911d3c5e13
    
    Delete
    
    Insert
    
    Lookup
    
    Maximum
    
    Minimum
    
    Predecessor
    
    Successor
- Object Oriented Analysis and Design 1a01887a9271475da7b3cd3f4efc9e0d
  Object Oriented Analysis and Design 1a01887a9271475da7b3cd3f4efc9e0d
  - Design a Library Management System
  - Design a Parking Lot
  - Design an ATM
  - Composition vs Inheritance 9c1dc560a2724a8ea8a3797540ee10ef
    Composition vs Inheritance 9c1dc560a2724a8ea8a3797540ee10ef
    
    Difference
    
    Difference
    
    advantages
  - Overloading Comparison Operators 81101d971d0e4dad92625b304e846520
    Overloading Comparison Operators 81101d971d0e4dad92625b304e846520
    
    Equal to
    
    Greater than
    
    Greater than or equal to
    
    Less than or equal to
    
    Not equal to
  - Python Operator Overloading 0e8809af87164a039f103691140df730
    Python Operator Overloading 0e8809af87164a039f103691140df730
    
    Addition
    
    Bitwise AND
    
    Bitwise Left Shift
    
    Bitwise NOT
    
    Bitwise OR
    
    Bitwise Right Shift
    
    Bitwise XOR
    
    Division
    
    Floor Division
    
    Multiplication
    
    Power
    
    Remainder (modulo)
    
    Subtraction
- Patterns for Coding Questions e3f5361611c147ebb2fb3eff37a743fd
  Patterns for Coding Questions e3f5361611c147ebb2fb3eff37a743fd
  - Advanced Binary Search
  - Bit Manipulation
  - Cyclic Sort
  - DP
  - Heap Tricks *
  - Merge Intervals
  - Parenthesis
  - Pointers
  - Subsets, Permutations & Combinations *
  - Suffix Trees & Arrays
  - Trees & Graphs (Additional content)
  - _Other
  - Bit Manipulation 8c5610224bc34e8d90ac23914734bdce
    Bit Manipulation 8c5610224bc34e8d90ac23914734bdce
    
    XOR 985656fb96144a739ce8ac8e2c447fa0
    XOR 985656fb96144a739ce8ac8e2c447fa0
    
    0
    
    0
    
    1
    
    1
  - DP f1cdccd481ba461ea65ea993e984da07
    DP f1cdccd481ba461ea65ea993e984da07
    
    0/1 Knapsack (Dynamic Programming)
    
    Jump Game
    
    Kadane's Algorithm
    
    Levenshtein Distance *
    
    Longest Increasing Subsequence
    
    Palindromes
    
    Staircase
  - Heap Tricks e3f1996b84f54cc7a09f289d0d74f0cb
    Heap Tricks e3f1996b84f54cc7a09f289d0d74f0cb
    
    K-Way Merge
    
    Top/Smallest/Frequent K elements *
    
    Two Heaps
  - Pointers c5f2aa24da174319aec737993acf4e6a
    Pointers c5f2aa24da174319aec737993acf4e6a
    
    Find cycle in list
    
    Hare & Tortoise Algorithm
    
    Sliding Window
    
    Two Pointers
  - Trees & Graphs (Additional content) 0fcf8228f7574bfc90076f33e9e274e0
    Trees & Graphs (Additional content) 0fcf8228f7574bfc90076f33e9e274e0
    
    Bipartite graph/Look for even cycle using graph coloring
    
    Dijkstra's Algorithm
    
    Iterative traversals on Trees
    
    Less than, Greater than in BST
    
    Prim's Minimum Spanning Tree Algorithm
    
    Segment Trees: Range queries and Updates
    
    Topological Sort (for graphs) *
    
    Union find (disjoint set)
  - Other 40309fe5fdb74185b00fd1848a50054c
    Other 40309fe5fdb74185b00fd1848a50054c
    
    Divide and Conquer
    
    More
    
    Recursive iteration
    
    Reservoir sampling
    
    More 96929a3286bd4c8db1d462e581c566e0
    More 96929a3286bd4c8db1d462e581c566e0
    
    Convert recursion to iteration
    
    In-place reversal of linked list
Print as PDF

Advanced Binary Search

Coding Patterns: Modified Binary Search

Also known as Advanced Binary Search

The full content can be found here.

Find the original version of this page (with additional content) on Notion here.

Last update: December 13, 2021 16:05:48
Created: December 13, 2021 16:05:48

Authors: paulonteri (50.0%), Not Committed Yet (50.0%)