Category Name Status

Arrays Contains Duplicate

Arrays Valid Anagram

Arrays Two Sum

Arrays Group Anagrams

Arrays Top K Frequent Elements

Product of Array Except Self
Arrays
Arrays Valid Sudoku
Arrays Encode and Decode Strings
Two Pointers Valid Palindrome
Two Pointers Two Sum II
Two Pointers 3Sum
Two Pointers Container with Most Water

Two Pointers Trapping Rain Water Solved

Longest Substring Without
Sliding Window Repeating Characters
Longest Repeating Character
Sliding Window Replacement
Sliding Window Permutation in String
Sliding Window Minimum Window Substring
Sliding Window Sliding Window Maximum
Stack Valid Parentheses
Stack Min Stack
Evaluate Reverse Polish
Stack Notation
Stack Generate Parentheses
Stack Daily Temperatures
Stack Car Fleet
Largest Rectangle in
Stack Histogram
Stack Basic Calculator II
Stack Basic Calculator III
Binary Search Binary Search
Binary Search Search a 2D Matrix
Binary Search Koko Eating Bananas

Binary Search Search Rotated Sorted Array

 Find Minimum in Rotated
Binary Search Sorted Array

Binary Search Time Based Key-Value Store

Find Median of Two Sorted
Binary Search Arrays
Linked List Reverse Linked List
Linked List Merge Two Linked Lists
Linked List Reorder List
Remove Nth Node from End of
Linked List List

Linked List Copy List with Random Pointer

Linked List Add Two Numbers
Linked List Linked List Cycle
Linked List Find the Duplicate Number
Linked List LRU Cache
Linked List Merge K Sorted Lists
Linked List Reverse Nodes in K-Group
Trees Invert Binary Tree
Maximum Depth of Binary
Trees Tree
Trees Diameter of a Binary Tree
Trees Balanced Binary Tree
Trees Same Tree
Trees Subtree of Another Tree
Lowest Common Ancestor of a
Trees BST
Binary Tree Level Order
Trees Traversal
Trees Binary Tree Right Side View
Count Good Nodes in a Binary
Trees Tree
Trees Validate Binary Search Tree

Trees Kth Smallest Element in a BST

Construct Tree from Preorder

Trees and Inorder Traversal
Trees Binary Tree Max Path Sum
Serialize and Deserialize
Trees Binary Tree
Tries Implement Trie
 Design Add and Search Word
Tries Data Structure
Tries Word Search II
Kth Largest Element in a
Heap / Priority Queue Stream
Heap / Priority Queue Last Stone Weight
Heap / Priority Queue K Closest Points to Origin
Kth Largest Element in an
Heap / Priority Queue Array
Heap / Priority Queue Task Scheduler
Heap / Priority Queue Design Twitter

Heap / Priority Queue Find Median from Data Stream

Backtracking Subsets
Backtracking Combination Sum
Backtracking Permutations
Backtracking Subsets II
Backtracking Combination Sum II
Backtracking Word Search
Backtracking Palindrome Partitioning
Letter Combinations of a
Backtracking Phone Number
Backtracking N-Queens
Graphs Number of Islands
Longest Consecutive
Graph Sequence
Graphs Clone Graph
Graphs Max Area of Island
Graphs Pacific Atlantic Waterflow
Graphs Surrounded Regions
Graphs Rotting Oranges
Graphs Walls and Gates
Graphs Course Schedule
Graphs Course Schedule II
Graphs Redundant Connection
Number of Connected
Graphs Components in Graph
Graphs Graph Valid Tree
Graphs Word Ladder
Advanced Graphs Reconstruct Itinerary

Advanced Graphs Min Cost to Connect all Points

Advanced Graphs Network Delay Time
Advanced Graphs Swim in Rising Water
Advanced Graphs Alien Dictionary Solved

Advanced Graphs Cheapest Flights with K Stops

