Algorithm

Catalog

Data Structure and Exercises

Introduction To Algorithms(4 ed)

LeetCode

• Array
  704, Binary Search35, Search Insert Position34, Find First and Last Position of Element in Sorted Array69, Sqrt(x)367, Valid Perfect Square27, Remove Element26, Remove Duplicates from Sorted Array283, Move Zeroes844, Backspace String Compare977, Squares of a Sorted Array209, Minimum Size Subarray Sum904, Fruit Into Baskets76, Minimum Window Substring54, Spiral Matrix59, Spiral Matrix II
• LinkedList
  203, Remove Linked List Elements707, Design Linked List206, Reverse Linked List24, Swap Nodes in Pairs19, Remove Nth Node From End of List160, Intersection of Two Linked Lists141, Linked List Cycle142, Linked List Cycle II
• HashTable
  242, Valid Anagram383, Ransom Note49, Group Anagrams438, Find All Anagrams in a String349, Intersection of Two Arrays350, Intersection of Two Arrays II202, Happy Number1, Two Sum15, Three Sum16, Three Sum Closest18, Four Sum454, Four Sum II
• String
  344, Reverse String541, Reverse String IIKamaCoder-54, Replace Numbers151, Reverse words in a StringKamaCoder-55, Right-Rotated String28, Find the Index of the First Occurrence in a String459, Repeated Substring Pattern
• Two Pointers
• Stack/Queue
  232, Implement Queue using Stacks225, Implement Stack using Queues20, Valid Parentheses1047, Remove All Adjacent Duplicates In String150, Evaluate Reverse Polish Notation239, Sliding Window Maximum347, Top K Frequent Elements
• Binary Tree
  144, Binary Tree Pre-order Traversal94, Binary Tree In-order Traversal145, Binary Tree Post-order Traversal102, Binary Tree Level Order Traversal107, Binary Tree Level Order Traversal II199, Binary Tree Right Side View637, Average of Levels in Binary Tree429, N-ary Tree Level Order Traversal515, Find Largest Value in Each Tree Row116, Populating Next Right Pointers in Each Node117, Populating Next Right Pointers in Each Node II101, Symmetric Tree104, Maximum Depth of Binary Tree111, Minimum Depth of Binary Tree222, Count Complete Tree Nodes110, Balanced Binary Tree257, Binary Tree Paths404, Sum of Left Leaves513, Find Bottom Left Tree Value112, Path Sum113, Path Sum II226, Invert Binary Tree105, Construct Binary Tree from Pre-order and In-order Traversal106, Construct Binary Tree from Post-order and In-order Traversal654, Maximum Binary Tree617, Merge Two Binary Trees700, Search in a Binary Search Tree98, Validate Binary Search Tree530, Minimum Absolute Difference in BST501, Find Mode in Binary Search Tree538, Convert BST to Greater Tree236, Lowest Common Ancestor of a Binary Tree235, Lowest Common Ancestor of a Binary Search Tree701, Insert into a Binary Search Tree450, Delete Node in a BST669, Trim a Binary Search Tree108, Convert Sorted Array to Binary Search Tree109, Convert Sorted List to Binary Search Tree100, Same Tree572, Subtree of Another Tree559, Maximum Depth of N-ary Tree
• Backtracking
  77, Combinations17, Letter Combinations of a Phone Number39, Combination Sum40, Combination Sum II216, Combination Sum III131, Palindrome Partitioning93, Restore IP Addresses78, Subsets90, Subsets II46, Permutations47, Permutations II51, N-Queens52, N-Queens II36, Valid Sudoku37, Sudoku Solver491, Non-decreasing Subsequences332, Reconstruct Itinerary
• Greedy
  455, Assign Cookies1005, Maximize Sum Of Array After K Negations860, Lemonade Change376, Wiggle Subsequence738, Monotone Increasing Digits122, Best Time to Buy and Sell Stock II714, Best Time to Buy and Sell Stock with Transaction Fee135, Candy406, Queue Reconstruction by Height55, Jump Game45, Jump Game II452, Minimum Number of Arrows to Burst Balloons435, Non-overlapping Intervals763, Partition Labels56, Merge Intervals53, Maximum Subarray134, Gas Station968, Binary Tree Cameras
• Dynamic Programming
  509, Fibonacci Number70, Climbing Stairs1137, N-th Tribonacci Number746, Min Cost Climbing Stairs740, Delete and Earn198, House Robber343, Integer Break62, Unique Paths
• Monotonic Stack
• Graph
• Other