InterviewPrep

Python solutions for the LeetCode problems https://leetcode.com/suryatej9195/

June 2022 Progress

May 2022 Progress

April 2022 Progress

March 2022 Progress

Feb 2022 Progress

June 2021 Progress

May 2021 Progress

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

InterviewPrep

About

Releases

Packages

Languages

Name		Name	Last commit message	Last commit date
Latest commit History 897 Commits
100-same-tree		100-same-tree
1011-capacity-to-ship-packages-within-d-days		1011-capacity-to-ship-packages-within-d-days
1029-two-city-scheduling		1029-two-city-scheduling
1036-escape-a-large-maze		1036-escape-a-large-maze
1037-valid-boomerang		1037-valid-boomerang
104-maximum-depth-of-binary-tree		104-maximum-depth-of-binary-tree
1048-longest-string-chain		1048-longest-string-chain
1073-adding-two-negabinary-numbers		1073-adding-two-negabinary-numbers
1074-number-of-submatrices-that-sum-to-target		1074-number-of-submatrices-that-sum-to-target
1091-shortest-path-in-binary-matrix		1091-shortest-path-in-binary-matrix
113-path-sum-ii		113-path-sum-ii
1130-minimum-cost-tree-from-leaf-values		1130-minimum-cost-tree-from-leaf-values
115-distinct-subsequences		115-distinct-subsequences
1155-number-of-dice-rolls-with-target-sum		1155-number-of-dice-rolls-with-target-sum
1160-find-words-that-can-be-formed-by-characters		1160-find-words-that-can-be-formed-by-characters
1192-critical-connections-in-a-network		1192-critical-connections-in-a-network
120-triangle		120-triangle
1202-smallest-string-with-swaps		1202-smallest-string-with-swaps
1209-remove-all-adjacent-duplicates-in-string-ii		1209-remove-all-adjacent-duplicates-in-string-ii
121-best-time-to-buy-and-sell-stock		121-best-time-to-buy-and-sell-stock
123-best-time-to-buy-and-sell-stock-iii		123-best-time-to-buy-and-sell-stock-iii
1239-maximum-length-of-a-concatenated-string-with-unique-characters		1239-maximum-length-of-a-concatenated-string-with-unique-characters
1260-shift-2d-grid		1260-shift-2d-grid
128-longest-consecutive-sequence		128-longest-consecutive-sequence
1293-shortest-path-in-a-grid-with-obstacles-elimination		1293-shortest-path-in-a-grid-with-obstacles-elimination
130-surrounded-regions		130-surrounded-regions
1304-find-n-unique-integers-sum-up-to-zero		1304-find-n-unique-integers-sum-up-to-zero
1323-maximum-69-number		1323-maximum-69-number
1328-break-a-palindrome		1328-break-a-palindrome
1329-sort-the-matrix-diagonally		1329-sort-the-matrix-diagonally
1332-remove-palindromic-subsequences		1332-remove-palindromic-subsequences
1347-minimum-number-of-steps-to-make-two-strings-anagram		1347-minimum-number-of-steps-to-make-two-strings-anagram
137-single-number-ii		137-single-number-ii
1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree		1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree
1383-maximum-performance-of-a-team		1383-maximum-performance-of-a-team
1396-design-underground-system		1396-design-underground-system
1448-count-good-nodes-in-binary-tree		1448-count-good-nodes-in-binary-tree
1457-pseudo-palindromic-paths-in-a-binary-tree		1457-pseudo-palindromic-paths-in-a-binary-tree
1461-check-if-a-string-contains-all-binary-codes-of-size-k		1461-check-if-a-string-contains-all-binary-codes-of-size-k
1472-design-browser-history		1472-design-browser-history
1480-running-sum-of-1d-array		1480-running-sum-of-1d-array
150-evaluate-reverse-polish-notation		150-evaluate-reverse-polish-notation
1531-string-compression-ii		1531-string-compression-ii
1557-minimum-number-of-vertices-to-reach-all-nodes		1557-minimum-number-of-vertices-to-reach-all-nodes
1573-number-of-ways-to-split-a-string		1573-number-of-ways-to-split-a-string
1578-minimum-time-to-make-rope-colorful		1578-minimum-time-to-make-rope-colorful
1584-min-cost-to-connect-all-points		1584-min-cost-to-connect-all-points
1604-alert-using-same-key-card-three-or-more-times-in-a-one-hour-period		1604-alert-using-same-key-card-three-or-more-times-in-a-one-hour-period
1631-path-with-minimum-effort		1631-path-with-minimum-effort
1641-count-sorted-vowel-strings		1641-count-sorted-vowel-strings
1642-furthest-building-you-can-reach		1642-furthest-building-you-can-reach
1647-minimum-deletions-to-make-character-frequencies-unique		1647-minimum-deletions-to-make-character-frequencies-unique
1656-design-an-ordered-stream		1656-design-an-ordered-stream
1658-minimum-operations-to-reduce-x-to-zero		1658-minimum-operations-to-reduce-x-to-zero
167-two-sum-ii-input-array-is-sorted		167-two-sum-ii-input-array-is-sorted
1679-max-number-of-k-sum-pairs		1679-max-number-of-k-sum-pairs
1680-concatenation-of-consecutive-binary-numbers		1680-concatenation-of-consecutive-binary-numbers
1689-partitioning-into-minimum-number-of-deci-binary-numbers		1689-partitioning-into-minimum-number-of-deci-binary-numbers
1695-maximum-erasure-value		1695-maximum-erasure-value
1696-jump-game-vi		1696-jump-game-vi
17-letter-combinations-of-a-phone-number		17-letter-combinations-of-a-phone-number
1706-where-will-the-ball-fall		1706-where-will-the-ball-fall
173-binary-search-tree-iterator		173-binary-search-tree-iterator
1770-maximum-score-from-performing-multiplication-operations		1770-maximum-score-from-performing-multiplication-operations
1791-find-center-of-star-graph		1791-find-center-of-star-graph
1832-check-if-the-sentence-is-pangram		1832-check-if-the-sentence-is-pangram
1864-minimum-number-of-swaps-to-make-the-binary-string-alternating		1864-minimum-number-of-swaps-to-make-the-binary-string-alternating
188-best-time-to-buy-and-sell-stock-iv		188-best-time-to-buy-and-sell-stock-iv
1937-maximum-number-of-points-with-cost		1937-maximum-number-of-points-with-cost
1971-find-if-path-exists-in-graph		1971-find-if-path-exists-in-graph
198-house-robber		198-house-robber
1996-the-number-of-weak-characters-in-the-game		1996-the-number-of-weak-characters-in-the-game
200-number-of-islands		200-number-of-islands
207-course-schedule		207-course-schedule
2095-delete-the-middle-node-of-a-linked-list		2095-delete-the-middle-node-of-a-linked-list
2096-step-by-step-directions-from-a-binary-tree-node-to-another		2096-step-by-step-directions-from-a-binary-tree-node-to-another
210-course-schedule-ii		210-course-schedule-ii
2104-sum-of-subarray-ranges		2104-sum-of-subarray-ranges
213-house-robber-ii		213-house-robber-ii
2131-longest-palindrome-by-concatenating-two-letter-words		2131-longest-palindrome-by-concatenating-two-letter-words
2133-check-if-every-row-and-column-contains-all-numbers		2133-check-if-every-row-and-column-contains-all-numbers
2136-earliest-possible-day-of-full-bloom		2136-earliest-possible-day-of-full-bloom
2138-divide-a-string-into-groups-of-size-k		2138-divide-a-string-into-groups-of-size-k
216-combination-sum-iii		216-combination-sum-iii
2164-sort-even-and-odd-indices-independently		2164-sort-even-and-odd-indices-independently
218-the-skyline-problem		218-the-skyline-problem
219-contains-duplicate-ii		219-contains-duplicate-ii
2196-create-binary-tree-from-descriptions		2196-create-binary-tree-from-descriptions
2206-divide-array-into-equal-pairs		2206-divide-array-into-equal-pairs
2215-find-the-difference-of-two-arrays		2215-find-the-difference-of-two-arrays
2224-minimum-number-of-operations-to-convert-time		2224-minimum-number-of-operations-to-convert-time
2233-maximum-product-after-k-increments		2233-maximum-product-after-k-increments
2235-add-two-integers		2235-add-two-integers
2236-root-equals-sum-of-children		2236-root-equals-sum-of-children
224-basic-calculator		224-basic-calculator
2241-design-an-atm-machine		2241-design-an-atm-machine
225-implement-stack-using-queues		225-implement-stack-using-queues
2257-count-unguarded-cells-in-the-grid		2257-count-unguarded-cells-in-the-grid
226-invert-binary-tree		226-invert-binary-tree
2264-largest-3-same-digit-number-in-string		2264-largest-3-same-digit-number-in-string

medasuryatej/InterviewPrep

Folders and files

Latest commit

History

Repository files navigation

InterviewPrep

About

Resources

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages