DSA Sheets

Two Pointer
Two Pointer
Fast Slow
Tree
Tree
LeetCode 98 | Validate Binary Search Tree LeetCode 100 | Same Tree LeetCode 104 | Maximum Depth of Binary Tree LeetCode 105 | Construct Binary Tree from Preorder and Inorder Traversal LeetCode 110 | Balanced Binary Tree LeetCode 111 | Minimum Depth of Binary Tree LeetCode 113 | Path Sum II LeetCode 114 | Flatten Binary Tree to Linked List LeetCode 199 | Binary Tree Right Side View LeetCode 226 | Invert Binary Tree LeetCode 230 | Kth Smallest Element in a BST LeetCode 235 | Lowest Common Ancestor of a Binary Search Tree LeetCode 236 | Lowest Common Ancestor of a Binary Tree LeetCode 437 | Path Sum III LeetCode 530 | Minimum Absolute Difference in BST LeetCode 543 | Diameter of Binary Tree LeetCode 617 | Merge Two Binary Trees LeetCode 662 | Maximum Width of Binary Tree LeetCode 669 | Trim a Binary Search Tree LeetCode 863 | All Nodes Distance K in Binary Tree LeetCode 865 | Smallest Subtree with all the Deepest Nodes LeetCode 889 | Construct Binary Tree from Preorder and Postorder Traversal LeetCode 938 | Range Sum of BST LeetCode 958 | Check Completeness of a Binary Tree LeetCode 1008 | Construct Binary Search Tree from Preorder Traversal LeetCode 1123 | Lowest Common Ancestor of Deepest Leaves LeetCode 1305 | All Elements in Two Binary Search Trees LeetCode 1361 | Validate Binary Tree Nodes LeetCode 1379 | Find a Corresponding Node of a Binary Tree in a Clone of That Tree LeetCode 1457 | Pseudo-Palindromic Paths in a Binary Tree LeetCode 1530 | Number of Good Leaf Nodes Pairs
Tree
LeetCode 95 | Unique Binary Search Trees II LeetCode 98 | Validate Binary Search Tree LeetCode 99 | Recover Binary Search Tree LeetCode 100 | Same Tree LeetCode 102 | Binary Tree Level Order Traversal LeetCode 103 | Binary Tree Zigzag Level Order Traversal LeetCode 104 | Maximum Depth of Binary Tree LeetCode 107 | Binary Tree Level Order Traversal II LeetCode 109 | Convert Sorted List to Binary Search Tree LeetCode 111 | Minimum Depth of Binary Tree LeetCode 199 | Binary Tree Right Side View LeetCode 230 | Kth Smallest Element in a BST LeetCode 235 | Lowest Common Ancestor of a Binary Search Tree LeetCode 236 | Lowest Common Ancestor of a Binary Tree LeetCode 429 | N-ary Tree Level Order Traversal LeetCode 437 | Path Sum III LeetCode 449 | Serialize and Deserialize BST LeetCode 515 | Find Largest Value in Each Tree Row LeetCode 530 | Minimum Absolute Difference in BST LeetCode 538 | Convert BST to Greater Tree LeetCode 623 | Add One Row to Tree LeetCode 662 | Maximum Width of Binary Tree LeetCode 669 | Trim a Binary Search Tree LeetCode 703 | Kth Largest Element in a Stream LeetCode 863 | All Nodes Distance K in Binary Tree LeetCode 865 | Smallest Subtree with all the Deepest Nodes LeetCode 872 | Leaf-Similar Trees LeetCode 889 | Construct Binary Tree from Preorder and Postorder Traversal LeetCode 894 | All Possible Full Binary Trees LeetCode 938 | Range Sum of BST LeetCode 951 | Flip Equivalent Binary Trees LeetCode 958 | Check Completeness of a Binary Tree LeetCode 971 | Flip Binary Tree To Match Preorder Traversal LeetCode 988 | Smallest String Starting From Leaf LeetCode 1008 | Construct Binary Search Tree from Preorder Traversal LeetCode 1026 | Maximum Difference Between Node and Ancestor LeetCode 1038 | Binary Search Tree to Greater Sum Tree LeetCode 1080 | Insufficient Nodes in Root to Leaf Paths LeetCode 1104 | Path In Zigzag Labelled Binary Tree LeetCode 1110 | Delete Nodes And Return Forest LeetCode 1123 | Lowest Common Ancestor of Deepest Leaves LeetCode 1161 | Maximum Level Sum of a Binary Tree LeetCode 1302 | Deepest Leaves Sum LeetCode 1305 | All Elements in Two Binary Search Trees LeetCode 1315 | Sum of Nodes with Even-Valued Grandparent LeetCode 1325 | Delete Leaves With a Given Value LeetCode 1361 | Validate Binary Tree Nodes LeetCode 1448 | Count Good Nodes in Binary Tree LeetCode 1457 | Pseudo-Palindromic Paths in a Binary Tree LeetCode 1519 | Number of Nodes in the Sub-Tree With the Same Label LeetCode 1530 | Number of Good Leaf Nodes Pairs LeetCode 1609 | Even Odd Tree
Sliding Window
Sliding Window
String
String
LeetCode 20 | Valid Parentheses LeetCode 22 | Generate Parentheses LeetCode 125 | Valid Palindrome LeetCode 131 | Palindrome Partitioning LeetCode 205 | Isomorphic Strings LeetCode 242 | Valid Anagram LeetCode 318 | Maximum Product of Word Lengths LeetCode 402 | Remove K Digits LeetCode 409 | Longest Palindrome LeetCode 451 | Sort Characters By Frequency LeetCode 516 | Longest Palindromic Subsequence LeetCode 647 | Palindromic Substrings LeetCode 791 | Custom Sort String LeetCode 792 | Number of Matching Subsequences LeetCode 856 | Score of Parentheses LeetCode 859 | Buddy Strings LeetCode 1048 | Longest String Chain LeetCode 1143 | Longest Common Subsequence LeetCode 1177 | Can Make Palindrome from Substring LeetCode 1239 | Maximum Length of a Concatenated String with Unique Characters LeetCode 1249 | Minimum Remove to Make Valid Parentheses LeetCode 1297 | Maximum Number of Occurrences of a Substring LeetCode 1328 | Break a Palindrome LeetCode 1400 | Construct K Palindrome Strings LeetCode 1405 | Longest Happy String LeetCode 1433 | Check If a String Can Break Another String LeetCode 1616 | Split Two Strings to Make Palindrome LeetCode 1624 | Largest Substring Between Two Equal Characters LeetCode 1657 | Determine if Two Strings Are Close LeetCode 1662 | Check If Two String Arrays are Equivalent LeetCode 1790 | Check if One String Swap Can Make Strings Equal LeetCode 1880 | Check if Word Equals Summation of Two Words LeetCode 1903 | Largest Odd Number in String LeetCode 1915 | Number of Wonderful Substrings
Linked List
Linked List
Interval
Interval
Heap
Heap
Top K Pattern
Merge Pattern
Min Pattern
Graph
Graph
Graph
DSU
Fenwick Tree
Fenwick Tree
Dynamic Programming
Min-Max
Distinct Ways
Merging Intervals
On Strings
Decision Making
Classical
Knapsack
Decision Making
Distinct Ways
Max Min
Grid
Math realted
Dp on Strings
Graph/ Tree
Bit Manipulation Dp
Interval
Merging Interval
Multi Dimesion
Recursion/Backtracking
Recursion/Backtracking
Binary Search
Binary Search

Credit: Leetcode