121
3sum
402RemoveKDigits
BinaryTreeRepresentaion
Count_Lis
DeleteNodeInBst
LargestBstInTree
Lis_Iterative
LruCache
RecoverBinaryTree
VerticalOrderTraversal
accountsMerge
add1LL
add2Numbers
aggressiveCows
arrayRotatedAndSoreted
asteriodCollision
atoi
bellmanFord
bestTimeTobuyAndSellStocks3
burstBaloons
capacityDDays
cheapestFLightsWithKStops
chocolatePickup
constructBSTUsingPreorder
countSquares
countSubarrayWithXork
cycleDetection
cycleDetectionUndirected
cycleDetection_dfs
diameter
distinctSubsequence
editDistance
eventualSafeState
expressionAddOperator
findAPeakElement
findPeakElement
flattenTreeToLinkedList
floydWarshall
handOfStraights
house_robber_2
implementStackWithArray
inversionCount
isPrime
kSorted
kruskals
kth positive
largestDivisibleSubset
lca
lcs
letterCombo
levelOrderTraversal
longestConsequtiveSequence
longestPallindrome
mCOlors
majorityElement2
matrixMedian
matrixMultiplicationToReachEnd
maxPathSum
maxSumCombo
maximalReactangles
maxjorityElem
mcm
medianOf@sortedArrays
medianOfLL
mergeIntervals
minCostTOCutStick
minFallingPathSum
minStack
minWindowSubstring
missingNumber
mostStonesRemoved
mst
nQueen
nextPermutation
nodesAtdistanceK
numberOfLis
numberOfOperationToMakeNetworkConnected
oddevenLL
onlineStockSpan
pairSum
pallindromPartition
partitionArrayinto2ArraysTOMinimizeSumDifference
partitionWithGivenDiff
pathWithMinEffort
pow
primsAlgorithm
printLis
printPrime
rainWater
removeDuplicates
reversePairs
rotateArray
rotateImage
searchIn2Darray2
searchInRotatedSortedArray2
shortestCommonSupersequence
singleElementInSorted
singleNUmber3
sortList
sortStack
spiralMatrix
splitArrayLargestSum
subarraySumK
subarrayWithKDifferentIntegers
subsetSumequlalsK
sudokuSolver
sumOfBeautyOfAllstrings
sumOfSubarrayMin
swap
targetSum
taskScheduler
topView
treefromInorderAndPreorder
validParanthesis
veryImporatantModel
wordBreak
wordSearch
xorInaRange
zero_one_matrix
question ---
***
### Arrays
* **121**:
* **3sum**: 3Sum
* **add1LL**: Add 1 to a number represented as a Linked List (This is often grouped
with Array/LinkedList problems)
* **add2Numbers**: Add Two Numbers
* **arrayRotatedAndSoreted**: Check if Array Is Sorted and Rotated
* **inversionCount**: Count Inversions
* **longestConsequtiveSequence**: Longest Consecutive Sequence
* **majorityElement2**: Majority Element II
* **maxjorityElem**: Majority Element
* **mergeIntervals**: Merge Intervals
* **missingNumber**: Missing Number
* **nextPermutation**: Next Permutation
* **pairSum**: Two Sum
* **pow**: Pow(x, n)
* **removeDuplicates**: Remove Duplicates from Sorted Array
* **reversePairs**: Reverse Pairs
* **rotateArray**: Rotate Array
* **searchIn2Darray2**: Search a 2D Matrix II
* **searchInRotatedSortedArray2**: Search in Rotated Sorted Array II
* **singleElementInSorted**: Single Element in a Sorted Array
* **singleNUmber3**: Single Number III
* **spiralMatrix**: Spiral Matrix
* **subarraySumK**: Subarray Sum Equals K
* **swap**: Swap Nodes in Pairs
***
### Binary Search
* **aggressiveCows**: Aggressive Cows
* **capacityDDays**: Capacity To Ship Packages Within D Days
* **findAPeakElement**: Find a Peak Element
* **findPeakElement**: Find Peak Element
* **kth positive**: Kth Missing Positive Number
* **matrixMedian**: Median in a row-wise sorted Matrix
* **medianOf@sortedArrays**: Median of Two Sorted Arrays
* **splitArrayLargestSum**: Split Array Largest Sum
***
### Binary Trees & BST
* **BinaryTreeRepresentaion**: Binary Tree Representation
* **DeleteNodeInBst**: Delete Node in a BST
* **LargestBstInTree**: Largest BST in a Binary Tree
* **RecoverBinaryTree**: Recover Binary Search Tree
* **VerticalOrderTraversal**: Vertical Order Traversal of a Binary Tree
* **constructBSTUsingPreorder**: Construct Binary Search Tree from Preorder
Traversal
* **diameter**: Diameter of Binary Tree
* **flattenTreeToLinkedList**: Flatten Binary Tree to Linked List
* **lca**: Lowest Common Ancestor of a Binary Tree
* **levelOrderTraversal**: Binary Tree Level Order Traversal
* **maxPathSum**: Binary Tree Maximum Path Sum
* **nodesAtdistanceK**: All Nodes Distance K in Binary Tree
* **topView**: Top View of Binary Tree
* **treefromInorderAndPreorder**: Construct Binary Tree from Preorder and Inorder
Traversal
***
### Dynamic Programming (DP)
* **bestTimeTobuyAndSellStocks3**: Best Time to Buy and Sell Stock III
* **burstBaloons**: Burst Balloons
* **chocolatePickup**: Chocolate Pickup (Cherry Pickup II)
* **Count_Lis**: Count Longest Increasing Subsequence
* **countSquares**: Count Square Submatrices with All Ones
* **distinctSubsequence**: Distinct Subsequences
* **editDistance**: Edit Distance
* **house_robber_2**: House Robber II
* **largestDivisibleSubset**: Largest Divisible Subset
* **lcs**: Longest Common Subsequence
* **Lis_Iterative**: Longest Increasing Subsequence (Iterative)
* **matrixMultiplicationToReachEnd**: Minimum Path Sum
* **mcm**: Matrix Chain Multiplication
* **minCostTOCutStick**: Minimum Cost to Cut a Stick
* **minFallingPathSum**: Minimum Falling Path Sum
* **numberOfLis**: Number of Longest Increasing Subsequence
* **partitionArrayinto2ArraysTOMinimizeSumDifference**: Partition a set into two
subsets such that the difference of subset sums is minimum
* **partitionWithGivenDiff**: Partitions With Given Difference
* **printLis**: Printing Longest Increasing Subsequence
* **shortestCommonSupersequence**: Shortest Common Supersequence
* **subsetSumequlalsK**: Subset Sum Equal To K
* **targetSum**: Target Sum
* **wordBreak**: Word Break
***
### Graphs
* **accountsMerge**: Accounts Merge
* **bellmanFord**: Bellman-Ford Algorithm
* **cheapestFLightsWithKStops**: Cheapest Flights Within K Stops
* **cycleDetection**: Linked List Cycle (can also refer to graph cycle detection)
* **cycleDetectionUndirected**: Detect cycle in an undirected graph
* **cycleDetection_dfs**: Detect cycle in a directed graph (using DFS)
* **eventualSafeState**: Find Eventual Safe States
* **floydWarshall**: Floyd-Warshall Algorithm
* **kruskals**: Kruskal's Algorithm
* **mostStonesRemoved**: Most Stones Removed with Same Row or Column
* **mst**: Minimum Spanning Tree
* **numberOfOperationToMakeNetworkConnected**: Number of Operations to Make Network
Connected
* **pathWithMinEffort**: Path With Minimum Effort
* **primsAlgorithm**: Prim's Algorithm
* **zero_one_matrix**: 01 Matrix
***
### Linked List
* **medianOfLL**: Find the middle of a Linked List
* **oddevenLL**: Odd Even Linked List
* **sortList**: Sort List
***
### Recursion & Backtracking
* **expressionAddOperator**: Expression Add Operators
* **letterCombo**: Letter Combinations of a Phone Number
* **mCOlors**: M-Coloring Problem
* **nQueen**: N-Queens
* **pallindromPartition**: Palindrome Partitioning
* **sudokuSolver**: Sudoku Solver
* **wordSearch**: Word Search
***
### Stacks & Queues
* **402RemoveKDigits**: Remove K Digits
* **asteriodCollision**: Asteroid Collision
* **implementStackWithArray**: Implement Stack using Array
* **LruCache**: LRU Cache
* **minStack**: Min Stack
* **onlineStockSpan**: Online Stock Span
* **sortStack**: Sort a Stack
* **validParanthesis**: Valid Parentheses
***
### Strings
* **atoi**: String to Integer (atoi)
* **longestPallindrome**: Longest Palindromic Substring
* **minWindowSubstring**: Minimum Window Substring
* **sumOfBeautyOfAllstrings**: Sum of Beauty of All Substrings
***
### Heaps & Miscellaneous
* **handOfStraights**: Hand of Straights
* **isPrime**: Check if a number is Prime
* **kSorted**: Merge K Sorted Arrays
* **maxSumCombo**: Find K-Sum combinations
* **maximalReactangles**: Maximal Rectangle
* **printPrime**: Sieve of Eratosthenes
* **rainWater**: Trapping Rain Water
* **subarrayWithKDifferentIntegers**: Subarrays with K Different Integers
* **sumOfSubarrayMin**: Sum of Subarray Minimums
* **taskScheduler**: Task Scheduler
* **xorInaRange**: XOR Queries of a Subarray
* **countSubarrayWithXork**: Count subarrays with given XOR K
**Note**: `veryImporatantModel` does not correspond to a specific DSA question name
and is likely a note or typo from the sheet.
NOT DONE
* **rotateImage**: Rotate Image
