AlgoMonster
🏗️ Templates⚡ Speedrun 💨🧭 Roadmap
More
Premium
📺 Youtube💬 Discord📈 My Stats👉 Log In
You current level is Student
0%
Full Statistics
Filter by tags

Overview

  • Top Patterns to Conquer the Interview
  • The PTS System
  • Math Basics
  • Runtime to Algo Cheat Sheet
  • Keyword to Algo Cheat Sheet

Basic Data Structures

  • Stack Intro
  • Queue Intro
  • Hashmap Intro
  • Python Basic Data Structures
  • Java Basic Data Structures
  • JavaScript Basic Data Structures
  • C++ Basic Data Structures

Basic Algorithms

  • Intro to Sorting
  • Advanced Sorting Algorithms - Merge Sort | Quick Sort
  • Sorting Summary
  • Built-in Sort with Custom Comparator

Overview

  • Vanilla Binary Search
  • First True in a Sorted Boolean Array

Sorted Array

  • Monotonic Function
  • First Element Not Smaller Than Target
  • First Occurrence
  • Square Root Estimation

Implicitly Sorted Array

  • Minimum in Rotated Sorted Array
  • Peak of Mountain Array

Advanced

  • Newspapers

Speedrun

  • Binary Search Speedrun

Introduction

  • Recursion Review
  • Everything About Trees
  • DFS Fundamentals

DFS on Tree

  • Introduction
  • Max Depth of A Tree
  • Visible Tree Node
  • Balanced Binary Tree
  • Serializing and Deserializing Binary Tree
  • Invert Binary Tree

Binary Search Tree

  • Binary Search Tree Intro
  • Valid Binary Search Tree
  • Insert Into BST
  • Lowest Common Ancestor of a Binary Search Tree

Advanced

  • Lowest Common Ancestor

Combinatorial Search

  • DFS with States
  • Backtracking 1
  • Generate All Phone Number Combinations

Pruning

  • Backtracking 1 - Pruning
  • Partition a String Into Palindromes

Additional States

  • Backtracking 1 - Additional States
  • Generate All Valid Parentheses
  • General All Permutations

Aggregation and Memoization

  • Backtracking 2 - Aggregation
  • Memoization
  • Word Break
  • Num Ways to Decode a Message
  • Min Coins to Make Change

Dedup

  • Deduplication
  • Combination Sum

Additional Practices

  • Subsets

Speedrun

  • Backtracking Speedrun

Introduction

  • BFS Fundamentals

BFS on Tree

  • Binary Tree Level Order Traversal
  • Binary Tree ZigZag Level Order Traversal
  • Binary Tree Right Side View
  • Binary Tree Min Depth

Introduction

  • Graph Fundamentals
  • BFS on Graphs
  • DFS on Graph
  • BFS or DFS

Vanilla BFS

  • Shortest Path

Matrix as Graph

  • Matrix as Graph
  • Flood Fill
  • Number of Islands
  • Knight Minimum Moves
  • Walls and Gates / Zombie in Matrix

Implicit Graph

  • Open the Lock
  • Word Ladder
  • Sliding Puzzle

Directed Graph / Topological Sort

  • Topological Sort Introduction
  • Task Scheduling
  • Reconstructing Sequence
  • Task Scheduling 2
  • Alien Dictionary
  • Course Schedule

Weighted Graph

  • Dijkstra's Algorithm | Shortest Path in a Weighted Graph

Minimum Spanning Tree

  • Introduction to Minimum Spanning Tree
  • Minimum Spanning Tree | Forests

Speedrun

  • Graph Speedrun - Part 1
  • Graph Speedrun - Part 2

Introduction

  • Two Pointers Introduction

Same Direction

  • Remove Duplicates
  • Middle of a Linked List
  • Move Zeros

Opposite Direction

  • Two Sum Sorted
  • Valid Palindrome

Sliding Window

  • Subarray Sum - Fixed
  • Find All Anagrams in a String
  • Sliding Window - Longest
  • Longest Substring without Repeating Characters
  • Sliding Window - Shortest
  • Least Consecutive Cards to Match

Prefix Sum

  • Subarray Sum

Cycle Finding

  • Linked List Cycle

Advanced

  • Minimum Window Substring
  • Teleporter Arrays

Speedrun

  • Two Pointers Speedrun

Introduction

  • Heap Fundamentals

Top K

  • K Closest points
  • Merge K Sorted Lists
  • Kth Largest Element in an Array
  • Kth Smallest Element in a Sorted Matrix

Moving Best

  • Reorganize String
  • Ugly Number

Multiple Heaps

  • Median of Data Stream

Introduction

  • Dynamic Programming Introduction and Patterns

