Learn Code
Hello Interview · 121 topics
👋 Introduction 1
Introduction
📖 Two Pointers 8
Overview Container With Most Water Two Sum (Sorted Array) 3-Sum Triangle Numbers Move Zeroes Sort Colors Trapping Rain Water
📖 Sliding Window 7
Overview Maximum Sum of Subarrays of Size K Max Points You Can Obtain From Cards Max Sum of Distinct Subarrays Length k Overview (Fixed Window) Longest Substring Without Repeating Characters Longest Repeating Character Replacement
📖 Intervals 6
Overview Can Attend Meetings Insert Interval Non-Overlapping Intervals Merge Intervals Employee Free Time
📖 Stack 7
Overview Valid Parentheses Decode String Longest Valid Parentheses Overview (Monotonic Stack) Daily Temperatures Largest Rectangle in Histogram
📖 Linked List 6
Overview Linked List Cycle Palindrome Linked List Remove Nth Node From End of List Reorder List Swap Nodes in Pairs
📖 Binary Search 6
Overview Apple Harvest (Koko Eating Bananas) Search in Rotated Sorted Array Split Array Largest Sum Kth Smallest Element in a Sorted Matrix Minimum Shipping Capacity
📖 Heap 6
Overview Kth Largest Element in an Array K Closest Points to Origin Find K Closest Elements Merge K Sorted Lists Median from Data Stream
📖 Depth-First Search 20
Introduction Fundamentals Return Values Maximum Depth of Binary Tree Path Sum Passing Values Down and Helper Functions Validate Binary Search Tree Calculate Tilt Diameter of a Binary Tree Path Sum II Longest Univalue Path Graphs Overview Adjacency List Copy Graph Graph Valid Tree Matrices Flood Fill Number of Islands Surrounded Regions Pacific Atlantic Water Flow
📖 Breadth-First Search 11
Introduction Overview Level Order Sum Rightmost Node Zigzag Level Order Maximum Width of Binary Tree Graphs Overview Minimum Knight Moves Rotting Oranges 01-Matrix Bus Routes
📖 Backtracking 8
Overview Word Search Solution Space Trees Subsets Generate Parentheses Combination Sum Palindrome Partitioning N-Queens
📖 Graphs 8
Overview Course Schedule Course Schedule II Shortest Path Algorithms Network Delay Time Cheapest Flights Within K Stops Path With Minimum Effort Find City with Fewest Reachable
📖 Dynamic Programming 12
Fundamentals Solving a Question with Dynamic Programming Counting Bits Decode Ways Unique Paths Maximal Square Longest Increasing Subsequence Word Break Maximum Profit in Job Scheduling Paint House Paint House II Minimum Window Subsequence
📖 Greedy Algorithms 6
Overview Best Time to Buy and Sell Stock Gas Station Jump Game Jump Game II Partition Labels
📖 Trie 3
Overview Implement Trie Methods Prefix Matching
📖 Prefix Sum 3
Overview Count Vowels in Substrings Subarray Sum Equals K
📖 Matrices 3
Spiral Matrix Rotate Image Set Matrix Zeroes