1-D Dynamic Programming Best Time to Buy & Sell Stock

1-D Dynamic Programming Climbing Stairs
1-D Dynamic Programming Min Cost Climbing Stairs
1-D Dynamic Programming House Robber
1-D Dynamic Programming House Robber II
Longest Palindroming
1-D Dynamic Programming Substring
1-D Dynamic Programming Palindrome Substrings
1-D Dynamic Programming Decode Ways
1-D Dynamic Programming Coin Change
1-D Dynamic Programming Maximum Product Subarray
1-D Dynamic Programming Word Break
Longest Increasing
1-D Dynamic Programming Subsequence
1-D Dynamic Programming Partition Equal Subset Sum
2-D Dynamic Programming Unique Paths
Longest Common
2-D Dynamic Programming Subsequence
Best Time to Buy/Sell Stock
2-D Dynamic Programming With Cooldown
2-D Dynamic Programming Coin Change II
2-D Dynamic Programming Target Sum
2-D Dynamic Programming Interleaving String
Longest Increasing Path in a
2-D Dynamic Programming Matrix
2-D Dynamic Programming Distinct Subsequences
2-D Dynamic Programming Edit Distance
2-D Dynamic Programming Burst Balloons

2-D Dynamic Programming Regular Expression Matching

Greedy Maximum Subarray
Greedy Jump Game
Greedy Jump Game II
Greedy Gas Station
Greedy Hand of Straights
Merge Triplets to Form Target
Greedy Triplet
Greedy Partition Labels
Greedy Valid Parenthesis String
Intervals Insert Interval
Intervals Merge Intervals
Intervals Non-Overlapping Intervals
Intervals Meeting Rooms
Intervals Meeting Rooms II
Minimum Interval to Include
Intervals Each Query
Math & Geometry Rotate Image
Math & Geometry Spiral Matrix
Math & Geometry Set Matrix Zeroes
Math & Geometry Happy Number
Math & Geometry Plus One
Math & Geometry Pow(x, n)
Math & Geometry Multiply Strings
Math & Geometry Detect Squares
Bit Manipulation Single Number
Bit Manipulation Number of 1 Bits
Bit Manipulation Counting Bits
Bit Manipulation Reverse Bits
Bit Manipulation Missing Number
Bit Manipulation Sum of Two Integers
Bit Manipulation Reverse Integer
Link

https://leetcode.com/problems/contains-duplicate/
https://leetcode.com/problems/valid-anagram/

https://leetcode.com/problems/two-sum/
https://leetcode.com/problems/group-anagrams/

https://leetcode.com/problems/top-k-frequent-elements/

https://leetcode.com/problems/product-of-array-except-self/
https://leetcode.com/problems/valid-sudoku/
https://leetcode.com/accounts/login/?next=/problems/encode-and-decode-strings/
https://leetcode.com/problems/valid-palindrome/
https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/
https://leetcode.com/problems/3sum/
https://leetcode.com/problems/container-with-most-water/

https://leetcode.com/problems/trapping-rain-water/

https://leetcode.com/problems/longest-substring-without-repeating-characters/

https://leetcode.com/problems/longest-repeating-character-replacement/
https://leetcode.com/problems/permutation-in-string/
https://leetcode.com/problems/minimum-window-substring/
https://leetcode.com/problems/sliding-window-maximum/
https://leetcode.com/problems/valid-parentheses/
https://leetcode.com/problems/min-stack/

https://leetcode.com/problems/evaluate-reverse-polish-notation/
https://leetcode.com/problems/generate-parentheses/
https://leetcode.com/problems/daily-temperatures/
https://leetcode.com/problems/car-fleet/

https://leetcode.com/problems/largest-rectangle-in-histogram/
https://leetcode.com/problems/basic-calculator-ii
https://leetcode.com/problems/basic-calculator-iii
https://leetcode.com/problems/binary-search/
https://leetcode.com/problems/search-a-2d-matrix/
https://leetcode.com/problems/koko-eating-bananas/

