Loading...

Algorithms | PuzzledQuant Courses

🎥 Solution videos are here - Watch walkthroughs for selected problems. Check them out

Get quant-ready in 2026

⚡ Build the skills to land top-paying quant jobs. Offer ends in 17d 23h 00m 32s17 days 23 hours 0 minutes 32 seconds.

Problems
Resources
Jobs
New!
Games
Newsletter
New!
YouTube
Pricing

Problems
Resources
Resumes
Courses
Coding Exercises
Curated Lists
MCP
Jobs
Games
New!
Community
Discuss
Blog
Contribute
Share your story
Newsletter
YouTube
New!
Pricing

Sign In

Loading...

Copyright © 2026 - All rights reserved by PuzzledQuantLLP

PracticeQuestions by Firm Questions by Topic Guides

CommunityFeedback Feature Request Help Contribute Changelog

ServicesMCP Pricing Return & Cancellation Policy For Recruiters & Quant Firms

CompanyAbout Us Careers T&C Privacy Policy Contact Us

Social

Get quant-ready in 2026

⚡ Build the skills to land top-paying quant jobs. Offer ends in 17d 23h 00m 32s17 days 23 hours 0 minutes 32 seconds.

Home
Resources
Courses

Video course

Premium

Algorithms

Algorithms and data structures for interviews and contests. Short videos on the algorithms and data structures behind coding interviews and contests, from the complexity budget to graphs and range queries, each followed by a quiz and judged practice problems.

13 modules · 78 lessons · 5 h 56 min

Unlock with premium

Module 28 · Algorithms - Foundations

5:06
How a Judge Works and the Complexity Budget
4:15
Big-O, Amortized Analysis and Logarithms
4:55
C++ for Competitive Programming
4:20
The STL Tour
4:13
Recursion Basics

Module 29 · Algorithms - Arrays

4:17
Prefix Sums
4:36
2D Prefix Sums and Submatrix Queries
4:23
Difference Arrays
4:00
Prefix Sums and a Hash Map
4:48
Two Pointers
4:08
Sliding Window
5:04
Maximum Subarray
4:45
Minimum Stack, Minimum Queue and Sliding-Window Minimum

Module 30 · Algorithms - Strings

4:14
C++ Strings
4:07
Frequency Arrays, Anagrams and Palindromes
4:52
Tries
4:11
Brute-force String Matching
5:17
String Hashing
4:38
Rabin-Karp and Hash with Binary Search
5:04
Prefix Function and KMP
4:22
Expression Parsing

Module 31 · Algorithms - Sorting and Searching

5:34
Elementary Sorts and the Lower Bound
5:16
Merge Sort and Counting Inversions
4:34
Quicksort and What std::sort Really Does
6:13
Binary Search
4:34
Binary Search on the Answer
4:10
The k-th Order Statistic

Module 32 · Algorithms - Linear Data Structures

4:14
Stacks
4:28
Monotonic Stack
3:58
Queues, Deques and Ring Buffers
4:41
Linked Lists and the LRU Cache
4:17
Floyd's Cycle Detection
5:13
Binary Heaps and priority_queue
3:55
Hash Maps

Module 33 · Algorithms - Recursion, Backtracking and Combinatorics

5:25
Recursion Trees and the Backtracking Template
4:22
Generating Subsets and Permutations
3:53
Backtracking with Pruning
5:04
Binomial Coefficients
4:13
Catalan Numbers
4:08
Stars and Bars

Module 34 · Algorithms - Greedy

5:25
Greedy Algorithms and the Exchange Argument
4:00
Sort-and-Match Greedy
4:07
Interval Scheduling
4:14
Sweep Line

Module 35 · Algorithms - Bits and Number Theory

4:44
Binary Representation and Bit Tricks
3:13
Gray Code
4:04
Binary Exponentiation
4:18
Euclid's Algorithm
4:50
Sieve of Eratosthenes
4:25
Integer Factorization by Trial Division
4:51
Modular Arithmetic and the Modular Inverse
4:03
Number and Sum of Divisors

Module 36 · Algorithms - Dynamic Programming

5:23
What DP Is: Memoization vs Tabulation
4:06
Classic 1D DP
4:36
Knapsack
4:40
Longest Increasing Subsequence
3:54
Grid and Two-Sequence DP

Module 37 · Algorithms - Graphs I

3:52
Graph Representations
5:28
Breadth-First Search
4:28
Depth-First Search
4:07
Connected Components and Bipartiteness
4:45
Finding a Cycle
3:59
Topological Sort and DAG DP

Module 38 · Algorithms - Graphs II

4:38
Dijkstra
4:42
Dijkstra on Sparse Graphs
4:17
0-1 BFS and Dial's Algorithm
4:23
Floyd-Warshall
5:23
Kruskal's Minimum Spanning Tree
4:28
Prim's Minimum Spanning Tree

Module 39 · Algorithms - Trees and Range Queries

4:15
Tree Basics
4:48
Diameter and Farthest Distances
4:07
The Update-Query Trade-off
4:59
Fenwick Tree
4:55
Disjoint Set Union
5:39
Segment Tree

Module 40 · Algorithms - Capstone

5:29
The Problem-Solving Routine
4:14
Stress Testing and Debugging Under Pressure
4:15
Trading-Firm Coding Questions