GitHub - SajinKowserSK/algorithms-practice: An incomplete list of leetcode questions completed to prepare for technical interviews (done in mainly Python, occasionally Java and SQL when appropriate).

SajinKowserSK / algorithms-practice Public

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

An incomplete list of leetcode questions completed to prepare for technical interviews (done in mainly Python, occasionally Java and SQL when appropriate).

2 stars 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 590 Commits
.idea		.idea
0048-rotate-image		0048-rotate-image
0162-find-peak-element		0162-find-peak-element
0528-random-pick-with-weight		0528-random-pick-with-weight
0811-subdomain-visit-count		0811-subdomain-visit-count
100-same-tree		100-same-tree
102-binary-tree-level-order-traversal		102-binary-tree-level-order-traversal
103-binary-tree-zigzag-level-order-traversal		103-binary-tree-zigzag-level-order-traversal
104-maximum-depth-of-binary-tree		104-maximum-depth-of-binary-tree
1046-last-stone-weight		1046-last-stone-weight
1047-remove-all-adjacent-duplicates-in-string		1047-remove-all-adjacent-duplicates-in-string
105-construct-binary-tree-from-preorder-and-inorder-traversal		105-construct-binary-tree-from-preorder-and-inorder-traversal
106-construct-binary-tree-from-inorder-and-postorder-traversal		106-construct-binary-tree-from-inorder-and-postorder-traversal
1096-brace-expansion-ii		1096-brace-expansion-ii
110-balanced-binary-tree		110-balanced-binary-tree
1143-longest-common-subsequence		1143-longest-common-subsequence
1209-remove-all-adjacent-duplicates-in-string-ii		1209-remove-all-adjacent-duplicates-in-string-ii
124-binary-tree-maximum-path-sum		124-binary-tree-maximum-path-sum
1396-design-underground-system		1396-design-underground-system
1419-minimum-number-of-frogs-croaking		1419-minimum-number-of-frogs-croaking
1448-count-good-nodes-in-binary-tree		1448-count-good-nodes-in-binary-tree
1472-design-browser-history		1472-design-browser-history
148-sort-list		148-sort-list
1656-design-an-ordered-stream		1656-design-an-ordered-stream
199-binary-tree-right-side-view		199-binary-tree-right-side-view
202-happy-number		202-happy-number
210-course-schedule-ii		210-course-schedule-ii
215-kth-largest-element-in-an-array		215-kth-largest-element-in-an-array
226-invert-binary-tree		226-invert-binary-tree
230-kth-smallest-element-in-a-bst		230-kth-smallest-element-in-a-bst
235-lowest-common-ancestor-of-a-binary-search-tree		235-lowest-common-ancestor-of-a-binary-search-tree
236-lowest-common-ancestor-of-a-binary-tree		236-lowest-common-ancestor-of-a-binary-tree
2390-removing-stars-from-a-string		2390-removing-stars-from-a-string
300-longest-increasing-subsequence		300-longest-increasing-subsequence
314-binary-tree-vertical-order-traversal		314-binary-tree-vertical-order-traversal
322-coin-change		322-coin-change
380-insert-delete-getrandom-o1		380-insert-delete-getrandom-o1
39-combination-sum		39-combination-sum
394-decode-string		394-decode-string
3sum		3sum
40-combination-sum-ii		40-combination-sum-ii
430-flatten-a-multilevel-doubly-linked-list		430-flatten-a-multilevel-doubly-linked-list
46-permutations		46-permutations
48-rotate-image		48-rotate-image
54-spiral-matrix		54-spiral-matrix
543-diameter-of-binary-tree		543-diameter-of-binary-tree
572-subtree-of-another-tree		572-subtree-of-another-tree
621-task-scheduler		621-task-scheduler
66-plus-one		66-plus-one
70-climbing-stairs		70-climbing-stairs
703-kth-largest-element-in-a-stream		703-kth-largest-element-in-a-stream
73-set-matrix-zeroes		73-set-matrix-zeroes
75-sort-colors		75-sort-colors
78-subsets		78-subsets
90-subsets-ii		90-subsets-ii
973-k-closest-points-to-origin		973-k-closest-points-to-origin
98-validate-binary-search-tree		98-validate-binary-search-tree
983-minimum-cost-for-tickets		983-minimum-cost-for-tickets
987-vertical-order-traversal-of-a-binary-tree		987-vertical-order-traversal-of-a-binary-tree
DSA-Course		DSA-Course
Grokking Coding Interview		Grokking Coding Interview
__pycache__		__pycache__
add-two-numbers		add-two-numbers
array-of-doubled-pairs		array-of-doubled-pairs
asteroid-collision		asteroid-collision
car-fleet		car-fleet
decode-string		decode-string
employee-importance		employee-importance
find-and-replace-in-string		find-and-replace-in-string
koko-eating-bananas		koko-eating-bananas
leetcode old&new		leetcode old&new
longest-substring-without-repeating-characters		longest-substring-without-repeating-characters
maximum-points-you-can-obtain-from-cards		maximum-points-you-can-obtain-from-cards
maximum-subarray		maximum-subarray
merge-intervals		merge-intervals
minimum-difference-between-largest-and-smallest-value-in-three-moves		minimum-difference-between-largest-and-smallest-value-in-three-moves
mocks		mocks
number-of-good-ways-to-split-a-string		number-of-good-ways-to-split-a-string
number-of-matching-subsequences		number-of-matching-subsequences
real		real
rotting-oranges		rotting-oranges
Prim_MST.py		Prim_MST.py
heap.py		heap.py
mst_graph_medium.txt		mst_graph_medium.txt
test.py		test.py

About

An incomplete list of leetcode questions completed to prepare for technical interviews (done in mainly Python, occasionally Java and SQL when appropriate).

Activity

2 stars

1 watching

0 forks

Report repository

Releases

No releases published

Packages

No packages published

SajinKowserSK/algorithms-practice

Folders and files

Latest commit

History