Welcome to TheAlgorist.com: a one-stop-shop for mastering data structures and algorithms and building solid problem solving skill. Most textbooks do a phenomenal job at giving you great theoretical knowledge but often lack implementation details and hands-on coding experiences. TheAlgorist.com will bridge that gap. What makes our product different is our pragmatic approach to give you an in-depth knowledge on practical applications of each and every data structure and algorithm by solving real-world problems in minimal amount of time. You do not need to go on solving hundreds of problems in order to become proficient. Our curated list of problems below will help you build the thought process required to become a great problem solver and achieve success in as little time as possible. Have upcoming interviews at big tech companies and/or tech start-ups? We have got you covered!!

Browse by Topic

Free / Preview Chapters Dynamic Programming Graph Theory Backtracking Binary Search Tree Sliding Window Union Find Heap Shortest Path Algorithms Bit Manipulation Linked List Applications Sweep Line Technique Interesting Concepts Trie Reservoir Sampling Concurrent Programming Video Lessons

Backtracking Algorithm - I

Fundamentals Letter Case Permutation All Paths
Between Two Nodes Word Search Generate Parentheses T9 Keyboard Palindrome Partitioning Sudoku N-Queens N-Queens 2 Word Square

Backtracking Algorithm - II:
Combinatorics

Power Set Power Set w/ Duplicates Permutations Palindrome Permutation Permutations
w/ Divisibility Permutations
w/ Duplicates Combinations Combination Sum Combination Sum 2 Combination Sum 3

Binary Search

Fundamentals Advanced Binary Search Exact Square Root
of a Number Longest Repeating
Substring

Sliding Window

Core Concept
Minimum Window
Substring Grumpy Shopkeeper Longest Substring w/ Atmost
Two Distinct Characters Longest Substring w/ Atmost
K Distinct Characters Longest Substring
Without Repeating
Characters Find All Anagrams Substring
w/ Concatenation
of All Words Repeated DNA Sequences Limitations

Sweep Line Technique

Fundamentals of
Sweep Line Algorithm 1d Range Search Compute Closest Pair Convex Hull Dual Line Sweep &
Rectangles Union 2D Intervals Union &
Skyline Problem Overlapping 1D Intervals Merging Overlapping
1D Intervals Separating Overlapping
1D Intervals

Tree Data Structure

Binary Search Tree Binary Tree Iterators Recursive Traversal Track DFS Paths Boundary of Binary Tree BST (De)Serialization Binary Tree
(De)Serialization N-Ary Tree
(De)Serialization Tree Construction:
Inorder - Postorder Inorder - Preorder Inorder - Level Order

Iterative
Binary Tree Traversal

Iterative Preorder Traversal Powerful Approach of
Iterative Inorder Traversal Iterative Postorder
Traversal Iterative Postorder
Traversal
w/ Single Stack

Morris Traversal

Threaded Binary Tree Morris Preorder Traversal Morris Inorder Traversal Morris Postorder Traversal

Graph Theory

Graph Representation DFS BFS
Word Break
Web Crawler Bidirectional BFS Topological Sort 4 Ways to Finding Cycles Cycle Detection Using DFS All Paths Between
Two Nodes Bipartite Graph Connected Components Minimum Spanning Tree
Kruskal's Algorithm

Tarjan's Algorithm

Articulation Points &
Derivation of
Tarjan's Algorithm Finding Bridges Strongly Connected
Components (SCC) Minimal Vertices Spread A Message to
Entire Social Network

Advanced
Graph Problems

How to Send Message To
Entire Social Network Disconnected Network Critical Connection Minimal Vertices Course Scheduling

Shortest Paths Algorithms

Dijkstra's Algorithm Topological Sort
w/ Vertex Relaxation Bellman-Ford Algorithm &
Negative Cycle Detection

Cheapest Flight within
K Stops Optimized Bellman-Ford Arbitrage

Longest Paths Algorithm

Longest Paths Algorithm

Job Scheduling Problems

Sequential Job Scheduling Parallel Job Scheduling Parallel Job Scheduling
w/ Relative Deadlines

