GitHub - MARTIANSID/LintCode: Good Collection of DSA questions to ace interviews

MARTIANSID / LintCode Public

Notifications You must be signed in to change notification settings
Fork 1
Star 4

Good Collection of DSA questions to ace interviews

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 3,325 Commits
.cph		.cph
.vscode		.vscode
0017-letter-combinations-of-a-phone-number		0017-letter-combinations-of-a-phone-number
0019-remove-nth-node-from-end-of-list		0019-remove-nth-node-from-end-of-list
0022-generate-parentheses		0022-generate-parentheses
0027-remove-element		0027-remove-element
0046-permutations		0046-permutations
0048-rotate-image		0048-rotate-image
0055-jump-game		0055-jump-game
0057-insert-interval		0057-insert-interval
0062-unique-paths		0062-unique-paths
0070-climbing-stairs		0070-climbing-stairs
0088-merge-sorted-array		0088-merge-sorted-array
0093-restore-ip-addresses		0093-restore-ip-addresses
0100-same-tree		0100-same-tree
0101-symmetric-tree		0101-symmetric-tree
0104-maximum-depth-of-binary-tree		0104-maximum-depth-of-binary-tree
0111-minimum-depth-of-binary-tree		0111-minimum-depth-of-binary-tree
0121-best-time-to-buy-and-sell-stock		0121-best-time-to-buy-and-sell-stock
0131-palindrome-partitioning		0131-palindrome-partitioning
0134-gas-station		0134-gas-station
0139-word-break		0139-word-break
0141-linked-list-cycle		0141-linked-list-cycle
0144-binary-tree-preorder-traversal		0144-binary-tree-preorder-traversal
0149-max-points-on-a-line		0149-max-points-on-a-line
0150-evaluate-reverse-polish-notation		0150-evaluate-reverse-polish-notation
0165-compare-version-numbers		0165-compare-version-numbers
0179-largest-number		0179-largest-number
0209-minimum-size-subarray-sum		0209-minimum-size-subarray-sum
0226-invert-binary-tree		0226-invert-binary-tree
0228-summary-ranges		0228-summary-ranges
0238-product-of-array-except-self		0238-product-of-array-except-self
0274-h-index		0274-h-index
0275-h-index-ii		0275-h-index-ii
0284-peeking-iterator		0284-peeking-iterator
0290-word-pattern		0290-word-pattern
0300-longest-increasing-subsequence		0300-longest-increasing-subsequence
0337-house-robber-iii		0337-house-robber-iii
0338-counting-bits		0338-counting-bits
0349-intersection-of-two-arrays		0349-intersection-of-two-arrays
0352-data-stream-as-disjoint-intervals		0352-data-stream-as-disjoint-intervals
0380-insert-delete-getrandom-o1		0380-insert-delete-getrandom-o1
0389-find-the-difference		0389-find-the-difference
0443-string-compression		0443-string-compression
0452-minimum-number-of-arrows-to-burst-balloons		0452-minimum-number-of-arrows-to-burst-balloons
0455-assign-cookies		0455-assign-cookies
0460-lfu-cache		0460-lfu-cache
0467-unique-substrings-in-wraparound-string		0467-unique-substrings-in-wraparound-string
0472-concatenated-words		0472-concatenated-words
0491-non-decreasing-subsequences		0491-non-decreasing-subsequences
0496-next-greater-element-i		0496-next-greater-element-i
0502-ipo		0502-ipo
0514-freedom-trail		0514-freedom-trail
0520-detect-capital		0520-detect-capital
0525-contiguous-array		0525-contiguous-array
0526-beautiful-arrangement		0526-beautiful-arrangement
0530-minimum-absolute-difference-in-bst		0530-minimum-absolute-difference-in-bst
0547-number-of-provinces		0547-number-of-provinces
0567-permutation-in-string		0567-permutation-in-string
0576-out-of-boundary-paths		0576-out-of-boundary-paths
0621-task-scheduler		0621-task-scheduler
0636-exclusive-time-of-functions		0636-exclusive-time-of-functions
0641-design-circular-deque		0641-design-circular-deque
0648-replace-words		0648-replace-words
0667-beautiful-arrangement-ii		0667-beautiful-arrangement-ii
0715-range-module		0715-range-module
0743-network-delay-time		0743-network-delay-time
0744-find-smallest-letter-greater-than-target		0744-find-smallest-letter-greater-than-target
0783-minimum-distance-between-bst-nodes		0783-minimum-distance-between-bst-nodes
0787-cheapest-flights-within-k-stops		0787-cheapest-flights-within-k-stops
0802-find-eventual-safe-states		0802-find-eventual-safe-states
0855-exam-room		0855-exam-room
0863-all-nodes-distance-k-in-binary-tree		0863-all-nodes-distance-k-in-binary-tree
0872-leaf-similar-trees		0872-leaf-similar-trees
0876-middle-of-the-linked-list		0876-middle-of-the-linked-list
0909-snakes-and-ladders		0909-snakes-and-ladders
0912-sort-an-array		0912-sort-an-array
0918-maximum-sum-circular-subarray		0918-maximum-sum-circular-subarray
0926-flip-string-to-monotone-increasing		0926-flip-string-to-monotone-increasing
0938-range-sum-of-bst		0938-range-sum-of-bst
0944-delete-columns-to-make-sorted		0944-delete-columns-to-make-sorted
0945-minimum-increment-to-make-array-unique		0945-minimum-increment-to-make-array-unique
0948-bag-of-tokens		0948-bag-of-tokens
0953-verifying-an-alien-dictionary		0953-verifying-an-alien-dictionary
0956-tallest-billboard		0956-tallest-billboard
0974-subarray-sums-divisible-by-k		0974-subarray-sums-divisible-by-k
0977-squares-of-a-sorted-array		0977-squares-of-a-sorted-array
0992-subarrays-with-k-different-integers		0992-subarrays-with-k-different-integers
0997-find-the-town-judge		0997-find-the-town-judge
1024-video-stitching		1024-video-stitching
1026-maximum-difference-between-node-and-ancestor		1026-maximum-difference-between-node-and-ancestor
1027-longest-arithmetic-subsequence		1027-longest-arithmetic-subsequence
1029-two-city-scheduling		1029-two-city-scheduling
1042-flower-planting-with-no-adjacent		1042-flower-planting-with-no-adjacent
1044-longest-duplicate-substring		1044-longest-duplicate-substring
1046-last-stone-weight		1046-last-stone-weight
1050-actors-and-directors-who-cooperated-at-least-three-times		1050-actors-and-directors-who-cooperated-at-least-three-times
1061-lexicographically-smallest-equivalent-string		1061-lexicographically-smallest-equivalent-string
1079-letter-tile-possibilities		1079-letter-tile-possibilities
1080-insufficient-nodes-in-root-to-leaf-paths		1080-insufficient-nodes-in-root-to-leaf-paths