Home
Courses
1:1 Mentorship Program
Basic (C++ & DSA)
Advanced DSA
Basic + Advanced (C++ & DSA)
System Design
Jobs
Recruiters
Candidates
AlgoMaster Sheet
Cracker Sheets
Google Cracker Sheet
Microsoft Cracker Sheet
Hulu Cracker Sheet
Lyft Cracker Sheet
Meta Cracker Sheet
Netflix Cracker Sheet
Oracle Cracker Sheet
Stripe Cracker Sheet
Tesla Cracker Sheet
Twitter Cracker Sheet
Uber Cracker Sheet
Blog
Post Job?
Home
Courses
1:1 Mentorship Program
Basic (C++ & DSA)
Advanced DSA
Basic + Advanced (C++ & DSA)
System Design
Jobs
Recruiters
Candidates
Sheets
AlgoMaster Sheet
Google Cracker Sheet
Microsoft Cracker Sheet
Netflix Cracker Sheet
Apple Cracker Sheet
Meta Cracker Sheet
Uber Cracker Sheet
Goldman Sachs Cracker Sheet
Tesla Cracker Sheet
Hulu Cracker Sheet
Oracle Cracker Sheet
Twitter Cracker Sheet
Stripe Cracker Sheet
Lyft Cracker Sheet
Bloomberg Cracker Sheet
Cisco Cracker Sheet
Events
CFA Placement Ambassador
Login
/
Register
Login to superio
Email
Password
Keep me signed in
Forgotten password?
Don't you have an account?
Register
Reset Password
Please Enter Username or Email
Back To Login
Create a free superio account
Candidate
Employer
Email
*
Password
*
Confirm Password
*
Gender
Both
Female
Male
You accept our
Terms and Conditions and Privacy Policy
Email
*
Password
*
Confirm Password
*
You accept our
Terms and Conditions and Privacy Policy
Already have an account?
Login
Job Post
AlgoMaster Sheet
Home
AlgoMaster Sheet
ALGORITHMS
(Click on the question
to open)
ARTICLE
VIDEO
STL
STL Introduction
First Unique Character In A String
Kth Largest Element
One Integer
Maximum Score From Removing Stones
Find K Closest Elements
Distinct Candies
Bulls And Cows
Smallest Range Covering Elements From K Lists
HASHING
Hashing Introduction
Two Sum III - Data Structure Design
Find Subsequence of Length K With the Largest Sum
Find Longest Awesome Substring
Avoid Flood in The City
Count Good Meals
Ugly Number II
Word Ladder II
Word Break II
Jump Game IV
LFU Cache
BIT MANIPULATION
All about Bit Manipulation
Power Of Two
Power Of Four
Decode XORed Array
Count Bits
Sort Integers By The Number Of 1 Bits
Longest Consecutive Run Of 1s in Binary
Hamming Distance
Unique Number II
Unique Number III
Find Subsets
Maximum Score Words Formed By Letters
Triples with Bitwise AND Equal To Zero
Bitwise AND of Numbers Range
Total Hamming Distance
Travelling Salesman Problem
Decode XORed Permutation
Find the Shortest Superstring
LARGE NUMBERS
Big Integers Introduction
Big Addition
Big Multiplication
Big Factorials
Big Integer Challenge - Julka
RECURRENCE
Analysis of Algorithms (Solving Recurrences)
Matrix Exponentiation Introduction
Pow(x, n) - Binary Exponentiation
Maximize Number of Nice Divisors - Modular Binary Exponentiation
Open The Lock
Fibonacci Number - Fast Matrix Multiplication
Strange Function
N-th Tribonacci Number
PIGEONHOLE
Pigeonhole Principle Introduction
Maximum Gap
DIVSUB
Array With Elements Not Equal to Average of Neighbors
The Gray-Similar Code
HOLI - Holiday Accommodation
Subarray Sums Divisible by K
PROBABILITY
Probability Theory Introduction
Linearity Of Expectation
Expected Throws - One Head
Expected Throws - Two Consecutive Heads
Expected Throws - N Consecutive Heads
Bernoulli's Trial
Coupon Collector
Bob and Pallindromes
Second Player
INCLUSION-EXCLUSION
Inclusion-Exclusion Principle
Count Number of Divisors till N
Divisibility Rule
PRIME NUMBERS
Prime Sieve
Prime Queries
Prime Factorisation - O(N)
Prime Factorisation - O(√N)
Prime Factorisation - O(LogN)
Count Primes
Prime Arrangements - Segmented Sieve
Alice and Candies
Prime Sum
Closest Divisors
EUCLIDEAN
Greatest Common Divisor
Extended Euclidean Algorithm (Base + Extended)
Modular Multiplicative Inverse
Linear Diophantine Equation
Co-prime divisor of a Number
Nastya Studies Informatics
Row GCD
NUMBER THEORY
Modular Arithmetic
Fermat's Theorem
Count (N!) % P -------> (N factorial Modulo P)
Count (nCr) % P -------> (r Combinations of n Modulo P)
Check If Array Is Good
Remainder's Game
COMBINATORICS
Combinatorics Basics
Binomial Coefficients
Selection of Personnel
The World is a Theatre
Permutations & Combinations Formulas
Birthday Paradox
Catalan Numbers
The Skyline Problem
Count the Arrays
Beautiful Numbers
RECURSION
Basics Of Recursion
Check if Array is Sorted
Ways to Tile a Floor
Count Strings
Friend's Pairing Problem
BACKTRACKING
Find Subsets
Letter Combinations of a Phone Number
Permutations using Backtracking
Print Combinations Of Balanced Paranthesis
N-Queens
Target Sum
Sudoku Solver
Palindrome Partitioning
Check if Number is a Sum of Powers of Three
BINARY SEARCH
Lower Bound & Upper Bound using Binary Search
Place K elements such that Minimum distance is maximized
Game of Greed
Valid Perfect Square
Koko Eating Bananas
Reorder Data in Log Files
Closest Room
Noor and his Pond
BINARY SEARCH
Merge Sort
Quick Sort
Quick Select
Global and Local Inversions
Sam Height
Reverse Pairs
Ternary Search
GREEDY ALGORITHM
Greedy Algorithms Basic
Bulbs
Minimum Number of Taps to Open to Water a Garden
Make It Equal
Too Many Segments
Segment Intersections
MEET IN THE MIDDLE
Meet in the Middle basics
Subsums
Range Queries Intro
SEGMENT TREE
Segment Trees Intro & Implementation
Range XOR Queries
Range Minimum Queries
Xenia and Bit Operations
Petya and Array
Array Stabilization
LAZY PROPAGATION
Lazy Propagation in Segment Tree
Flipping Coins
XOR on Segment
FENWICK TREE
Fenwick Tree Intro
Inversion Count using Fenwick Tree
Range Update Queries
Count of Smaller Numbers After Self
Range Set Query
Longest Increasing Subsequence using Fenwick Tree
SQRT DECOMPOSITION
Square Root Decomposition Introduction
Range Minimum Query using Square Root Decomposition
DQUERY SPOJ using MO's Algorithm
Sorting Queries using MO's Algorithm
Little Elephant and Array
Powerful Array
GAME THEORY
Combinatorial Games Introduction
Take Away Games
Game of Nim
Divisor Game
Sprague-Grundy
Lucky Number Game
Maximum Number of Coins
GAME OF NIM
Game of Bullets
Nim Game II
Stair Game
GRAPH THEORY
Graphs Introduction
Breadth-First Search
Depth-First Search
Astronaut Pairs
Reconstruct Itinerary
Shortest path faster algorithm
Board Game
Message Route
Word Ladder
Valid BFS?
TREE
Tree Introduction
DFS on Trees
Subtree of another Tree
Cut 'em all!
DFS Trees and Backedges
Lowest Common Ancestor Introduction
LCA using Binary Lifting
LCA of a Binary Tree Problem
Distance Queries
Path XOR
Maximum Path
ADVANCED GRAPHS
Topological Sort
Restricted Permutation
Game Routes
Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree
Minimum Number of Days to Disconnect Island
Condensed Component Graph
Maximum Number of Non-Overlapping Substrings - Kosaraju
Connecting Cities with Minimum Cost
GCD on Directed Graph
DISJOINT SET UNION
DSU Introduction
Union-Find
Number of Operations to Make Network Connected
Union By Rank & Path Compression
Make Palindrome
Sum of Maximum Weights
GCD Sort of an Array
Special Paths
SPANNING TREE
Prim's Algorithm
Kruskal's Algorithm
Minimum Spanning Tree Cost
Union-Find
Make It Connected
Build Roads
Ring Minimum Spanning Tree
SHORTEST PATH
Dijkstra's Algorithm
Network Delay Time
Bellman Ford Algorithm
Floyd Warshall Agorithm
Cheapest Flights Within K Stops
Travel by Car
Break Up
DYNAMIC PROGRAMMING
Dynamic Programming Introduction
N-K Ladders
Minimum Jumps
Longest Increasing Subsequence
Maximum Height by Stacking Cuboids
Perfect Squares
Maximum Product Subarray
Find Two Non-overlapping Sub-arrays Each With Target Sum
Path with Maximum Gold
Best Time to Buy and Sell Stock
Boredom
Sleeping Schedule
Palindrome Partitioning
Count All Possible Routes
Modulo Sum
Cherry Pickup
Barcode
Maximum Number of Events That Can Be Attended
Number of Ways to Wear Different Hats to Each Other
Minimum XOR Sum of Two Arrays
Numbers With Repeated Digits
Classy Numbers
Tree with Maximum Cost
Minimum Cost to Reach Destination in Time
Maximum White Subtree
Frog I
Frog II
Maximum Vacation Days
Knapsack 1
Knapsack 2
Target Sum
Longest Common Subsequence
Longest Path
Grid I
Grid II
Coins
Sushi
Stones
Deque
Candies
Slimes
Matching
Independent Set
Flowers
Walk
Digit Sum
Permutation
PATTERN MATCHING
Naive Method for Pattern Matching
Trie Introduction
Pattern Matching using Trie
Word Search
String Hashing - Polynomial Hash Function
Rolling Hash Rabin Karp Algorithm
Longest Common Subpath
Find and Replace Pattern
GEOMETRY
Orientation of 3 ordered points
Graham's Scan Algorithm
Polygons
INTERACTIVE PROBLEMS
Guess the Number
Lost Numbers
XOR Guessing
RANDOMIZATION
Set of Randomized Algorithms
Policy-Based Data Structures
Policy-Based Data Structures Introduction
Inversion Count using Policy-Based Data Structures