LeetCode_adprem

Collection of LeetCode questions to ace the coding interview! - Created using LeetHub v3

LeetCode Topics

Array

Problem Name	Difficulty
1536-minimum-swaps-to-arrange-a-binary-grid	Medium

Greedy

Problem Name	Difficulty
1536-minimum-swaps-to-arrange-a-binary-grid	Medium

Matrix

Problem Name	Difficulty
1536-minimum-swaps-to-arrange-a-binary-grid	Medium

String

Problem Name	Difficulty
1545-find-kth-bit-in-nth-binary-string	Medium

Recursion

Problem Name	Difficulty
1545-find-kth-bit-in-nth-binary-string	Medium

Simulation

Problem Name	Difficulty
1545-find-kth-bit-in-nth-binary-string	Medium

Name		Name	Last commit message	Last commit date
Latest commit History 1,188 Commits
0001-two-sum		0001-two-sum
0003-longest-substring-without-repeating-characters		0003-longest-substring-without-repeating-characters
0008-string-to-integer-atoi		0008-string-to-integer-atoi
0009-palindrome-number		0009-palindrome-number
0011-container-with-most-water		0011-container-with-most-water
0012-integer-to-roman		0012-integer-to-roman
0013-roman-to-integer		0013-roman-to-integer
0014-longest-common-prefix		0014-longest-common-prefix
0016-3sum-closest		0016-3sum-closest
0018-4sum		0018-4sum
0019-remove-nth-node-from-end-of-list		0019-remove-nth-node-from-end-of-list
0020-valid-parentheses		0020-valid-parentheses
0021-merge-two-sorted-lists		0021-merge-two-sorted-lists
0022-generate-parentheses		0022-generate-parentheses
0024-swap-nodes-in-pairs		0024-swap-nodes-in-pairs
0026-remove-duplicates-from-sorted-array		0026-remove-duplicates-from-sorted-array
0027-remove-element		0027-remove-element
0028-find-the-index-of-the-first-occurrence-in-a-string		0028-find-the-index-of-the-first-occurrence-in-a-string
0029-divide-two-integers		0029-divide-two-integers
0031-next-permutation		0031-next-permutation
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
0039-combination-sum		0039-combination-sum
0042-trapping-rain-water		0042-trapping-rain-water
0044-wildcard-matching		0044-wildcard-matching
0045-jump-game-ii		0045-jump-game-ii
0046-permutations		0046-permutations
0047-permutations-ii		0047-permutations-ii
0048-rotate-image		0048-rotate-image
0049-group-anagrams		0049-group-anagrams
0050-powx-n		0050-powx-n
0051-n-queens		0051-n-queens
0053-maximum-subarray		0053-maximum-subarray
0054-spiral-matrix		0054-spiral-matrix
0055-jump-game		0055-jump-game
0056-merge-intervals		0056-merge-intervals
0057-insert-interval		0057-insert-interval
0062-unique-paths		0062-unique-paths
0063-unique-paths-ii		0063-unique-paths-ii
0064-minimum-path-sum		0064-minimum-path-sum
0070-climbing-stairs		0070-climbing-stairs
0072-edit-distance		0072-edit-distance
0074-search-a-2d-matrix		0074-search-a-2d-matrix
0075-sort-colors		0075-sort-colors
0077-combinations		0077-combinations
0078-subsets		0078-subsets
0079-word-search		0079-word-search
0080-remove-duplicates-from-sorted-array-ii		0080-remove-duplicates-from-sorted-array-ii
0081-search-in-rotated-sorted-array-ii		0081-search-in-rotated-sorted-array-ii
0085-maximal-rectangle		0085-maximal-rectangle
0090-subsets-ii		0090-subsets-ii
0094-binary-tree-inorder-traversal		0094-binary-tree-inorder-traversal
0096-unique-binary-search-trees		0096-unique-binary-search-trees
0099-recover-binary-search-tree		0099-recover-binary-search-tree
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
0105-construct-binary-tree-from-preorder-and-inorder-traversal		0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal		0106-construct-binary-tree-from-inorder-and-postorder-traversal
0108-convert-sorted-array-to-binary-search-tree		0108-convert-sorted-array-to-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree		0109-convert-sorted-list-to-binary-search-tree
0111-minimum-depth-of-binary-tree		0111-minimum-depth-of-binary-tree
0112-path-sum		0112-path-sum
0113-path-sum-ii		0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list		0114-flatten-binary-tree-to-linked-list
0115-distinct-subsequences		0115-distinct-subsequences
0116-populating-next-right-pointers-in-each-node		0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii		0117-populating-next-right-pointers-in-each-node-ii
0120-triangle		0120-triangle
0121-best-time-to-buy-and-sell-stock		0121-best-time-to-buy-and-sell-stock
0122-best-time-to-buy-and-sell-stock-ii		0122-best-time-to-buy-and-sell-stock-ii
0123-best-time-to-buy-and-sell-stock-iii		0123-best-time-to-buy-and-sell-stock-iii
0124-binary-tree-maximum-path-sum		0124-binary-tree-maximum-path-sum
0126-word-ladder-ii		0126-word-ladder-ii
0127-word-ladder		0127-word-ladder
0129-sum-root-to-leaf-numbers		0129-sum-root-to-leaf-numbers
0130-surrounded-regions		0130-surrounded-regions
0134-gas-station		0134-gas-station
0135-candy		0135-candy
0136-single-number		0136-single-number
0141-linked-list-cycle		0141-linked-list-cycle
0142-linked-list-cycle-ii		0142-linked-list-cycle-ii
0144-binary-tree-preorder-traversal		0144-binary-tree-preorder-traversal
0148-sort-list		0148-sort-list
0151-reverse-words-in-a-string		0151-reverse-words-in-a-string
0153-find-minimum-in-rotated-sorted-array		0153-find-minimum-in-rotated-sorted-array
0155-min-stack		0155-min-stack
0160-intersection-of-two-linked-lists		0160-intersection-of-two-linked-lists
0162-find-peak-element		0162-find-peak-element
0165-compare-version-numbers		0165-compare-version-numbers
0166-fraction-to-recurring-decimal		0166-fraction-to-recurring-decimal
0167-two-sum-ii-input-array-is-sorted		0167-two-sum-ii-input-array-is-sorted
0169-majority-element		0169-majority-element
0173-binary-search-tree-iterator		0173-binary-search-tree-iterator
0188-best-time-to-buy-and-sell-stock-iv		0188-best-time-to-buy-and-sell-stock-iv
0189-rotate-array		0189-rotate-array
0191-number-of-1-bits		0191-number-of-1-bits

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

LeetCode_adprem

LeetCode Topics

Array

Greedy

Matrix

String

Recursion

Simulation

About

Uh oh!

Releases

Packages

Uh oh!

Contributors

Uh oh!

Languages

Folders and files

Latest commit

History

Repository files navigation

LeetCode_adprem

LeetCode Topics

Array

Greedy

Matrix

String

Recursion

Simulation

About

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Uh oh!

Contributors

Uh oh!

Languages

Packages