Leetcode-Problems

KO | EN

gitlite — search

#javascript #llm #go #android #machine-learning #rust #deep-learning #java #cli #awesome-list #pytorch #security #ios #open-source

Leetcode-Problems

(★ 51)

Collection of LeetCode questions to ace the coding interview!

Leetcode-Problems 최신버젼 다운로드

최종 버전 다운로드 (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# Problems
Collection of Standard Problems and my solutions

## Arrays and Strings

[Sort an array](https://github.com/meetjain74/Leetcode-Problems/tree/main/912-sort-an-array)  
[Rotate array](https://github.com/meetjain74/Leetcode-Problems/tree/main/189-rotate-array)  
[Removing minimum and maximum from array](https://github.com/meetjain74/Leetcode-Problems/tree/main/2091-removing-minimum-and-maximum-from-array)  
[Sort colors](https://github.com/meetjain74/Leetcode-Problems/tree/main/75-sort-colors)  
[Pancake sorting](https://github.com/meetjain74/Leetcode-Problems/tree/main/969-pancake-sorting)    
[Minimum steps to make product equal to one](https://github.com/meetjain74/Leetcode-Problems/tree/main/Minimum%20steps%20to%20make%20product%20equal%20to%20one%20-%20GFG)    
[Shortest distance to a character](https://github.com/meetjain74/Leetcode-Problems/tree/main/821-shortest-distance-to-a-character)   
[Push dominoes](https://github.com/meetjain74/Leetcode-Problems/tree/main/838-push-dominoes)    
[First missing positive](https://github.com/meetjain74/Leetcode-Problems/tree/main/41-first-missing-positive)   
[Maximum subarray](https://github.com/meetjain74/Leetcode-Problems/tree/main/53-maximum-subarray)  
[Maximum sum circular subarray](https://github.com/meetjain74/Leetcode-Problems/tree/main/918-maximum-sum-circular-subarray)    
[Smallest range II](https://github.com/meetjain74/Leetcode-Problems/tree/main/910-smallest-range-ii)  
[Global and local inversions](https://github.com/meetjain74/Leetcode-Problems/tree/main/775-global-and-local-inversions)  
[Reverse pairs](https://github.com/meetjain74/Leetcode-Problems/tree/main/493-reverse-pairs)   
[Squares of a sorted array](https://github.com/meetjain74/Leetcode-Problems/tree/main/977-squares-of-a-sorted-array)   
[Rearrange an array with O(1) space](https://github.com/meetjain74/Leetcode-Problems/tree/main/Rearrange%20an%20array%20with%20O(1)%20extra%20space%20-%20GFG)    
[Rearrange array elements by sign](https://github.com/meetjain74/Leetcode-Problems/tree/main/2149-rearrange-array-elements-by-sign)    
[Count and say](https://github.com/meetjain74/Leetcode-Problems/tree/main/38-count-and-say)    
[Add strings](https://github.com/meetjain74/Leetcode-Problems/tree/main/415-add-strings)   
[Multiply strings](https://github.com/meetjain74/Leetcode-Problems/tree/main/43-multiply-strings)   
[Equal sum arrays with minimum number of operations](https://github.com/meetjain74/Leetcode-Problems/tree/main/1775-equal-sum-arrays-with-minimum-number-of-operations)

## Two pointer approach / Sliding window

[Two sum](https://github.com/meetjain74/Leetcode-Problems/tree/main/1-two-sum)  
[3 sum](https://github.com/meetjain74/Leetcode-Problems/tree/main/15-3sum)  
[3 sum closest](https://github.com/meetjain74/Leetcode-Problems/tree/main/16-3sum-closest)  
[4 sum](https://github.com/meetjain74/Leetcode-Problems/tree/main/18-4sum)  
[Container with most water](https://github.com/meetjain74/Leetcode-Problems/tree/main/11-container-with-most-water)   
[Max consecutive ones III](https://github.com/meetjain74/Leetcode-Problems/tree/main/1004-max-consecutive-ones-iii)    
[Valid triangle number](https://github.com/meetjain74/Leetcode-Problems/tree/main/611-valid-triangle-number)    
[Number of subsequences that satisfy the given sum condition](https://github.com/meetjain74/Leetcode-Problems/tree/main/1498-number-of-subsequences-that-satisfy-the-given-sum-condition)     
[Longest continuous increasing subsequence](https://github.com/meetjain74/Leetcode-Problems/tree/main/674-longest-continuous-increasing-subsequence)    
[First negative integer in every window of size k](https://github.com/meetjain74/Leetcode-Problems/tree/main/First%20negative%20integer%20in%20every%20window%20of%20size%20k%20-%20GFG)  
[Minimum size subarray sum](https://github.com/meetjain74/Leetcode-Problems/tree/main/209-minimum-size-subarray-sum)    
[Find all anagrams in a string](https://github.com/meetjain74/Leetcode-Problems/tree/main/438-find-all-anagrams-in-a-string)  
[Sliding window maximum](https://github.com/meetjain74/Leetcode-Problems/tree/main/239-sliding-window-maximum)   
[Longest continuous subarray with absolute difference less than or equal to limit](https://github.com/meetjain74/Leetcode-Problems/tree/main/1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit)     
[Minimum window substring](https://github.com/meetjain74/Leetcode-Problems/tree/main/76-minimum-window-substring)

## Linked list

[Reverse linked list](https://github.com/meetjain74/Leetcode-Problems/tree/main/206-reverse-linked-list)  
[Delete node in a linked list](https://github.com/meetjain74/Leetcode-Problems/tree/main/237-delete-node-in-a-linked-list)  
[Linked list cycle](https://github.com/meetjain74/Leetcode-Problems/tree/main/141-linked-list-cycle)  
[Linked list cycle II](https://github.com/meetjain74/Leetcode-Problems/tree/main/142-linked-list-cycle-ii)  
[Remove Nth node from end of list](https://github.com/meetjain74/Leetcode-Problems/tree/main/19-remove-nth-node-from-end-of-list)  
[Palindrome linked list](https://github.com/meetjain74/Leetcode-Problems/tree/main/234-palindrome-linked-list)  
[Add 1 to a number represented as linked list](https://github.com/meetjain74/Leetcode-Problems/tree/main/Add%201%20to%20a%20number%20represented%20as%20linked%20list%20-%20GFG)   
[Add two numbers](https://github.com/meetjain74/Leetcode-Problems/tree/main/2-add-two-numbers)   
[Partition list](https://github.com/meetjain74/Leetcode-Problems/tree/main/86-partition-list)   
[Intersection of two linked lists](https://github.com/meetjain74/Leetcode-Problems/tree/main/160-intersection-of-two-linked-lists)  
[Sort Linked list (Merge sort and Quick Sort)](https://github.com/meetjain74/Leetcode-Problems/tree/main/148-sort-list)  
[Swap nodes in pairs](https://github.com/meetjain74/Leetcode-Problems/tree/main/24-swap-nodes-in-pairs)  
[Reverse node in k group](https://github.com/meetjain74/Leetcode-Problems/tree/main/25-reverse-nodes-in-k-group)  
[Merge k sorted lists](https://github.com/meetjain74/Leetcode-Problems/tree/main/23-merge-k-sorted-lists)  
[Copy list with random pointer](https://github.com/meetjain74/Leetcode-Problems/tree/main/138-copy-list-with-random-pointer)

## Stack and Queues

[Valid parentheses](https://github.com/meetjain74/Leetcode-Problems/tree/main/20-valid-parentheses)  
[Implement queue using stack](https://github.com/meetjain74/Leetcode-Problems/tree/main/232-implement-queue-using-stacks)  
[Implement stack using queue](https://github.com/meetjain74/Leetcode-Problems/tree/main/225-implement-stack-using-queues)   
[Min stack](https://github.com/meetjain74/Leetcode-Problems/tree/main/155-min-stack)  
[Sort a stack](https://github.com/meetjain74/Leetcode-Problems/tree/main/Sort%20a%20stack%20-%20GFG)   
[LRU Cache](https://github.com/meetjain74/Leetcode-Problems/tree/main/146-lru-cache)  
[Basic calculator](https://github.com/meetjain74/Leetcode-Problems/tree/main/224-basic-calculator)   
[Next greater element II](https://github.com/meetjain74/Leetcode-Problems/tree/main/503-next-greater-element-ii)   
[Online stock span](https://github.com/meetjain74/Leetcode-Problems/tree/main/901-online-stock-span)  
[Maximal rectangle](https://github.com/meetjain74/Leetcode-Problems/tree/main/85-maximal-rectangle)  
[Smallest subsequence of distinct characters](https://github.com/meetjain74/Leetcode-Problems/tree/main/1081-smallest-subsequence-of-distinct-characters)   
[Steps to make array non decreasing](https://github.com/meetjain74/Leetcode-Problems/tree/main/2289-steps-to-make-array-non-decreasing)    
[Longest valid parentheses](https://github.com/meetjain74/Leetcode-Problems/tree/main/32-longest-valid-parentheses)

## Heap

[Kth largest element in an array](https://github.com/meetjain74/Leetcode-Problems/tree/main/215-kth-largest-element-in-an-array)  
[Sort a K nearly sorted array](https://github.com/meetjain74/Leetcode-Problems/tree/main/Nearly%20sorted%20-%20GFG)   
[Find k closest elements](https://github.com/meetjain74/Leetcode-Problems/tree/main/658-find-k-closest-elements)    
[Top K frequent elements](https://github.com/meetjain74/Leetcode-Problems/tree/main/347-top-k-frequent-elements)   
[Frequency sort](https://github.com/meetjain74/Leetcode-Problems/tree/main/1636-sort-array-by-increasing-frequency)   
[K closest points to origin](https://github.com/meetjain74/Leetcode-Problems/tree/main/973-k-closest-points-to-origin)  
[Merge k sorted lists](https://github.com/meetjain74/Leetcode-Problems/tree/main/23-merge-k-sorted-lists)  
[Reorganize string](https://github.com/meetjain74/Leetcode-Problems/tree/main/767-reorganize-string)   
[Find k pairs with smallest sums](https://github.com/meetjain74/Leetcode-Problems/tree/main/373-find-k-pairs-with-smallest-sums)

## Tree

[Binary tree inorder traversal](https://github.com/meetjain74/Leetcode-Problems/tree/main/94-binary-tree-inorder-traversal)   
[Binary tree preorder traversal](https://github.com/meetjain74/Leetcode-Problems/tree/main/144-binary-tree-preorder-traversal)   
[Binary tree postorder traversal](https://github.com/meetjain74/Leetcode-Problems/tree/main/145-binary-tree-postorder-traversal)  
[Binary tree level order traversal](https://github.com/meetjain74/Leetcode-Problems/tree/main/102-binary-tree-level-order-traversal)   
[Binary tree zingzag level order traversal](https://github.com/meetjain74/Leetcode-Problems/tree/main/103-binary-tree-zigzag-level-order-traversal)   
[Convert Sorted Array to Binary Search Tree](https://github.com/meetjain74/Leetcode-Problems/tree/main/108-convert-sorted-array-to-binary-search-tree)  
[Convert Sorted List to Binary Search Tree](https://github.com/meetjain74/Leetcode-Problems/tree/main/109-convert-sorted-list-to-binary-search-tree)   
[Diameter of binary tree](https://github.com/meetjain74/Leetcode-Problems/tree/main/543-diameter-of-binary-tree)   
[Invert binary tree](https://github.com/meetjain74/Leetcode-Problems/tree/main/226-invert-binary-tree)   
[Delete node in a BST](https://github.com/meetjain74/Leetcode-Problems/tree/main/450-delete-node-in-a-bst)   
[Symmetric tree](https://github.com/meetjain74/Leetcode-Problems/tree/main/101-symmetric-tree)  
[Validate binary search tree](https://github.com/meetjain74/Leetcode-Problems/tree/main/98-validate-binary-search-tree)   
[Right view of a binary tree](https://github.com/meetjain74/Leetcode-Problems/tree/main/199-binary-tree-right-side-view)   
[Boundary traversal of a binary tree](https://github.com/meetjain74/Leetcode-Problems/tree/main/Boundary%20Traversal%20of%20binary%20tree%20-%20GFG)   
[Vertical order traversal of a binary tree](https://github.com/meetjain74/Leetcode-Problems/tree/main/987-vertical-order-traversal-of-a-binary-tree)   
[Top view of a Binary tree](https://github.com/meetjain74/Leetcode-Problems/tree/main/Top%20View%20of%20Binary%20Tree%20-%20GFG)   
[Bottom view of a Binary tree](https://github.com/meetjain74/Leetcode-Problems/tree/main/Bottom%20View%20of%20Binary%20Tree%20-%20GFG)   
[Diagonal traversal of Binary tree](https://github.com/meetjain74/Leetcode-Problems/tree/main/Diagonal%20Traversal%20of%20Binary%20Tree%20-%20GFG)   
[Find mode in Binary Search Tree](https://github.com/meetjain74/Leetcode-Problems/tree/main/501-find-mode-in-binary-search-tree)    
[Lowest common ancestor of a binary search tree](https://github.com/meetjain74/Leetcode-Problems/tree/main/235-lowest-common-ancestor-of-a-binary-search-tree)   
[Lowest common ancestor of a binary tree](https://github.com/meetjain74/Leetcode-Problems/tree/main/236-lowest-common-ancestor-of-a-binary-tree)   
[Path sum](https://github.com/meetjain74/Leetcode-Problems/tree/main/112-path-sum)  
[Path sum II](https://github.com/meetjain74/Leetcode-Problems/tree/main/113-path-sum-ii)  
[Path sum III](https://github.com/meetjain74/Leetcode-Problems/tree/main/437-path-sum-iii)  
[Maximum width of Binary tree](https://github.com/meetjain74/Leetcode-Problems/tree/main/662-maximum-width-of-binary-tree)   
[Count complete tree nodes](https://github.com/meetjain74/Leetcode-Problems/tree/main/222-count-complete-tree-nodes)    
[All nodes distance K in a binary tree](https://github.com/meetjain74/Leetcode-Problems/tree/main/863-all-nodes-distance-k-in-binary-tree)   
[Construct binary tree from preorder and inorder traversal](https://github.com/meetjain74/Leetcode-Problems/tree/main/105-construct-binary-tree-from-preorder-and-inorder-traversal)  
[Construct binary tree from inorder and postorder traversal](https://github.com/meetjain74/Leetcode-Problems/tree/main/106-construct-binary-tree-from-inorder-and-postorder-traversal)  
[Construct binary search tree from preorder traversal](https://github.com/meetjain74/Leetcode-Problems/tree/main/1008-construct-binary-search-tree-from-preorder-traversal)   
[Flatten binary tree to linked list](https://github.com/meetjain74/Leetcode-Problems/tree/main/114-flatten-binary-tree-to-linked-list)   
[Binary search tree iterator](https://github.com/meetjain74/Leetcode-Problems/tree/main/173-binary-search-tree-iterator)   
[Two Sum IV - Input is a BST](https://github.com/meetjain74/Leetcode-Problems/tree/main/653-two-sum-iv-input-is-a-bst)   
[Longest zigzag path in a binary tree](https://github.com/meetjain74/Leetcode-Problems/tree/main/1372-longest-zigzag-path-in-a-binary-tree)    
[Recover binary search tree](https://github.com/meetjain74/Leetcode-Problems/tree/main/99-recover-binary-search-tree)    
[Find duplicate subtrees](https://github.com/meetjain74/Leetcode-Problems/tree/main/652-find-duplicate-subtrees)   
[Maximum sum BST in binary tree](https://github.com/meetjain74/Leetcode-Problems/tree/main/1373-maximum-sum-bst-in-binary-tree)  
[Linked list in Binary Tree](https://github.com/meetjain74/Leetcode-Problems/tree/main/1367-linked-list-in-binary-tree)   
[Binary tree maximum path sum](https://github.com/meetjain74/Leetcode-Problems/tree/main/124-binary-tree-maximum-path-sum)    
[House robber III](https://github.com/meetjain74/Leetcode-Problems/tree/main/337-house-robber-iii)   
[Binary tree cameras](https://github.com/meetjain74/Leetcode-Problems/tree/main/968-binary-tree-cameras)   
[Min distance between two given nodes of a binary tree](https://github.com/meetjain74/Leetcode-Problems/tree/main/Min%20distance%20between%20two%20given%20nodes%20of%20a%20Binary%20Tree%20-%20GFG)   
[Kth ancestor of a tree node](https://github.com/meetjain74/Leetcode-Problems/tree/main/1483-kth-ancestor-of-a-tree-node)

## Backtracking

[Rat in a maze](https://github.com/meetjain74/Leetcode-Problems/tree/main/Rat%20in%20a%20Maze%20Problem%20-%20I%20-%20GFG)  
[Letter combinations of a phone number](https://github.com/meetjain74/Leetcode-Problems/tree/main/17-letter-combinations-of-a-phone-number)  
[Lexicographical numbers](https://github.com/meetjain74/Leetcode-Problems/tree/main/386-lexicographical-numbers)  
[Generate parentheses](https://github.com/meetjain74/Leetcode-Problems/tree/main/22-generate-parentheses)  
[Permutations](https://github.com/meetjain74/Leetcode-Problems/tree/main/46-permutations)  
[Unique paths III](https://github.com/meetjain74/Leetcode-Problems/tree/main/980-unique-paths-iii)  
[Combination sum](https://github.com/meetjain74/Leetcode-Problems/tree/main/39-combination-sum)   
[Palindrome partitioning](https://github.com/meetjain74/Leetcode-Problems/tree/main/131-palindrome-partitioning)  
[Word Break II](https://github.com/meetjain74/Leetcode-Problems/tree/main/140-word-break-ii)  
[N queens](https://github.com/meetjain74/Leetcode-Problems/tree/main/51-n-queens)  
[Sudoko solver](https://github.com/meetjain74/Leetcode-Problems/tree/main/37-sudoku-solver)  
[Increasing subsequences](https://github.com/meetjain74/Leetcode-Problems/tree/main/491-increasing-subsequences)    
[Unique Binary search trees II](https://github.com/meetjain74/Leetcode-Problems/tree/main/95-unique-binary-search-trees-ii)   
[Restore IP addresses](https://github.com/meetjain74/Leetcode-Problems/tree/main/93-restore-ip-addresses)

## Dynamic programming

[Climbing stairs](https://github.com/meetjain74/Leetcode-Problems/tree/main/70-climbing-stairs)   
[Min cost climbing stairs](https://github.com/meetjain74/Leetcode-Problems/tree/main/746-min-cost-climbing-stairs)  
[House Robber](https://github.com/meetjain74/Leetcode-Problems/tree/main/198-house-robber)  
[Delete and earn](https://github.com/meetjain74/Leetcode-Problems/tree/main/740-delete-and-earn)    
[Unique paths](https://github.com/meetjain74/Leetcode-Problems/tree/main/62-unique-paths)  
[Unique paths II](https://github.com/meetjain74/Leetcode-Problems/tree/main/63-unique-paths-ii)  
[Decode ways](https://github.com/meetjain74/Leetcode-Problems/tree/main/91-decode-ways)   
[Decode ways II](https://github.com/meetjain74/Leetcode-Problems/tree/main/639-decode-ways-ii)   
[Binary tree with factors](https://github.com/meetjain74/Leetcode-Problems/tree/main/823-binary-trees-with-factors)     
[Unique binary search trees](https://github.com/meetjain74/Leetcode-Problems/tree/main/96-unique-binary-search-trees)   
[Word Break](https://github.com/meetjain74/Leetcode-Problems/tree/main/139-word-break)   
[Minimum path sum](https://github.com/meetjain74/Leetcode-Problems/tree/main/64-minimum-path-sum)    
[Maximal square](https://github.com/meetjain74/Leetcode-Problems/tree/main/221-maximal-square)   
[Count square submatrices with all ones](https://github.com/meetjain74/Leetcode-Problems/tree/main/1277-count-square-submatrices-with-all-ones)    
[0-1 Knapsack](https://github.com/meetjain74/Leetcode-Problems/tree/main/0%20-%201%20Knapsack%20Problem%20-%20GFG)      
[Subset sum](https://github.com/meetjain74/Leetcode-Problems/tree/main/Subset%20Sum%20Problem%20-%20GFG)     
[Partition equal subset sum](https://github.com/meetjain74/Leetcode-Problems/tree/main/416-partition-equal-subset-sum)  
[Minimum sum partition](https://github.com/meetjain74/Leetcode-Problems/tree/main/Minimum%20sum%20partition%20-%20GFG)     
[Target sum](https://github.com/meetjain74/Leetcode-Problems/tree/main/494-target-sum)     
[Knapsack with duplicate items](https://github.com/meetjain74/Leetcode-Problems/tree/main/Knapsack%20with%20Duplicate%20Items%20-%20GFG)   
[Rod cutting](https://github.com/meetjain74/Leetcode-Problems/tree/main/Rod%20Cutting%20-%20GFG)     
[Coin change 2: Max number of ways](https://github.com/meetjain74/Leetcode-Problems/tree/main/518-coin-change-2)    
[Coin change: Min number of coins](https://github.com/meetjain74/Leetcode-Problems/tree/main/322-coin-change)    
[Perfect squares](https://github.com/meetjain74/Leetcode-Problems/tree/main/279-perfect-squares)    
[Integer break](https://github.com/meetjain74/Leetcode-Problems/tree/main/343-integer-break)     
[Combination sum IV](https://github.com/meetjain74/Leetcode-Problems/tree/main/377-combination-sum-iv)    
[Minimum cost for tickets](https://github.com/meetjain74/Leetcode-Problems/tree/main/983-minimum-cost-for-tickets)    
[Ones and zeroes](https://github.com/meetjain74/Leetcode-Problems/tree/main/474-ones-and-zeroes)     
[Longest common subsequence and Print LCS](https://github.com/meetjain74/Leetcode-Problems/tree/main/1143-longest-common-subsequence)    
[Longest common substring](https://github.com/meetjain74/Leetcode-Problems/tree/main/Longest%20Common%20Substring%20-%20GFG)    
[Maximum length of repeated subarray](https://github.com/meetjain74/Leetcode-Problems/tree/main/718-maximum-length-of-repeated-subarray)    
[Length of longest subsequence of a string which is substring of another string](https://github.com/meetjain74/Leetcode-Problems/tree/main/Find%20length%20of%20longest%20subsequence%20-%20GFG)    
[Number of times a string occurs as subsequence in another string](https://github.com/meetjain74/Leetcode-Problems/tree/main/String%20Subsequence%20-%20GFG)   
[Shortest common supersequence](https://github.com/meetjain74/Leetcode-Problems/tree/main/Shortest%20Common%20Supersequence%20-%20GFG)     
[Print shortest common supersequence](https://github.com/meetjain74/Leetcode-Problems/tree/main/1092-shortest-common-supersequence)    
[Minimum number of deletions and insertions](https://github.com/meetjain74/Leetcode-Problems/tree/main/Minimum%20number%20of%20deletions%20and%20insertions.%20-%20GFG)   
[Delete operations for two strings](https://github.com/meetjain74/Leetcode-Problems/tree/main/583-delete-operation-for-two-strings)    
[Longest palindromic subsequence](https://github.com/meetjain74/Leetcode-Problems/tree/main/516-longest-palindromic-subsequence)    
[Longest repeating subsequence](https://github.com/meetjain74/Leetcode-Problems/tree/main/Longest%20Repeating%20Subsequence%20-%20GFG)    
[Minimum number of deletions to make a string palindrome](https://github.com/meetjain74/Leetcode-Problems/tree/main/Minimum%20number%20of%20deletions.%20-%20GFG)      
[Minimum number of insertions to make a string palindrome](https://github.com/meetjain74/Leetcode-Problems/tree/main/1312-minimum-insertion-steps-to-make-a-string-palindrome)    
[Count common subsequence in two strings (Need not necessarily be distinct)](https://www.geeksforgeeks.org/count-common-subsequence-in-two-strings/#:~:text=To%20find%20the%20number%20of,j%2D1%5D.)    
[Longest palindromic substring](https://github.com/meetjain74/Leetcode-Problems/tree/main/5-longest-palindromic-substring)  
[Count palindromic substrings](https://github.com/meetjain74/Leetcode-Problems/tree/main/647-palindromic-substrings)   
[Count palindromic subsequences](https://github.com/meetjain74/Leetcode-Problems/tree/main/Count%20Palindromic%20Subsequences%20-%20GFG)   
[Edit distance](https://github.com/meetjain74/Leetcode-Problems/tree/main/72-edit-distance)    
[Distinct subsequences](https://github.com/meetjain74/Leetcode-Problems/tree/main/115-distinct-subsequences)    
[Distinct subsequences II](https://github.com/meetjain74/Leetcode-Problems/tree/main/940-distinct-subsequences-ii)    
[Count different palindromic subsequences](https://github.com/meetjain74/Leetcode-Problems/tree/main/730-count-different-palindromic-subsequences)   
[Matrix chain multiplication](https://github.com/meetjain74/Leetcode-Problems/tree/main/Matrix%20Chain%20Multiplication%20-%20GFG)    
[Palindrome partitioning II](https://github.com/meetjain74/Leetcode-Problems/tree/main/132-palindrome-partitioning-ii)    
[Palindrome partitioning IV](https://github.com/meetjain74/Leetcode-Problems/tree/main/1745-palindrome-partitioning-iv)   
[Palindrome partitioning III](https://github.com/meetjain74/Leetcode-Problems/tree/main/1278-palindrome-partitioning-iii)    
[Partition array for maximum sum](https://github.com/meetjain74/Leetcode-Problems/tree/main/1043-partition-array-for-maximum-sum)   
[Boolean Parenthesization](https://github.com/meetjain74/Leetcode-Problems/tree/main/Boolean%20Parenthesization%20-%20GFG)     
[Scramble string](https://github.com/meetjain74/Leetcode-Problems/tree/main/87-scramble-string)   
[Super egg drop](https://github.com/meetjain74/Leetcode-Problems/tree/main/887-super-egg-drop)    
[Burst balloons](https://github.com/meetjain74/Leetcode-Problems/tree/main/312-burst-balloons)     
[Longest increasing subsequence](https://github.com/meetjain74/Leetcode-Problems/tree/main/300-longest-increasing-subsequence)    
[Number of longest increasing subsequence](https://github.com/meetjain74/Leetcode-Problems/tree/main/673-number-of-longest-increasing-subsequence)    
[Longest ideal subsequence](https://github.com/meetjain74/Leetcode-Problems/tree/main/2370-longest-ideal-subsequence)    
[Student attendance record II](https://github.com/meetjain74/Leetcode-Problems/tree/main/552-student-attendance-record-ii)    
[Word wrap](https://github.com/meetjain74/Leetcode-Problems/tree/main/Word%20Wrap%20-%20GFG)    
[Domino and tromino tiling](https://github.com/meetjain74/Leetcode-Problems/tree/main/790-domino-and-tromino-tiling)    
[Maximum earnings from taxi](https://github.com/meetjain74/Leetcode-Problems/tree/main/2008-maximum-earnings-from-taxi)

## Binary search

[Guess number higher or lower](https://github.com/meetjain74/Leetcode-Problems/tree/main/374-guess-number-higher-or-lower)  
[Search insert position](https://github.com/meetjain74/Leetcode-Problems/tree/main/35-search-insert-position)  
[Sqrt(x)](https://github.com/meetjain74/Leetcode-Problems/tree/main/69-sqrtx)   
[Peak index in a mountain array](https://github.com/meetjain74/Leetcode-Problems/tree/main/852-peak-index-in-a-mountain-array)   
[Find in mountain array](https://github.com/meetjain74/Leetcode-Problems/tree/main/1095-find-in-mountain-array)   
[Find first position and last position of element in sorted array](https://github.com/meetjain74/Leetcode-Problems/tree/main/34-find-first-and-last-position-of-element-in-sorted-array)  
[Count the number of occurences of an element in a sorted array](https://github.com/meetjain74/Leetcode-Problems/tree/main/Number%20of%20occurrence%20-%20GFG)  
[Find minimum in rotated sorted array / No of times a sorted array is rotated](https://github.com/meetjain74/Leetcode-Problems/tree/main/153-find-minimum-in-rotated-sorted-array)  
[Find minimum in rotated sorted array II](https://github.com/meetjain74/Leetcode-Problems/tree/main/154-find-minimum-in-rotated-sorted-array-ii)  
[Search in rotated sorted array](https://github.com/meetjain74/Leetcode-Problems/tree/main/33-search-in-rotated-sorted-array)   
[Kth missing positive number](https://github.com/meetjain74/Leetcode-Problems/tree/main/1539-kth-missing-positive-number)   
[Find peak element](https://github.com/meetjain74/Leetcode-Problems/tree/main/162-find-peak-element)  
[Median of two sorted arrays](https://github.com/meetjain74/Leetcode-Problems/tree/main/4-median-of-two-sorted-arrays)    
[Longest increasing subsequence](https://github.com/meetjain74/Leetcode-Problems/tree/main/300-longest-increasing-subsequence)    
[Successful pairs of spells and potions](https://github.com/meetjain74/Leetcode-Problems/tree/main/2300-successful-pairs-of-spells-and-potions)     
[Maximum profit in job scheduling](https://github.com/meetjain74/Leetcode-Problems/tree/main/1235-maximum-profit-in-job-scheduling)

## BFS and DFS

[Flood fill](https://github.com/meetjain74/Leetcode-Problems/tree/main/733-flood-fill)      
[Keys and rooms](https://github.com/meetjain74/Leetcode-Problems/tree/main/841-keys-and-rooms)    
[Path with maximum gold](https://github.com/meetjain74/Leetcode-Problems/tree/main/1219-path-with-maximum-gold)    
[Open the lock](https://github.com/meetjain74/Leetcode-Problems/tree/main/752-open-the-lock)   
[Steps by knight](https://github.com/meetjain74/Leetcode-Problems/tree/main/Steps%20by%20Knight%20-%20GFG)   
[Jump Game IV](https://github.com/meetjain74/Leetcode-Problems/tree/main/1345-jump-game-iv)    
[Jump Game V](https://github.com/meetjain74/Leetcode-Problems/tree/main/1340-jump-game-v)   
[Nearest exit from entrance in maze](https://github.com/meetjain74/Leetcode-Problems/tree/main/1926-nearest-exit-from-entrance-in-maze)   
[Shortest path in a grid with obstacles elimination](https://github.com/meetjain74/Leetcode-Problems/tree/main/1293-shortest-path-in-a-grid-with-obstacles-elimination)      
[Rotting oranges](https://github.com/meetjain74/Leetcode-Problems/tree/main/994-rotting-oranges)   
[Sequential digits](https://github.com/meetjain74/Leetcode-Problems/tree/main/1291-sequential-digits)    
[Surrounded regions](https://github.com/meetjain74/Leetcode-Problems/tree/main/130-surrounded-regions)    
[Word ladder](https://github.com/meetjain74/Leetcode-Problems/tree/main/127-word-ladder)    
[Longest increasing path in a matrix](https://github.com/meetjain74/Leetcode-Problems/tree/main/329-longest-increasing-path-in-a-matrix)    
[Out of boundary paths](https://github.com/meetjain74/Leetcode-Problems/tree/main/576-out-of-boundary-paths)   
[01 Matrix](https://github.com/meetjain74/Leetcode-Problems/tree/main/542-01-matrix)    
[Shortest bridge](https://github.com/meetjain74/Leetcode-Problems/tree/main/934-shortest-bridge)   
[Minesweeper](https://github.com/meetjain74/Leetcode-Problems/tree/main/529-minesweeper)    
[Race car](https://github.com/meetjain74/Leetcode-Problems/tree/main/818-race-car)   
[Minimum jumps to reach home](https://github.com/meetjain74/Leetcode-Problems/tree/main/1654-minimum-jumps-to-reach-home)

## Graphs

[Find the town judge](https://github.com/meetjain74/Leetcode-Problems/tree/main/997-find-the-town-judge)   
[Number of islands](https://github.com/meetjain74/Leetcode-Problems/tree/main/200-number-of-islands)   
[Time needed to inform all employees](https://github.com/meetjain74/Leetcode-Problems/tree/main/1376-time-needed-to-inform-all-employees)    
[Number of provinces](https://github.com/meetjain74/Leetcode-Problems/tree/main/547-number-of-provinces)   
[Number of operations to make network connected](https://github.com/meetjain74/Leetcode-Problems/tree/main/1319-number-of-operations-to-make-network-connected)    
[Detect cycle in an undirected graph](https://github.com/meetjain74/Leetcode-Problems/tree/main/Detect%20cycle%20in%20an%20undirected%20graph%20-%20GFG)       
[Detect cycles in 2d grid](https://github.com/meetjain74/Leetcode-Problems/tree/main/1559-detect-cycles-in-2d-grid)    
[Detect cycle in a directed graph](https://github.com/meetjain74/Leetcode-Problems/tree/main/Detect%20cycle%20in%20a%20directed%20graph%20-%20GFG)     
[Course schedule](https://github.com/meetjain74/Leetcode-Problems/tree/main/207-course-schedule)    
[Clone graph](https://github.com/meetjain74/Leetcode-Problems/tree/main/133-clone-graph)    
[Is graph bipartite](https://github.com/meetjain74/Leetcode-Problems/tree/main/785-is-graph-bipartite)    
[Topological sort](https://github.com/meetjain74/Leetcode-Problems/tree/main/Topological%20sort%20-%20GFG)    
[Minimum height trees](https://github.com/meetjain74/Leetcode-Problems/tree/main/310-minimum-height-trees)     
[Detonate the maximum bombs](https://github.com/meetjain74/Leetcode-Problems/tree/main/2101-detonate-the-maximum-bombs)    
[Find eventual safe states](https://github.com/meetjain74/Leetcode-Problems/tree/main/802-find-eventual-safe-states)    
[Sum of distances in tree](https://github.com/meetjain74/Leetcode-Problems/tree/main/834-sum-of-distances-in-tree)    
[Redundant connection](https://github.com/meetjain74/Leetcode-Problems/tree/main/684-redundant-connection)    
[Redundant connection II](https://github.com/meetjain74/Leetcode-Problems/tree/main/685-redundant-connection-ii)    
[Network delay time](https://github.com/meetjain74/Leetcode-Problems/tree/main/743-network-delay-time)    
[Path with maximum probability](https://github.com/meetjain74/Leetcode-Problems/tree/main/1514-path-with-maximum-probability)    
[Cheapest flight within k stops](https://github.com/meetjain74/Leetcode-Problems/tree/main/787-cheapest-flights-within-k-stops)    
[Evaluate division](https://github.com/meetjain74/Leetcode-Problems/tree/main/399-evaluate-division)     
[Path with minimum effort](https://github.com/meetjain74/Leetcode-Problems/tree/main/1631-path-with-minimum-effort)     
[Flower planting with no adjacent](https://github.com/meetjain74/Leetcode-Problems/tree/main/1042-flower-planting-with-no-adjacent)    
[Find the City With the Smallest Number of Neighbors at a Threshold Distance](https://github.com/meetjain74/Leetcode-Problems/tree/main/1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance)

## Greedy

[Fractional knapsack](https://github.com/meetjain74/Leetcode-Problems/tree/main/Fractional%20Knapsack%20-%20GFG)   
[Jump Game](https://github.com/meetjain74/Leetcode-Problems/tree/main/55-jump-game)    
[Jump Game II](https://github.com/meetjain74/Leetcode-Problems/tree/main/45-jump-game-ii)   
[Gas station](https://github.com/meetjain74/Leetcode-Problems/tree/main/134-gas-station)     
[Minimum number of taps to open to water a garden](https://github.com/meetjain74/Leetcode-Problems/tree/main/1326-minimum-number-of-taps-to-open-to-water-a-garden)   
[Minimum number of fibonacci numbers whose sum is k](https://github.com/meetjain74/Leetcode-Problems/tree/main/1414-find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k)     
[Candy](https://github.com/meetjain74/Leetcode-Problems/tree/main/135-candy)   
[Integer replacement](https://github.com/meetjain74/Leetcode-Problems/tree/main/397-integer-replacement)   
[Shortest unsorted continuous subarray](https://github.com/meetjain74/Leetcode-Problems/tree/main/581-shortest-unsorted-continuous-subarray)    
[Maximum number of events that can be attended](https://github.com/meetjain74/Leetcode-Problems/tree/main/1353-maximum-number-of-events-that-can-be-attended)

## Bit manipulation

[Single number](https://github.com/meetjain74/Leetcode-Problems/tree/main/136-single-number)   
[Single number II](https://github.com/meetjain74/Leetcode-Problems/tree/main/137-single-number-ii)  
[Single number III](https://github.com/meetjain74/Leetcode-Problems/tree/main/260-single-number-iii)    
[Counting bits](https://github.com/meetjain74/Leetcode-Problems/tree/main/338-counting-bits)  
[Subsets](https://github.com/meetjain74/Leetcode-Problems/tree/main/78-subsets)  
[Divide two integers](https://github.com/meetjain74/Leetcode-Problems/tree/main/29-divide-two-integers)  
[Reverse bits](https://github.com/meetjain74/Leetcode-Problems/blob/main/190-reverse-bits/190-reverse-bits.java)  
[Bitwise AND of Numbers Range](https://github.com/meetjain74/Leetcode-Problems/tree/main/201-bitwise-and-of-numbers-range)   
[Maximum XOR of two numbers in an array](https://github.com/meetjain74/Leetcode-Problems/tree/main/421-maximum-xor-of-two-numbers-in-an-array)   
[Super Pow](https://github.com/meetjain74/Leetcode-Problems/tree/main/372-super-pow)

## Matrix

[Rotate image](https://github.com/meetjain74/Leetcode-Problems/tree/main/48-rotate-image)  
[Spiral matrix](https://github.com/meetjain74/Leetcode-Problems/tree/main/54-spiral-matrix)  
[Spiral matrix II](https://github.com/meetjain74/Leetcode-Problems/tree/main/59-spiral-matrix-ii)    
[Diagonal traverse](https://github.com/meetjain74/Leetcode-Problems/tree/main/498-diagonal-traverse)  
[Search a 2d matrix](https://github.com/meetjain74/Leetcode-Problems/tree/main/74-search-a-2d-matrix)  
[Search in a 2d matrix II](https://github.com/meetjain74/Leetcode-Problems/tree/main/240-search-a-2d-matrix-ii)  
[Kth smallest element in a sorted matrix](https://github.com/meetjain74/Leetcode-Problems/tree/main/378-kth-smallest-element-in-a-sorted-matrix)  
[Maximum sum rectangle in a 2d matrix](https://github.com/meetjain74/Leetcode-Problems/tree/main/Maximum%20Sum%20Rectangle%20-%20GFG)   
[Largest rectangular submatrix with sum 0](https://github.com/meetjain74/Leetcode-Problems/tree/main/Largest%20rectangular%20sub-matrix%20whose%20sum%20is%200%20-%20GFG)    
[Image overlap](https://github.com/meetjain74/Leetcode-Problems/tree/main/835-image-overlap)    
  
## Buy and sell stock Problems

[Buy and sell stock with one transaction allowed](https://github.com/meetjain74/Leetcode-Problems/tree/main/121-best-time-to-buy-and-sell-stock)   
[Buy and sell stock with infinite transactions allowed](https://github.com/meetjain74/Leetcode-Problems/tree/main/122-best-time-to-buy-and-sell-stock-ii)  
[Buy and sell stock with infinite transactions and transaction fee](https://github.com/meetjain74/Leetcode-Problems/tree/main/714-best-time-to-buy-and-sell-stock-with-transaction-fee)   
[Buy and sell stock with infinite transactions and cooldown](https://github.com/meetjain74/Leetcode-Problems/tree/main/309-best-time-to-buy-and-sell-stock-with-cooldown)   
[Buy and sell stock with two transactions allowed](https://github.com/meetjain74/Leetcode-Problems/tree/main/123-best-time-to-buy-and-sell-stock-iii)   
[Buy and sell stock with k transactions allowed](https://github.com/meetjain74/Leetcode-Problems/tree/main/188-best-time-to-buy-and-sell-stock-iv)

## Interval questions

[Merge intervals](https://github.com/meetjain74/Leetcode-Problems/tree/main/56-merge-intervals)   
[Insert interval](https://github.com/meetjain74/Leetcode-Problems/tree/main/57-insert-interval)    
[Count integers in intervals](https://github.com/meetjain74/Leetcode-Problems/tree/main/2276-count-integers-in-intervals)    
[Maximum length of pair chain](https://github.com/meetjain74/Leetcode-Problems/tree/main/646-maximum-length-of-pair-chain)    
[Non overlapping intervals](https://github.com/meetjain74/Leetcode-Problems/tree/main/435-non-overlapping-intervals)   
[Minimum number of arrows to burst balloons](https://github.com/meetjain74/Leetcode-Problems/tree/main/452-minimum-number-of-arrows-to-burst-balloons)   
[Interval list intersections](https://github.com/meetjain74/Leetcode-Problems/tree/main/986-interval-list-intersections)     
[My Calendar I](https://github.com/meetjain74/Leetcode-Problems/tree/main/729-my-calendar-i)

## Standard problems

[Container with most water](https://github.com/meetjain74/Leetcode-Problems/tree/main/11-container-with-most-water)  
[Car pooling](https://github.com/meetjain74/Leetcode-Problems/tree/main/1094-car-pooling)    
[Number of minimum picks to get 'k' pairs of socks from a drawer](https://github.com/meetjain74/Leetcode-Problems/tree/main/Number%20of%20minimum%20picks%20to%20get%20'k'%20pairs%20of%20socks%20from%20a%20drawer%20-%20GFG)    
[Next permutation](https://github.com/meetjain74/Leetcode-Problems/tree/main/31-next-permutation)  
[Majority element](https://github.com/meetjain74/Leetcode-Problems/tree/main/169-majority-element)  
[Majority element II](https://github.com/meetjain74/Leetcode-Problems/tree/main/229-majority-element-ii)  
[Subarray sum equals k](https://github.com/meetjain74/Leetcode-Problems/tree/main/560-subarray-sum-equals-k)   
[Median of two sorted arrays](https://github.com/meetjain74/Leetcode-Problems/tree/main/4-median-of-two-sorted-arrays)    
[Largest number](https://github.com/meetjain74/Leetcode-Problems/tree/main/179-largest-number)    
[Trapping rainwater](https://github.com/meetjain74/Leetcode-Problems/tree/main/42-trapping-rain-water)  
[Largest Rectangle in Histogram](https://github.com/meetjain74/Leetcode-Problems/tree/main/84-largest-rectangle-in-histogram)  
[Koko eating bananas](https://github.com/meetjain74/Leetcode-Problems/tree/main/875-koko-eating-bananas)  
[Find all duplicates in an array](https://github.com/meetjain74/Leetcode-Problems/tree/main/442-find-all-duplicates-in-an-array)  
[The celebrity problem](https://github.com/meetjain74/Leetcode-Problems/tree/main/The%20Celebrity%20Problem%20-%20GFG)  
[Triangle](https://github.com/meetjain74/Leetcode-Problems/tree/main/120-triangle)   
[Josephus problem](https://github.com/meetjain74/Leetcode-Problems/tree/main/1823-find-the-winner-of-the-circular-game)   
[Push dominoes](https://github.com/meetjain74/Leetcode-Problems/tree/main/838-push-dominoes)    
[Flatten binary tree to linked list](https://github.com/meetjain74/Leetcode-Problems/tree/main/114-flatten-binary-tree-to-linked-list)   
[Longest increasing subsequence](https://github.com/meetjain74/Leetcode-Problems/tree/main/300-longest-increasing-subsequence)    
[Longest consecutive subsequence](https://github.com/meetjain74/Leetcode-Problems/tree/main/128-longest-consecutive-sequence)    
[Water and jug problem](https://github.com/meetjain74/Leetcode-Problems/tree/main/365-water-and-jug-problem)    
[Maximum product subarray](https://github.com/meetjain74/Leetcode-Problems/tree/main/152-maximum-product-subarray)   
[Minimum number of removals to make mountain array](https://github.com/meetjain74/Leetcode-Problems/tree/main/1671-minimum-number-of-removals-to-make-mountain-array)

## Extras

[Integer to roman](https://github.com/meetjain74/Leetcode-Problems/tree/main/12-integer-to-roman)   
[Roman to integer](https://github.com/meetjain74/Leetcode-Problems/tree/main/13-roman-to-integer)    
[Possible groups](https://github.com/meetjain74/Leetcode-Problems/tree/main/Possible%20groups%20-%20GFG)    
[Count numbers with unique digits](https://github.com/meetjain74/Leetcode-Problems/tree/main/357-count-numbers-with-unique-digits)   
[Word subsets](https://github.com/meetjain74/Leetcode-Problems/tree/main/916-word-subsets)    
[Remove palindromic subsequences](https://github.com/meetjain74/Leetcode-Problems/tree/main/1332-remove-palindromic-subsequences)  
[Longest substring without repeating characters](https://github.com/meetjain74/Leetcode-Problems/tree/main/3-longest-substring-without-repeating-characters)   
[Longest subarray with sum K](https://github.com/meetjain74/Leetcode-Problems/tree/main/Longest%20Sub-Array%20with%20Sum%20K%20-%20GFG)  
[Minimum operations to reduce X to zero](https://github.com/meetjain74/Leetcode-Problems/tree/main/1658-minimum-operations-to-reduce-x-to-zero)  
[Capacity to ship packages within d days](https://github.com/meetjain74/Leetcode-Problems/tree/main/1011-capacity-to-ship-packages-within-d-days)  
[Find minimum time to finish all jobs](https://github.com/meetjain74/Leetcode-Problems/tree/main/1723-find-minimum-time-to-finish-all-jobs)  
[Minimum moves to equal array elements](https://github.com/meetjain74/Leetcode-Problems/tree/main/453-minimum-moves-to-equal-array-elements)   
[Subarray product less than K](https://github.com/meetjain74/Leetcode-Problems/tree/main/713-subarray-product-less-than-k)   
[Subarray sum divisible by K](https://github.com/meetjain74/Leetcode-Problems/tree/main/974-subarray-sums-divisible-by-k)   
[Minimum number of flips to make binary string alternating](https://github.com/meetjain74/Leetcode-Problems/tree/main/1888-minimum-number-of-flips-to-make-the-binary-string-alternating)   
[Minimum number of swaps to make the string balanced](https://github.com/meetjain74/Leetcode-Problems/tree/main/1963-minimum-number-of-swaps-to-make-the-string-balanced)   
[Count array pairs divisible by k](https://github.com/meetjain74/Leetcode-Problems/tree/main/2183-count-array-pairs-divisible-by-k)     
[Mirror reflection](https://github.com/meetjain74/Leetcode-Problems/tree/main/858-mirror-reflection)

## Group of Questions

### Subarray sum

Subarray sum equals K  
Maximum sum subarray of size K  
Longest subarray with sum K with array containing only positive numbers    
Longest subarray with sum K with array containing both positive and negative numbers   
Maximum sum subarray in an array   
Maximum sum circular subarray    
Subarray product less than K    
Subarray sum divisible by K   
Count array pairs whose sum is divisible by K   
Count array pairs whose product is divisible by K    
Maximum product subarray

### Traversals and view of Binary Tree

Inorder traversal  
Preorder traversal  
Postorder traversal  
Level order traversal  
Spiral traversal  
Left view of Binary tree  
Right view of Binary tree   
Top view of Binary tree  
Bottom view of Binary tree  
Boundary traversal of Binary tree  
Vertical order traversal of a Binary tree  
Diagonal traversal of a Binary tree

Leetcode-Problems

Leetcode-Problems 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

Leetcode-Problems

Leetcode-Problems 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

Download README