Union-Find or Disjoint Set Union

Fundamentals Longest Consecutive
Sequence Number of Islands Accounts Merge Redundant Connection Number of Provinces Valid Tree

Heap

Heap Fundamentals Heap: GetMax() / GetMin(),
DeleteMax() / DeleteMin()
and Insert() Heapify Heap Sort Priority Queue Kth Largest Element Merge K Sorted Lists Top K Frequent Words Median From Data Stream

Trie

Fundamentals
and Implementation Word Square

Linked List

Representation of Linked List Linked List Complexity Linked List Operations Traverse a Linked List Insert Elements to a Linked List Delete from a Linked List Search an Element on a Linked List Sort Elements of a Linked List Deleting a Node from a Singly Linked List The "Runner" Technique

Linked List - II

Types of Linked List Singly Linked List Circular Linked List Find middle element of LinkedList Remove Dups Return Kth to Last Delete Middle Node Linked ListPartition Linked List Intersection Loop Detection

Advanced Applications of
Linked Lists

LRU Cache LFU Cache Deep Copy of
LinkedList w/
Random Pointer

Dynamic Programming:
0/1 Knapsack Concept

DP Fundamentals 0/1 Knapsack Core Concept Subset Sum Problem
Partition Equal Subset Sum Count Subset Sum Minimum Subset
Sum Difference Target Sum Combination Sum Combination Sum with
Additional Constraint

Dynamic Programming:
Unbounded
Knapsack Concept

Core Concept Coin Change:
Minimum no. of Coins Coin Change: Total
Combinations Possible Combination Sum Combination Sum Count

Dynamic Programming:
State Machine Approach

Core Concept Stock Trading
w/ Cooldown Max Profit w/ Unlimited
Stock Trade Transactions Stock Trading w/
Transaction Fee Max Profit w/ at most
2 Stock Trade Transactions Max Profit w/ at most
K Stock Trade Transactions Max Profit w/ at most
1 Stock Trade Transaction

Dynamic Programming:
Longest
Increasing Subsequence

Core Concept Box Stacking Russian Doll Envelopes Largest Divisible Subset Longest String Chain Best Team with No Conflict Longest Bitonic
Subsequence

Dynamic Programming:
All possible Cuts
in all possible Intervals
for the Last Operation

Core Concept Matrix Chain Multiplication
or, Parenthesization Optimal Binary Search Tree Minimum Palindrome
Partitioning Burst Balloons

Dynamic Programming:
Kadane's Algorithm

Core Concept Maximum Product
Subarray Best Time to Buy
& Sell Stock

Dynamic Programming:
2-Strings Problems

Core Concept Longest Common
Substring Longest Common
Subsequence Shortest Common
Supersequence Interleaving String Edit Distance

Dynamic Programming:
1-String Problem

Core Concept Palindrome Longest Palindromic
Substring Longest Palindromic
Subsequence Minimum Palindrome
Partitioning Minimum Palindromic
Insertion

Dynamic Programming:
Advanced String Problems

Regular Expression
Matching Wildcard Matching

Dynamic Programming:
Other Techniques

Optimal Path(s) to Target Minimum Cost Tickets Counting DP Unique Paths Unique Paths Without
Obstructions Decision Making Approach House Robber Maximal Square

Interesting Concepts

Concept of
"Lower Envelope":
Trapping Rain Water Infix Expression Evaluation Insert, Delete, Contains,
Random Access in O(1) Taxicab Distance

BitMask and Bit Manipulation

Fundamentals Convert Binary
Number To One

Reservoir Sampling

Fisher-Yates Shuffling Reservoir Sampling

Concurrent Programming

How to Write
Production Grade
Concurrent Program ? How to Prevent Deadlock ? Multithreaded Web Crawler Synchronizers What is the Right
Way of Testing
Concurrent Program ?

Interview Tips

Not-To-Do List Follow-up Email
When You're Ghosted

Get Premium Access

See what all great accomplishments our customers have achieved by using our products:

If you are a student, get 25% Student Discount by clicking below:

Get 25% Discount