https://leetcode.com/problems/search-in-rotated-sorted-array/
https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/

https://leetcode.com/problems/time-based-key-value-store/

https://leetcode.com/problems/median-of-two-sorted-arrays/
https://leetcode.com/problems/reverse-linked-list/
https://leetcode.com/problems/merge-two-sorted-lists/
https://leetcode.com/problems/reorder-list/

https://leetcode.com/problems/remove-nth-node-from-end-of-list/

https://leetcode.com/problems/copy-list-with-random-pointer/
https://leetcode.com/problems/add-two-numbers/
https://leetcode.com/problems/linked-list-cycle/
https://leetcode.com/problems/find-the-duplicate-number/
https://leetcode.com/problems/lru-cache/
https://leetcode.com/problems/merge-k-sorted-lists/
https://leetcode.com/problems/reverse-nodes-in-k-group/
https://leetcode.com/problems/invert-binary-tree/

https://leetcode.com/problems/maximum-depth-of-binary-tree/
https://leetcode.com/problems/diameter-of-binary-tree/
https://leetcode.com/problems/balanced-binary-tree/
https://leetcode.com/problems/same-tree/
https://leetcode.com/problems/subtree-of-another-tree/

https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/

https://leetcode.com/problems/binary-tree-level-order-traversal/
https://leetcode.com/problems/binary-tree-right-side-view/

https://leetcode.com/problems/count-good-nodes-in-binary-tree/
https://leetcode.com/problems/validate-binary-search-tree/

https://leetcode.com/problems/kth-smallest-element-in-a-bst/

https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/
https://leetcode.com/problems/binary-tree-maximum-path-sum/

https://leetcode.com/problems/serialize-and-deserialize-binary-tree/
https://leetcode.com/problems/implement-trie-prefix-tree/
https://leetcode.com/problems/design-add-and-search-words-data-structure/
https://leetcode.com/problems/word-search-ii/

https://leetcode.com/problems/kth-largest-element-in-a-stream/
https://leetcode.com/problems/last-stone-weight/
https://leetcode.com/problems/k-closest-points-to-origin/

https://leetcode.com/problems/kth-largest-element-in-an-array/
https://leetcode.com/problems/task-scheduler/
https://leetcode.com/problems/design-twitter/

https://leetcode.com/problems/find-median-from-data-stream/
https://leetcode.com/problems/subsets/
https://leetcode.com/problems/combination-sum/
https://leetcode.com/problems/permutations/
https://leetcode.com/problems/subsets-ii/
https://leetcode.com/problems/combination-sum-ii/
https://leetcode.com/problems/word-search/
https://leetcode.com/problems/palindrome-partitioning/

https://leetcode.com/problems/letter-combinations-of-a-phone-number/
https://leetcode.com/problems/n-queens/
https://leetcode.com/problems/number-of-islands/

https://leetcode.com/problems/longest-consecutive-sequence/
https://leetcode.com/problems/clone-graph/
https://leetcode.com/problems/max-area-of-island/
https://leetcode.com/problems/pacific-atlantic-water-flow/
https://leetcode.com/problems/surrounded-regions/
https://leetcode.com/problems/rotting-oranges/
https://leetcode.com/problems/walls-and-gates/
https://leetcode.com/problems/course-schedule/
https://leetcode.com/problems/course-schedule-ii/
https://leetcode.com/problems/redundant-connection/

https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/
https://leetcode.com/problems/graph-valid-tree/
https://leetcode.com/problems/word-ladder/
https://leetcode.com/problems/reconstruct-itinerary/

https://leetcode.com/problems/min-cost-to-connect-all-points/
https://leetcode.com/problems/network-delay-time/
https://leetcode.com/problems/swim-in-rising-water/
https://leetcode.com/problems/alien-dictionary/

https://leetcode.com/problems/cheapest-flights-within-k-stops/

