0% completed
All LessonsFree Lessons (186)
Getting Started
Course OverviewWho Should Take This Course
Two Pointers
Introduction to Two PointersValid PalindromeSolution: Valid Palindrome3SumSolution: 3SumRemove Nth Node from End of ListSolution: Remove Nth Node from End of ListSort ColorsSolution: Sort ColorsReverse Words in a StringSolution: Reverse Words in a StringValid Word AbbreviationSolution: Valid Word AbbreviationStrobogrammatic NumberSolution: Strobogrammatic NumberMinimum Number of Moves to Make PalindromeSolution: Minimum Number of Moves to Make PalindromeNext Palindrome Using Same DigitsSolution: Next Palindrome Using Same DigitsLowest Common Ancestor of a Binary Tree IIISolution: Lowest Common Ancestor of a Binary Tree IIICount Pairs Whose Sum is Less than TargetSolution: Count Pairs Whose Sum is Less than TargetCount Subarrays With Fixed BoundsSolution: Count Subarrays With Fixed BoundsValid Palindrome II
Mock interview
Two Pointers
Fast and Slow Pointers
Introduction to Fast and Slow PointersHappy NumberSolution: Happy NumberLinked List CycleSolution: Linked List CycleMiddle of the Linked ListSolution: Middle of the Linked ListCircular Array LoopSolution: Circular Array LoopFind the Duplicate NumberSolution: Find the Duplicate NumberPalindrome Linked ListSolution: Palindrome Linked ListMaximum Twin Sum of a Linked ListSolution: Maximum Twin Sum of a Linked ListSplit a Circular Linked ListSolution: Split a Circular Linked ListLinked List Cycle IIISolution: Linked List Cycle IIILinked List Cycle IVSolution: Linked List Cycle IV
Mock interview
Fast and Slow Pointers
Sliding Window
Introduction to Sliding WindowRepeated DNA SequencesSolution: Repeated DNA SequencesSliding Window MaximumSolution: Sliding Window MaximumMinimum Window SubsequenceSolution: Minimum Window SubsequenceLongest Repeating Character ReplacementSolution: Longest Repeating Character ReplacementMinimum Window SubstringSolution: Minimum Window SubstringLongest Substring without Repeating CharactersSolution: Longest Substring without Repeating CharactersMinimum Size Subarray SumSolution: Minimum Size Subarray SumMaximum Average Subarray ISolution: Maximum Average Subarray IDiet Plan PerformanceSolution: Diet Plan PerformanceFruit Into BasketsSolution: Fruit Into BasketsContains Duplicate IISolution: Contains Duplicate IIFrequency of the Most Frequent ElementSolution: Frequency of the Most Frequent ElementSubarrays with K Different IntegersSolution: Subarrays with K Different IntegersCount Subarrays With Score Less Than KSolution: Count Subarrays With Score Less Than K
Mock interview
Sliding Window
Merge Intervals
Introduction to Merge IntervalsMerge IntervalsSolution: Merge IntervalsInsert IntervalSolution: Insert IntervalInterval List IntersectionsSolution: Interval List IntersectionsEmployee Free TimeSolution: Employee Free TimeCount Days Without MeetingsSolution: Count Days Without MeetingsRemove Covered IntervalsSolution: Remove Covered IntervalsMeeting Rooms II
In-Place Manipulation of a Linked List
Introduction to In-Place Manipulation of a Linked ListReverse Linked ListSolution: Reverse Linked ListReverse Nodes in k-GroupSolution: Reverse Nodes in k-GroupReverse Linked List IISolution: Reverse Linked List IIReorder ListSolution: Reorder ListSwapping Nodes in a Linked ListSolution: Swapping Nodes in a Linked ListReverse Nodes in Even Length GroupsSolution: Reverse Nodes in Even Length GroupsRemove Duplicates from Sorted ListSolution: Remove Duplicates from Sorted ListRemove Linked List ElementsSolution: Remove Linked List ElementsSplit Linked List in PartsSolution: Split Linked List in PartsDelete N Nodes After M Nodes of a Linked ListSolution: Delete N Nodes After M Nodes of a Linked ListInsert into a Sorted Circular Linked ListSolution: Insert into a Sorted Circular Linked ListSwap Nodes in Pairs
Heaps
Introduction to HeapsIPOSolution: IPOFind Median from Data StreamSolution: Find Median from Data StreamSliding Window MedianSolution: Sliding Window MedianSchedule Tasks on Minimum MachinesSolution: Schedule Tasks on Minimum MachinesMeeting Rooms IIISolution: Meeting Rooms IIILargest Number After Digit Swaps by ParitySolution: Largest Number After Digit Swaps by ParityFind Right IntervalSolution: Find Right IntervalMinimum Cost to Connect SticksSolution: Minimum Cost to Connect SticksLongest Happy StringSolution: Longest Happy StringMaximum Average Pass RatioSolution: Maximum Average Pass RatioThe Number of the Smallest Unoccupied ChairSolution: The Number of the Smallest Unoccupied Chair
Mock interview
Heaps
K-way merge
Introduction to K-way MergeMerge Sorted ArraySolution: Merge Sorted ArrayKth Smallest Number in M Sorted ListsSolution: Kth Smallest Number in M Sorted ListsFind K Pairs with Smallest SumsSolution: Find K Pairs with Smallest SumsMerge K Sorted ListsSolution: Merge K Sorted ListsKth Smallest Element in a Sorted MatrixSolution: Kth Smallest Element in a Sorted MatrixKth Smallest Prime FractionSolution: Kth Smallest Prime FractionSuper Ugly NumberSolution: Super Ugly Number
Top K Elements
Introduction to Top K ElementsKth Largest Element in a StreamSolution: Kth Largest Element in a StreamReorganize StringSolution: Reorganize StringK Closest Points to OriginSolution: K Closest Points to OriginTop K Frequent ElementsSolution: Top K Frequent ElementsKth Largest Element in an ArraySolution: Kth Largest Element in an ArrayThird Maximum NumberSolution: Third Maximum NumberFind Subsequence of Length K with the Largest SumSolution: Find Subsequence of Length K with the Largest SumMinimum Cost to Hire K WorkersSolution: Minimum Cost to Hire K WorkersMaximal Score After Applying K OperationsSolution: Maximal Score After Applying K OperationsFind the Kth Largest Integer in the ArraySolution: Find the Kth Largest Integer in the ArrayMaximum Performance of a TeamSolution: Maximum Performance of a TeamSmallest Range Covering Elements from K ListsSolution: Smallest Range Covering Elements from K ListsK Maximum Sum Combinations From Two ArraysSolution: K Maximum Sum Combinations From Two ArraysK Empty SlotsSolution: K Empty SlotsMaximum Product After K IncrementsSolution: Maximum Product After K IncrementsFind the K-Sum of an ArraySolution: Find the K-Sum of an Array
Modified Binary Search
Introduction to Modified Binary SearchBinary SearchSolution: Binary SearchSearch in Rotated Sorted ArraySolution: Search in Rotated Sorted ArrayFirst Bad VersionSolution: First Bad VersionRandom Pick with WeightSolution: Random Pick with WeightFind K Closest ElementsSolution: Find K Closest ElementsSingle Element in a Sorted ArraySolution: Single Element in a Sorted ArrayMaximum Value at a Given Index in a Bounded ArraySolution: Maximum Value at a Given Index in a Bounded ArrayThe K Weakest Rows in a MatrixSolution: The K Weakest Rows in a MatrixSplit Array Largest SumSolution: Split Array Largest SumFind Minimum in Rotated Sorted Array IISolution: Find Minimum in Rotated Sorted Array IIMaximum Running Time of N ComputersSolution: Maximum Running Time of N ComputersMinimize Max Distance to Gas StationSolution: Minimize Max Distance to Gas StationDivide ChocolateSolution: Divide ChocolateSearch in Rotated Sorted Array II
Mock interview
Modified Binary Search
Subsets
Introduction to SubsetsSubsetsSolution: SubsetsPermutationsSolution: PermutationsLetter Combinations of a Phone NumberSolution: Letter Combinations of a Phone NumberGenerate ParenthesesSolution: Generate ParenthesesLetter Case PermutationSolution: Letter Case PermutationLetter Tile PossibilitiesSolution: Letter Tile PossibilitiesFind K-Sum Subsets
Greedy Techniques
Introduction to Greedy TechniquesJump GameSolution: Jump GameBoats to Save PeopleSolution: Boats to Save PeopleGas StationSolution: Gas StationTwo City SchedulingSolution: Two City SchedulingMinimum Number of Refueling StopsSolution: Minimum Number of Refueling StopsLargest Palindromic NumberSolution: Largest Palindromic NumberAssign CookiesSolution: Assign CookiesRearranging FruitsSolution: Rearranging FruitsNumber of Steps to Reduce a Binary Number to OneSolution: Number of Steps to Reduce a Binary Number to OneMaximum SwapSolution: Maximum SwapCan Place FlowersSolution: Can Place FlowersLargest Odd Number in StringSolution: Largest Odd Number in StringCandySolution: CandyMinimum Replacements to Sort the ArraySolution: Minimum Replacements to Sort the ArrayJump Game IIBest Time to Buy and Sell Stock
Backtracking
Introduction to BacktrackingN-Queens IISolution: N-Queens IIWord SearchSolution: Word SearchHouse Robber IIISolution: House Robber IIIRestore IP AddressesSolution: Restore IP AddressesFlood FillSolution: Flood FillMinimum Moves to Spread Stones Over GridSolution: Minimum Moves to Spread Stones Over GridBinary Tree PathsSolution: Binary Tree PathsBinary WatchSolution: Binary WatchOptimal Account BalancingSolution: Optimal Account BalancingSplit a String Into the Max Number of Unique SubstringsSolution: Split a String Into the Max Number of Unique SubstringsAll Paths From Source to TargetSolution: All Paths From Source to TargetRemove Invalid ParenthesesSolution: Remove Invalid ParenthesesSudoku SolverMatchsticks to Square
Dynamic Programming
Introduction to Dynamic Programming0/1 KnapsackSolution: 0/1 KnapsackCoin ChangeSolution: Coin ChangeN-th Tribonacci NumberSolution: N-th Tribonacci NumberPartition Equal Subset SumSolution: Partition Equal Subset SumCounting BitsSolution: Counting Bits01 MatrixSolution: 01 MatrixHouse Robber IISolution: House Robber IIMaximum Product SubarraySolution: Maximum Product SubarrayCombination SumSolution: Combination SumWord BreakSolution: Word BreakPalindromic SubstringsSolution: Palindromic SubstringsLongest Common SubsequenceSolution: Longest Common SubsequenceWord Break IISolution: Word Break IIDecode WaysSolution: Decode WaysCount the Number of Good SubsequencesSolution: Count the Number of Good SubsequencesBinary Tree CamerasSolution: Binary Tree CamerasNumber of Ways to Form Target String Given a DictionarySolution: Number of Ways to Form Target String Given a DictionaryClimbing Stairs
Mock interview
Dynamic Programming
Cyclic Sort
Introduction to Cyclic SortCyclic SortSolution: Cyclic SortMissing NumberSolution: Missing NumberFirst Missing PositiveSolution: First Missing PositiveFind the Corrupt PairSolution: Find the Corrupt PairSort Array By Parity IISolution: Sort Array By Parity IIFind the First K Missing Positive Numbers
Topological Sort
Introduction to Topological SortCompilation OrderSolution: Compilation OrderAlien DictionarySolution: Alien DictionaryVerifying an Alien DictionarySolution: Verifying an Alien DictionaryCourse Schedule IISolution: Course Schedule IICourse ScheduleSolution: Course ScheduleBuild a Matrix with ConditionsSolution: Build a Matrix with ConditionsLongest Path With Different Adjacent CharactersSolution: Longest Path With Different Adjacent CharactersFind All Possible Recipes from Given Supplies
Mock interview
Topological Sort
Sort and Search
Introduction to Sort and SearchFind the Distance Value Between Two ArraysSolution: Find the Distance Value Between Two ArraysLongest Subsequence With Limited SumSolution: Longest Subsequence With Limited SumFind Target Indices After Sorting ArraySolution: Find Target Indices After Sorting ArrayCount Pairs in Two ArraysSolution: Count Pairs in Two ArraysValid Triangle NumberSolution: Valid Triangle NumberMinimum Operations to Make All Array Elements EqualSolution: Minimum Operations to Make All Array Elements EqualSum of Mutated Array Closest to TargetSolution: Sum of Mutated Array Closest to TargetRange Sum of Sorted Subarray SumsSolution: Range Sum of Sorted Subarray SumsMagnetic Force Between Two BallsSolution: Magnetic Force Between Two BallsFind K-th Smallest Pair DistanceSolution: Find K-th Smallest Pair DistanceMinimum Space Wasted from PackagingSolution: Minimum Space Wasted from PackagingRussian Doll EnvelopesSolution: Russian Doll EnvelopesPut Marbles in BagsSolution: Put Marbles in BagsH-IndexSolution: H-IndexTwo Sum Less Than KMaximum Number of Integers to Choose from a Range I
Matrices
Introduction to MatricesSet Matrix ZeroesSolution: Set Matrix ZeroesRotate ImageSolution: Rotate ImageSpiral MatrixSolution: Spiral MatrixWhere Will the Ball FallSolution: Where Will the Ball FallTranspose MatrixSolution: Transpose MatrixCount Negative Numbers in a Sorted MatrixSolution: Count Negative Numbers in a Sorted MatrixMinimum Time Takes to Reach Destination Without DrowningSolution:Minimum Time Takes to Reach Destination Without DrowningSmallest Rectangle Enclosing Black PixelsSolution: Smallest Rectangle Enclosing Black PixelsIsland PerimeterSolution: Island PerimeterConvert 1D Array Into 2D ArraySolution: Convert 1D Array Into 2D ArraySpiral Matrix IISolution: Spiral Matrix IIFlip Columns For Maximum Number of Equal RowsSolution: Flip Columns For Maximum Number of Equal RowsNumber of Spaces Cleaning Robot CleanedSolution: Number of Spaces Cleaning Robot CleanedMinimize Maximum Value in a GridSolution: Minimize Maximum Value in a GridKth Smallest Number in Multiplication TableSolution: Kth Smallest Number in Multiplication Table
Stacks
Introduction to StacksBasic CalculatorSolution: Basic CalculatorRemove All Adjacent Duplicates In StringSolution: Remove All Adjacent Duplicates In StringMinimum Remove to Make Valid ParenthesesSolution: Minimum Remove to Make Valid ParenthesesExclusive Time of FunctionsSolution: Exclusive Time of FunctionsFlatten Nested List IteratorSolution: Flatten Nested List IteratorImplement Queue Using StacksSolution: Implement Queue Using StacksDaily TemperaturesSolution: Daily TemperaturesDecode StringSolution: Decode StringMinimum String Length After Removing SubstringsSolution: Minimum String Length After Removing SubstringsNumber of Valid SubarraysSolution: Number of Valid SubarraysNumber of Visible People in a QueueSolution: Number of Visible People in a QueueParsing a Boolean ExpressionSolution: Parsing a Boolean ExpressionValid Parentheses
Graphs
Introduction to GraphsNetwork Delay TimeSolution: Network Delay TimePaths in Maze That Lead to Same RoomSolution: Paths in Maze That Lead to Same RoomClone GraphSolution: Clone GraphGraph Valid TreeSolution: Graph Valid TreeBus RoutesSolution: Bus RoutesReconstruct ItinerarySolution: Reconstruct ItineraryFind the Town JudgeSolution: Find the Town JudgeFind Center of Star GraphSolution: Find Center of Star GraphLucky Numbers in a MatrixSolution: Lucky Numbers in a MatrixPath with Maximum ProbabilitySolution: Path with Maximum ProbabilityTree DiameterSolution: Tree DiameterReorder Routes to Make All Paths Lead to the City ZeroSolution: Reorder Routes to Make All Paths Lead to the City ZeroMinimum Cost to Make at Least One Valid Path in a GridSolution: Minimum Cost to Make at Least One Valid Path in a GridLongest Cycle in a GraphSolution: Longest Cycle in a GraphShortest Cycle in a GraphSolution: Shortest Cycle in a Graph
Mock interview
Graphs
Tree Depth-First Search
Introduction to Tree Depth-First SearchFlatten Binary Tree to Linked ListSolution: Flatten Binary Tree to Linked ListDiameter of Binary TreeSolution: Diameter of Binary TreeSerialize and Deserialize Binary TreeSolution: Serialize and Deserialize Binary TreeInvert Binary TreeSolution: Invert Binary TreeBinary Tree Maximum Path SumSolution: Binary Tree Maximum Path SumConvert Sorted Array to Binary Search TreeSolution: Convert Sorted Array to Binary Search TreeBuild Binary Tree from Preorder and Inorder TraversalSolution: Build Binary Tree from Preorder and Inorder TraversalBinary Tree Right Side ViewSolution: Binary Tree Right Side ViewLowest Common Ancestor of a Binary TreeSolution: Lowest Common Ancestor of a Binary TreeValidate Binary Search TreeSolution: Validate Binary Search TreeNested List Weight Sum IISolution: Nested List Weight Sum IIInorder Successor in BSTSolution: Inorder Successor in BSTHeight of Binary Tree After Subtree Removal QueriesSolution: Height of Binary Tree After Subtree Removal QueriesDelete Nodes And Return ForestSolution: Delete Nodes And Return ForestMaximum Depth of Binary TreeKth Smallest Element in a BST
Tree Breadth-First Search
Introduction to Tree Breadth-First SearchBinary Tree Level Order TraversalSolution: Binary Tree Level Order TraversalBinary Tree Zigzag Level Order TraversalSolution: Binary Tree Zigzag Level Order TraversalPopulating Next Right Pointers in Each NodeSolution: Populating Next Right Pointers in Each NodeVertical Order Traversal of a Binary TreeSolution: Vertical Order Traversal of a Binary TreeSymmetric TreeSolution: Symmetric TreeWord LadderSolution: Word LadderTwo Sum IV – Input Is a BSTSolution: Two Sum IV – Input Is a BSTFind Minimum Diameter After Merging Two TreesSolution: Find Minimum Diameter After Merging Two TreesClosest Node to Path in TreeSolution: Closest Node to Path in TreeConnect All Siblings of a Binary Tree
Mock interview
Tree Breadth First Search
Trie
Introduction to TrieImplement Trie (Prefix Tree)Solution: Implement Trie (Prefix Tree)Search Suggestions SystemSolution: Search Suggestions SystemReplace WordsSolution: Replace WordsDesign Add and Search Words Data StructureSolution: Design Add and Search Words Data StructureWord Search IISolution: Word Search IITop K Frequent WordsSolution: Top K Frequent WordsLongest Common PrefixSolution: Longest Common PrefixIndex Pairs of a StringSolution: Index Pairs of a StringK-th Smallest in Lexicographical OrderSolution: K-th Smallest in Lexicographical OrderPalindrome PairsSolution: Palindrome PairsLexicographical Numbers
Hash Maps
Introduction to Hash MapsDesign HashMapSolution: Design HashMapFraction to Recurring DecimalSolution: Fraction to Recurring DecimalLogger Rate LimiterSolution: Logger Rate LimiterNext Greater Element ISolution: Next Greater Element IIsomorphic StringsSolution: Isomorphic StringsFind Duplicate File in SystemSolution: Find Duplicate File in SystemDot Product of Two Sparse VectorsSolution: Dot Product of Two Sparse VectorsHigh FiveSolution: High FiveBulls and CowsSolution: Bulls and CowsCustom Sort StringSolution: Custom Sort StringNumber of Distinct IslandsSolution: Number of Distinct IslandsNumber of Wonderful SubstringsSolution: Number of Wonderful SubstringsTotal Appeal of a StringSolution: Total Appeal of a StringContinuous Subarray SumSolution: Continuous Subarray SumUnique Number of OccurrencesSolution: Unique Number of OccurrencesLongest Happy PrefixSolution: Longest Happy PrefixFind Longest Self-Contained SubstringSolution: Find Longest Self-Contained SubstringLongest Palindrome
Knowing What to Track
Introduction to Knowing What to TrackPalindrome PermutationSolution: Palindrome PermutationValid AnagramSolution: Valid AnagramDesign Tic-Tac-ToeSolution: Design Tic-Tac-ToeGroup AnagramsSolution: Group AnagramsMaximum Frequency StackSolution: Maximum Frequency StackFirst Unique Character in a StringSolution: First Unique Character in a StringFind All Anagrams in a StringSolution: Find All Anagrams in a StringLongest Palindrome by Concatenating Two-Letter WordsSolution: Longest Palindrome by Concatenating Two-Letter WordsRank Teams by VotesSolution: Rank Teams by VotesPairs of Songs With Total Durations Divisible by 60Solution: Pairs of Songs With Total Durations Divisible by 60Minimum Number of Pushes to Type Word IISolution: Minimum Number of Pushes to Type Word IITask SchedulerSolution: Task SchedulerCount AnagramsSolution: Count AnagramsDivide Array Into Increasing SequencesSolution: Divide Array Into Increasing SequencesRansom Note
Union Find
Introduction to Union FindRedundant ConnectionSolution: Redundant ConnectionNumber of IslandsSolution: Number of IslandsMost Stones Removed with Same Row or ColumnSolution: Most Stones Removed with Same Row or ColumnLongest Consecutive SequenceSolution: Longest Consecutive SequenceLast Day Where You Can Still CrossSolution: Last Day Where You Can Still CrossRegions Cut by SlashesSolution: Regions Cut by SlashesAccounts MergeSolution: Accounts MergeMinimize Malware SpreadSolution: Minimize Malware SpreadFind if Path Exists in GraphSolution: Find if Path Exists in GraphThe Skyline ProblemSolution: The Skyline ProblemEvaluate Division
Mock interview
Union Find
Custom Data Structures
Introduction to Custom Data StructuresSnapshot ArraySolution: Snapshot ArrayTime Based Key-Value StoreSolution: Time Based Key-Value StoreLRU CacheSolution: LRU CacheInsert Delete GetRandom O(1)Solution: Insert Delete GetRandom O(1)Min StackSolution: Min StackRange ModuleSolution: Range ModuleShortest Word Distance IISolution: Shortest Word Distance IIDesign HashSetSolution: Design HashSetMax StackSolution: Max StackMoving Average from Data StreamSolution: Moving Average from Data StreamTwo Sum III - Data structure designSolution: Two Sum III - Data structure designRange Sum Query - ImmutableSolution: Range Sum Query - ImmutableLFU Cache
Bitwise Manipulation
Introduction to Bitwise ManipulationFind the DifferenceSolution: Find the DifferenceComplement of Base 10 IntegerSolution: Complement of Base 10 IntegerFlipping an ImageSolution: Flipping an ImageSingle NumberSolution: Single NumberSingle Number IISolution: Single Number IIEncode and Decode StringsSolution: Encode and Decode StringsSum of All Subset XOR TotalsSolution: Sum of All Subset XOR TotalsFind The K-th Lucky NumberSolution: Find The K-th Lucky NumberMinimum Number of K Consecutive Bit FlipsSolution: Minimum Number of K Consecutive Bit FlipsFind the Longest Substring Having Vowels in Even CountsSolution: Find the Longest Substring Having Vowels in Even CountsCount Triplets That Can Form Two Arrays of Equal XORSolution: Count Triplets That Can Form Two Arrays of Equal XORLongest Subarray With Maximum Bitwise ANDSolution: Longest Subarray With Maximum Bitwise ANDMinimum One Bit Operations to Make Integers ZeroSolution: Minimum One Bit Operations to Make Integers ZeroTriples with Bitwise AND Equal To ZeroSolution: Triples with Bitwise AND Equal To ZeroReverse Bits
Math and Geometry
Introduction to Math and GeometryCheck If It Is a Straight LineSolution: Check If It Is a Straight LineMinimum Cuts to Divide a CircleSolution: Minimum Cuts to Divide a CircleRectangle OverlapSolution: Rectangle OverlapMinimum Time Visiting All PointsSolution: Minimum Time Visiting All PointsReverse IntegerSolution: Reverse IntegerValid SquareSolution: Valid SquareRectangle AreaSolution: Rectangle AreaMinimum Area RectangleSolution: Minimum Area RectangleMaximum Area Rectangle With Point Constraints ISolution: Maximum Area Rectangle With Point Constraints IConvex PolygonSolution: Convex PolygonQueries on Number of Points Inside a CircleSolution: Queries on Number of Points Inside a CircleMax Points on a LineSolution: Max Points on a LineMaximum Number of Visible PointsSolution: Maximum Number of Visible PointsMinimize Manhattan DistancesSolution: Minimize Manhattan DistancesSelf CrossingSolution: Self CrossingErect the FenceSolution: Erect the FenceMinimum Number of Lines to Cover PointsDetonate the Maximum Bombs
Challenge Yourself
Challenge Yourself: IntroductionShortest BridgeNumber of Connected Components in an Undirected GraphMedian of Two Sorted ArraysPacific Atlantic Water FlowContains DuplicateMaximum SubarrayTwo SumFind Minimum in Rotated Sorted ArrayNon-overlapping IntervalsMeeting RoomsLargest Rectangle in HistogramSubtree of Another TreeSort ListNumber of 1 BitsContainer with Most WaterEvaluate Reverse Polish Notation4SumLoud and RichProduct of Array Except SelfLongest Increasing SubsequenceSum of Two IntegersMajority ElementUnique PathsLongest Palindromic SubstringPermutations IINumber of ProvincesLinked List Cycle IIMinimum Flips to Make the Binary String AlternateLemonade ChangeHouse RobberFind All Numbers Disappeared in an ArrayFind All Duplicates in an ArraySame TreeDesign In-Memory File SystemDesign File SystemAsteroid CollisionRotting OrangesAdd BinaryMultiply Strings
Conclusion
Where to Go from Here?
Mock interview
Coding Patterns
Practice Mock Interview