Knapsack

  • Knapsack, Weight-Only
  • Partition to Two Equal Sum Subsets
  • Triangle

Coin Change

  • Coin Change
  • Coin Change II

Grid

  • Number of Robot Paths
  • Minimal Path Sum

Dynamic number of subproblems

  • Longest Increasing Subsequence
  • Largest Divisible Subset
  • Perfect Squares

Interval

  • Interval Dynamic Programming | Coin Game
  • Festival Game

Two Sequences

  • Longest Common Subsequence
  • Edit Distance
  • Delete String

0-1 Knapsack

  • 0-1 Knapsack

Bitmask

  • Bitmask Introduction
  • Min Cost to Visit Every Node

Disjoint Set Union | Union Find

  • DSU/Union Find Fundamentals
  • DSU Introductory Problem
  • Size of Connect Components
  • Umbristan | Reverse Union Find
  • Merge User Accounts
  • Number of Connected Components

Trie

  • Trie Introduction
  • Autocomplete
  • Prefix Count

Data Structure Design

  • LRU Cache

Segment Tree

  • Segment Tree
  • Range max

Interval

  • Intervals
  • Merge Intervals
  • Insert Interval
  • Meeting Room

Monotonic Stack

  • Monotonic Stack/Queue Intro
  • Sliding Window Maximum
  • Daily Temperatures
  • Next Greater Element II

Divide and Conquer

  • Divide and Conquer Intro
  • The Skyline Problem
  • Count of Smaller Numbers After Self

Line Sweep

  • Line-Sweep Introduction

Tree Traversal without Recursion

  • Closest BST Values II

Greedy

  • Gas Station

Math

  • Prime Sieve Introduction
  • N-th prime

Matrix

  • Sparse Matrix Multiplication

Classics

  • Playing Cards
  • Parking Spots
  • Public Library
  • Call Center
  • Vending Machine

Concepts

  • Load Balancing
  • Partition and Sharding
  • Caching

Projects

  • URL Shortener | TinyURL | System Design Interview Question
  • Web Crawler

Amazon OA

  • Amazon Online Assessment Questions 2021 (OA)
  • Robot in Circle
  • Number Game
  • Find All Combination of Numbers that Sum to a Target
  • Fill The Truck
  • Slowest Key
  • Five Star Sellers
  • Number of Ways to Split Into Primes
  • Storage Optimization
  • Music Pair
  • Minimum Difficulty of a Job Schedule
  • Autoscale Policy, Utilization Check
  • Optimal Utilization
  • Merge Two Sorted Lists
  • Two Sum - Unique Pairs
  • Shopping Patterns
  • Amazon Prime Air Delivery Route
  • Reorder Data in Log Files
  • Top K Frequently Mentioned Keywords

Microsoft OA

  • Microsoft Online Assessment Questions
  • Max Network Rank
  • Minimum Adj Swaps to Make Palindrome
  • Lexicographically Smallest String
  • Longest Substring Without 3 Contiguous Occurrences of Letter
  • Min Moves to Obtain String Without 3 Identical Consecutive Letters
  • String Without 3 Identical Consecutive Letters
  • Longest Semi-Alternating Substring
  • Min Steps to Make Piles Equal Height
  • Day of week that is K days later
  • Max Inserts to Obtain String Without 3 Consecutive 'a'
  • Concatenated String Length with unique Characters
  • Largest K such that both K and -K exist in array
  • Min Adj Swaps to Group Red Balls
  • Maximum Length of a Concatenated String with Unique Characters
  • Unique Integers That Sum Up To 0
  • Min Deletions To Obtain String in Right Format
  • Particle Velocity
  • Widest Path Without Trees
  • Jump Game
  • Fair Indexes
  • Partition array into N subsets with balanced sum

Google OA

  • Google Online Assessment Questions 2021 (OA)
  • Compare Strings
  • Largest Subarray
  • Maximum Area Serving Cake
  • Minimum Number of Decreasing Subsequence Partitions
  • Pick Up Coupons
  • Rose Garden
  • Smallest Integer Satisfying the Rule
  • Fill 2D Array
  • Water Plants
  • Split Strings
  • Google Online Assessment 2021 (OA) - Rings on Rods
  • Google Online Assessment 2021 (OA) - Longest Palindrome

Twitter OA

  • Twitter Online Assessment Questions 2021 (OA)
  • K-Different Pairs
  • Weird Faculty
  • Social Network
  • University Career Fair
  • Game Events
  • Activate Fountain
  • Final Discounted Price
  • Partition Array
  • Authentication Tokens
  • Parking Dilemma
  • Efficient Job Processing Service
  • Unique Twitter User ID Set
  1. Backtracking
  2. Pruning
  3. Partition a String Into Palindromes
Go Premium
Join our community on Discord