https://leetcode.com/problems/best-time-to-buy-and-sell-stock/
https://leetcode.com/problems/climbing-stairs/
https://leetcode.com/problems/min-cost-climbing-stairs/
https://leetcode.com/problems/house-robber/
https://leetcode.com/problems/house-robber-ii/

https://leetcode.com/problems/longest-palindromic-substring/
https://leetcode.com/problems/palindromic-substrings/
https://leetcode.com/problems/decode-ways/
https://leetcode.com/problems/coin-change/
https://leetcode.com/problems/maximum-product-subarray/
https://leetcode.com/problems/word-break/

https://leetcode.com/problems/longest-increasing-subsequence/
https://leetcode.com/problems/partition-equal-subset-sum/
https://leetcode.com/problems/unique-paths/

https://leetcode.com/problems/longest-common-subsequence/

https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/
https://leetcode.com/problems/coin-change-2/
https://leetcode.com/problems/target-sum/
https://leetcode.com/problems/interleaving-string/

https://leetcode.com/problems/longest-increasing-path-in-a-matrix/
https://leetcode.com/problems/distinct-subsequences/
https://leetcode.com/problems/edit-distance/
https://leetcode.com/problems/burst-balloons/

https://leetcode.com/problems/regular-expression-matching/
https://leetcode.com/problems/maximum-subarray/
https://leetcode.com/problems/jump-game/
https://leetcode.com/problems/jump-game-ii/
https://leetcode.com/problems/gas-station/
https://leetcode.com/problems/hand-of-straights/

https://leetcode.com/problems/merge-triplets-to-form-target-triplet/
https://leetcode.com/problems/partition-labels/
https://leetcode.com/problems/valid-parenthesis-string/
https://leetcode.com/problems/insert-interval/
https://leetcode.com/problems/merge-intervals/
https://leetcode.com/problems/non-overlapping-intervals/
https://leetcode.com/problems/meeting-rooms/
https://leetcode.com/problems/meeting-rooms-ii/

https://leetcode.com/problems/minimum-interval-to-include-each-query/
https://leetcode.com/problems/rotate-image/
https://leetcode.com/problems/spiral-matrix/
https://leetcode.com/problems/set-matrix-zeroes/
https://leetcode.com/problems/happy-number/
https://leetcode.com/problems/plus-one/
https://leetcode.com/problems/powx-n/
https://leetcode.com/problems/multiply-strings/
https://leetcode.com/problems/detect-squares/
https://leetcode.com/problems/single-number/
https://leetcode.com/problems/number-of-1-bits/
https://leetcode.com/problems/counting-bits/
https://leetcode.com/problems/reverse-bits/
https://leetcode.com/problems/missing-number/
https://leetcode.com/problems/sum-of-two-integers/
https://leetcode.com/problems/reverse-integer/
Notes
Hashset to get unique values in array, to check for duplicates easily

Use Hashmap or frequency Array (26)

Use hash map to instantly check for difference value, map will add index of last occurrence of a num,
don’t use same element twice;

Use Frequency Array(126), make a key and add to HashMap

Use Counting sort / Bucket sort, per bucket add frequencies of elements, nums: [1, 1, 1, 2, 2, 3],
buckets: [[],[ 3 ],[ 2 ],[ 1 ],[],[],[]] (index : frequency)

Use Prefix sum, first calculate from left and then from right hand side
Use HashSet and check for colums, rows and subGrid if it already exists

Two Pointers (left from starting & right from the end )

Use Two Pointers. Calculate LeftMax and RightMax. For any height the water is water[i] =
Math.min(leftmax, rightmax) - height[i]

Use a stack to push open parentheses, if close parentheses is encountered then use a dictionary and check if it's a
Build the graph with non matching character. Skip the same prefixes words . Apply Topological Sorting
ary and check if it's a match, check edge cases, and empty queues, valid input and inputs where closing parentheses
sing parentheses