Skip to content
Interviews
Min Cost Connect Points
Initializing search
samitmohan/interviews
Interviews
samitmohan/interviews
index.md
Neetcode 150
Neetcode 150
Advanced Graphs
Advanced Graphs
Find Cheapest Price
Find Itinerary
Min Cost Connect Points
Network Delay Time
Swim Water
Arrays & Hashing
Arrays & Hashing
Contains Duplicate
Encode And Decode Strings
Group Anagrams
Longest Consecutive Sequence
Product Of Array Except Self
Top K Frequent Elements
Two Sum
Valid Anagram
Valid Sudoku
Backtracking
Backtracking
Combination Sum
Combination Sum2
Letter Combinations
Nqueens
Partition
Permutation
Subsets
Subsets With Dup
Word Search
Binary Search
Binary Search
Find Median Sorted Arrays
Find Min
Kvs
Min Eating Speed
Search
Searchin Rotated Arr
Search Matrix
Bit Manipulation
Bit Manipulation
Count Bits
Get Sum
Hamming Weight
Missing Number
Reverse
Reverse Bits
Single Number
Dp
Dp
Can Parition
Climb Stairs
Coin Change
Coin Change Ii
Count Substrings
Edit Distance
Is Interleave
Is Match
Lcs
Length Of Lis
Longest Increasing Path
Longest Palindrome
Max Coins
Max Product
Max Profit
Min Cost Climbing Stairs
Num Decodings
Num Distinct
Num Tillings
Rob
Rob2
Target Sum
Unique Paths
Word Break
Graphs
Graphs
Clone Graph
Course Schedule
Course Schedule2
Max Area
Num Islands
Oranges Rotting
Pacificflow
Race Car
Redundant Connection
Surrounded Regions
Word Ladder
Greedy
Greedy
Can Jump
Check Valid String
Gas Station
Is Nstraight Hand
Jump
Max Sub Array
Merge Triplets
Partition Labels
Heap
Heap
Design Twitter
Find Kth Largest
Find Median
K Closest
Kth Largest
Last Stone Weight
Least Interval
Task Schedular
Intervals
Intervals
Insert
Merge Intervals
Min Interval
Non Overlapping Intervals
Linked List
Linked List
Add Two Numbers
Copy Random List
Find Duplicate
Has Cycle
Lrucache
Merge Ksorted Lists
Merge Two Lists
Remove Nthfrom End
Reorder List
Reverse Kgroup
Reverse Ll
Math
Math
Detect Squares
Is Happy
Multiply Strings
My Pow
Plus One
Rotate
Set Zeroes
Spiral Order
Xor
Sliding Window
Sliding Window
Buyandsellstock
Character Replacement
Length Of Longest Substring
Max Sliding Window
Min Window
Permutation In String
Stack
Stack
Car Fleet
Dailytemperature
Eval Rpn
Generate Parenthesis
Is Valid
Largest Rectangle
Min Stack
Trees
Trees
Build Tree
Diameter Of Binary Tree
Good Nodes
Invert Tree
Is Balanced
Is Same Tree
Is Sub Tree
Is Valid Bst
Kth Smallest
Lca
Lca Bst
Lca Deepest Leaves
Level Order
Max Depth
Max Path Sum
Right Side View
Serialize
Tries
Tries
Add Word
Trie
Word Search Ii
Two Pointers
Two Pointers
3Sum
Container With Most Water
Trapping Rain Water
Two Sum Ii Input Array Is Sorted
Valid Palindrome
Practice Problems
Practice Problems
Array
Array
3Sumclosest
Addto Array Form
Burstballoon
Can Complete Circuit
Candy
Check Arithmetic Subarrays
Count Fixed Bounds
Count Hidden Sequence
Count Interesting Subarrays
Count Odds
Count Subarray Score
Find Unsorted Subarray
Kids With Candies
Max Candies
Maximumicecreambars
Maximum Value
Max Satisfaction
Min Dominoes Rotation
Min Sum
Open Lock
Partition Array
Rabbit Forest
Rearrange Arr
Remove Element
Subarrays Div By K
Subarray Sum
Suggested Products
Sum Range
Dp
Dp
Bitmasking
Get Words In Longest Subsequence
Hats To Person
Knapsack
Palindrome Partition
Design Dsa
Design Dsa
Design Browser History
Design Hash Map
Design Hash Set
My Circular Queue
Randomized Set
Seat Reservation
Graphs
Graphs
Can Finish
Keysandrooms
Minimumfuelcost
Min Score
Min Time To Reach
Possible Bipartition
Shortest Bridge
Greedy
Greedy
Get Longest Subsequence
Max Removal
Hashing
Hashing
Distinct Names
Happy Numbers
Longest Palindrome
Minimum Rounds
Sinlge Non Duplicate
Topk
Heaps
Heaps
Ipo
Linked List
Linked List
Cycle Ii
Get Random
Middleof List
Odd Even List
Swapnodes
Math
Math
Check Prime
Count Good Numbers
Estimate Pi
Even Digits
Fast Expo
Find Even Numbers
Forloop
Gcd Of Strings
Max Points
Maxrotate Function
Minimum Average Difference
Min Max Difference
Triangle Type
Queues
Queues
Queue Using Stack
Recursion
Recursion
Build Array
Combinationsum Iii
Count All Good Integers
Punishment Number
Sudoku Solver
Searching & Sorting
Searching & Sorting
Angry Birds
Answer Queries
Count Fairpairs
Find All Duplicates
Find Disappeared Numbers
Find Error Nums
Find Peak Element
First Missing Positive
Max Worker Task
Ship With Days
Sliding
Sliding
Contains Nearby Duplicate
Count Complete Subarrays
Count Distinct Elem
Count Good Subarray
Count Subarrays Least K
Dnasequence
Find Anagrams
Find Substring
Min Flips
Min Size Subarray
Min Subarray Len
Stack
Stack
Asteroid Collision
Baseball
Freq Stack
Implementqueueswith Stacks
Next Greater Element
Remove Kdigits
Simplify Path
Stack Using Queues
Stock Span
Validate Stack Sequences
String
String
Answer String
Bullsandcows
Countand Say
Detect Capital
Largest Number
Length After Transformations
Min Deletion Size
Push Dominoes
Robot String
Roman To Int
Str Str
Word Pattern
Trees
Trees
Del Nodes
Find Duplicate Subtree
Invert Tree
Is Complete Tree
Level Order
Longest Zig Zag
Max Depth
Merge Trees
Min Diff In Bst
Range Sum Bst
Range Sum Seg Tree
Sorted Arrayto Bst
Sorted List To Bst
Sum Numbers
Symmetric Tree
Zigzag Order
Union Find
Union Find
Smallest Equivalent String
DSA Implementations
DSA Implementations
Algorithms
Algorithms
Boyer Moore
Dijkstra
Floyd Warshall
Kadane
Kmp
Kruskal
Prefix Sum
Prims
Slidingwindow
Slow Fast
Two Pointer
Union Find
Graph
Graph
Bfs
Dfs
Graph Implementation
Hash Tables
Hash Tables
Chaining
Hashing Internals
Linear Probing
Heap
Heap
Max Heap
Min Heap
Linked List
Linked List
Circular Ll
Doubly Ll
Single Ll
Searching Sorting
Searching Sorting
Binary Search
Cyclic Sort
Heap Sort
Insertion Sort
Linear Search
Mergesort
Quick Sort
Radix Sort
Selection Sort
Topological Sort
Stack Queue
Stack Queue
Circular Queue
Deque
Priority Queue
Queue
Queue With Stacks
Stack
Travelling Salesman
Travelling Salesman
Shortest Path Length
Tsp
Tsp Benchmark
Tree
Tree
Avl Tree
Binary Tree
Bst
Find Mode
Iterative Inorder
Iterative Postorder
Iterative Preorder
Max Path Sum
Segment Tree
Trie
Trie
Trie Implementation
Striver Sheet
Striver Sheet
Arrays
Arrays
Buy Sell1
Kadane Algo
Next Permutation
Pascal Triangle
Set Matrix Zero
Sort Array
Dp
Dp
Min Path Sum
Graph
Graph
Floodfill
Ll
Ll
Delete Node
Rotate Right
String
String
Repeated String Match
Trees
Trees
Build Tree
Width Of Bt
Company Questions
Company Questions
Epi Fi Prep
Epi Fi Prep
Atm Queue
Best Sum Down The Path
Capacity Ship
Check Equivalent Strings
Clone Graph
Complete Tree Nodes
Distance K
Height
Is Valid
Kth Smallest
Max Pathsum
Max Product Subarray
Max Subarray
Max Taxi Earnings
Merge Intervals
Min Knight Moves
Min Taps
Palindromic Strings
Range Sum Bst
Reconstruct Itinerary
Record
Russian Doll
Serialise Tree
Top K
Top K Chatty
Data Insights Prep
Data Insights Prep
Bs
Burst Balloons
Flood Fill
Itinery Graph
Match
New Match
Num Of Events I
Num Of Events Ii
Optimised Water
Python
Python
Misc
Misc
Function Overloading
Pretty Recursion
Oops
Oops
Abstraction
Basics
Encapsulation
Factory Pattern
Inheritance
Notification System
Polymorphism
Python Tricks
Python Tricks
Blog
Operating Systems
Operating Systems
Prerequisite
Prerequisite
B
Bankers
Dp
Exec
Fcfs
Forkbasics
Pc
Peterson Soln
Reader Writer
Semaphore
Sjfs
Threading
Design Patterns
Design Patterns
Singleton
Time Complexity
Time Complexity
Complexity
Min Cost Connect Points
¶
Back to top