GitHub - RISHI2303/Leetcode-and-GFG-Questions: Collection of LeetCode questions to ace the coding interview!

RISHI2303 / Leetcode-and-GFG-Questions Public

Notifications You must be signed in to change notification settings
Fork 0
Star 2

Collection of LeetCode questions to ace the coding interview!

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 3,592 Commits
Sorry, we had to truncate this directory to 1,000 files. 220 entries were omitted from the list.
0001-two-sum		0001-two-sum
0004-median-of-two-sorted-arrays		0004-median-of-two-sorted-arrays
0005-longest-palindromic-substring		0005-longest-palindromic-substring
0006-zigzag-conversion		0006-zigzag-conversion
0011-container-with-most-water		0011-container-with-most-water
0012-integer-to-roman		0012-integer-to-roman
0017-letter-combinations-of-a-phone-number		0017-letter-combinations-of-a-phone-number
0020-valid-parentheses		0020-valid-parentheses
0023-merge-k-sorted-lists		0023-merge-k-sorted-lists
0024-swap-nodes-in-pairs		0024-swap-nodes-in-pairs
0026-remove-duplicates-from-sorted-array		0026-remove-duplicates-from-sorted-array
0028-find-the-index-of-the-first-occurrence-in-a-string		0028-find-the-index-of-the-first-occurrence-in-a-string
0033-search-in-rotated-sorted-array		0033-search-in-rotated-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array		0034-find-first-and-last-position-of-element-in-sorted-array
0035-search-insert-position		0035-search-insert-position
0036-valid-sudoku		0036-valid-sudoku
0037-sudoku-solver		0037-sudoku-solver
0038-count-and-say		0038-count-and-say
0040-combination-sum-ii		0040-combination-sum-ii
0041-first-missing-positive		0041-first-missing-positive
0042-trapping-rain-water		0042-trapping-rain-water
0045-jump-game-ii		0045-jump-game-ii
0046-permutations		0046-permutations
0049-group-anagrams		0049-group-anagrams
0050-powx-n		0050-powx-n
0054-spiral-matrix		0054-spiral-matrix
0055-jump-game		0055-jump-game
0057-insert-interval		0057-insert-interval
0058-length-of-last-word		0058-length-of-last-word
0059-spiral-matrix-ii		0059-spiral-matrix-ii
0062-unique-paths		0062-unique-paths
0064-minimum-path-sum		0064-minimum-path-sum
0066-plus-one		0066-plus-one
0067-add-binary		0067-add-binary
0070-climbing-stairs		0070-climbing-stairs
0071-simplify-path		0071-simplify-path
0072-edit-distance		0072-edit-distance
0073-set-matrix-zeroes		0073-set-matrix-zeroes
0074-search-a-2d-matrix		0074-search-a-2d-matrix
0075-sort-colors		0075-sort-colors
0076-minimum-window-substring		0076-minimum-window-substring
0077-combinations		0077-combinations
0078-subsets		0078-subsets
0079-word-search		0079-word-search
0081-search-in-rotated-sorted-array-ii		0081-search-in-rotated-sorted-array-ii
0085-maximal-rectangle		0085-maximal-rectangle
0086-partition-list		0086-partition-list
0087-scramble-string		0087-scramble-string
0091-decode-ways		0091-decode-ways
0092-reverse-linked-list-ii		0092-reverse-linked-list-ii
0093-restore-ip-addresses		0093-restore-ip-addresses
0094-binary-tree-inorder-traversal		0094-binary-tree-inorder-traversal
0095-unique-binary-search-trees-ii		0095-unique-binary-search-trees-ii
0100-same-tree		0100-same-tree
0101-symmetric-tree		0101-symmetric-tree
0103-binary-tree-zigzag-level-order-traversal		0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree		0104-maximum-depth-of-binary-tree
0106-construct-binary-tree-from-inorder-and-postorder-traversal		0106-construct-binary-tree-from-inorder-and-postorder-traversal
0109-convert-sorted-list-to-binary-search-tree		0109-convert-sorted-list-to-binary-search-tree
0110-balanced-binary-tree		0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree		0111-minimum-depth-of-binary-tree
0118-pascals-triangle		0118-pascals-triangle
0119-pascals-triangle-ii		0119-pascals-triangle-ii
0120-triangle		0120-triangle
0121-best-time-to-buy-and-sell-stock		0121-best-time-to-buy-and-sell-stock
0124-binary-tree-maximum-path-sum		0124-binary-tree-maximum-path-sum
0129-sum-root-to-leaf-numbers		0129-sum-root-to-leaf-numbers
0131-palindrome-partitioning		0131-palindrome-partitioning
0133-clone-graph		0133-clone-graph
0134-gas-station		0134-gas-station
0135-candy		0135-candy
0137-single-number-ii		0137-single-number-ii
0139-word-break		0139-word-break
0140-word-break-ii		0140-word-break-ii
0141-linked-list-cycle		0141-linked-list-cycle
0142-linked-list-cycle-ii		0142-linked-list-cycle-ii
0143-reorder-list		0143-reorder-list
0144-binary-tree-preorder-traversal		0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal		0145-binary-tree-postorder-traversal
0146-lru-cache		0146-lru-cache
0149-max-points-on-a-line		0149-max-points-on-a-line
0150-evaluate-reverse-polish-notation		0150-evaluate-reverse-polish-notation
0151-reverse-words-in-a-string		0151-reverse-words-in-a-string
0165-compare-version-numbers		0165-compare-version-numbers
0169-majority-element		0169-majority-element
0179-largest-number		0179-largest-number
0191-number-of-1-bits		0191-number-of-1-bits
0198-house-robber		0198-house-robber
0200-number-of-islands		0200-number-of-islands
0201-bitwise-and-of-numbers-range		0201-bitwise-and-of-numbers-range
0205-isomorphic-strings		0205-isomorphic-strings
0206-reverse-linked-list		0206-reverse-linked-list
0207-course-schedule		0207-course-schedule
0208-implement-trie-prefix-tree		0208-implement-trie-prefix-tree
0209-minimum-size-subarray-sum		0209-minimum-size-subarray-sum
0211-design-add-and-search-words-data-structure		0211-design-add-and-search-words-data-structure
0212-word-search-ii		0212-word-search-ii
0214-shortest-palindrome		0214-shortest-palindrome
0215-kth-largest-element-in-an-array		0215-kth-largest-element-in-an-array
0219-contains-duplicate-ii		0219-contains-duplicate-ii