Leetcode

More at: https://leetcode.com/markkais129/

Stopstalk: https://www.stopstalk.com/user/profile/broken_dream

LeetCode Topics

Math


0096-unique-binary-search-trees

Dynamic Programming


0096-unique-binary-search-trees

Tree


0096-unique-binary-search-trees
0102-binary-tree-level-order-traversal
2646-kth-largest-sum-in-a-binary-tree

Binary Search Tree


0004-median-of-two-sorted-arrays
0096-unique-binary-search-trees

Binary Tree


0096-unique-binary-search-trees
0102-binary-tree-level-order-traversal
2646-kth-largest-sum-in-a-binary-tree

Breadth-First Search


0102-binary-tree-level-order-traversal
2646-kth-largest-sum-in-a-binary-tree

Sorting


2646-kth-largest-sum-in-a-binary-tree

Array


0004-median-of-two-sorted-arrays
2255-minimum-swaps-to-group-all-1s-together-ii

Sliding Window


2255-minimum-swaps-to-group-all-1s-together-ii

Divide and Conquer


0004-median-of-two-sorted-arrays

Name		Name	Last commit message	Last commit date
Latest commit History 372 Commits
0004-median-of-two-sorted-arrays		0004-median-of-two-sorted-arrays
0096-unique-binary-search-trees		0096-unique-binary-search-trees
0102-binary-tree-level-order-traversal		0102-binary-tree-level-order-traversal
0151-reverse-words-in-a-string		0151-reverse-words-in-a-string
0238-product-of-array-except-self		0238-product-of-array-except-self
0334-increasing-triplet-subsequence		0334-increasing-triplet-subsequence
0392-is-subsequence		0392-is-subsequence
0443-string-compression		0443-string-compression
1153-product-sales-analysis-i		1153-product-sales-analysis-i
1258-article-views-i		1258-article-views-i
1319-unique-number-of-occurrences		1319-unique-number-of-occurrences
1352-maximum-profit-in-job-scheduling		1352-maximum-profit-in-job-scheduling
1354-find-players-with-zero-or-one-losses		1354-find-players-with-zero-or-one-losses
1415-students-and-examinations		1415-students-and-examinations
1469-minimum-number-of-steps-to-make-two-strings-anagram		1469-minimum-number-of-steps-to-make-two-strings-anagram
1509-replace-employee-id-with-the-unique-identifier		1509-replace-employee-id-with-the-unique-identifier
1724-customer-who-visited-but-did-not-make-any-transactions		1724-customer-who-visited-but-did-not-make-any-transactions
1777-determine-if-two-strings-are-close		1777-determine-if-two-strings-are-close
1801-average-time-of-process-per-machine		1801-average-time-of-process-per-machine
1827-invalid-tweets		1827-invalid-tweets
1894-merge-strings-alternately		1894-merge-strings-alternately
197-rising-temperature		197-rising-temperature
2255-minimum-swaps-to-group-all-1s-together-ii		2255-minimum-swaps-to-group-all-1s-together-ii
2646-kth-largest-sum-in-a-binary-tree		2646-kth-largest-sum-in-a-binary-tree
300-longest-increasing-subsequence		300-longest-increasing-subsequence
380-insert-delete-getrandom-o1		380-insert-delete-getrandom-o1
3sum-closest		3sum-closest
3sum		3sum
446-arithmetic-slices-ii-subsequence		446-arithmetic-slices-ii-subsequence
570-managers-with-at-least-5-direct-reports		570-managers-with-at-least-5-direct-reports
577-employee-bonus		577-employee-bonus
595-big-countries		595-big-countries
78-subsets		78-subsets
94-binary-tree-inorder-traversal		94-binary-tree-inorder-traversal
975-range-sum-of-bst		975-range-sum-of-bst
add-digits		add-digits
add-strings		add-strings
array-of-doubled-pairs		array-of-doubled-pairs
beautiful-array		beautiful-array
best-time-to-buy-and-sell-stock-ii		best-time-to-buy-and-sell-stock-ii
best-time-to-buy-and-sell-stock		best-time-to-buy-and-sell-stock
binary-gap		binary-gap
binary-number-with-alternating-bits		binary-number-with-alternating-bits
binary-search		binary-search
binary-tree-inorder-traversal		binary-tree-inorder-traversal
binary-tree-level-order-traversal		binary-tree-level-order-traversal
binary-tree-postorder-traversal		binary-tree-postorder-traversal
binary-tree-preorder-traversal		binary-tree-preorder-traversal
binary-watch		binary-watch
bitwise-and-of-numbers-range		bitwise-and-of-numbers-range
check-array-formation-through-concatenation		check-array-formation-through-concatenation
check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence		check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence
climbing-stairs		climbing-stairs
combinations		combinations
construct-binary-tree-from-inorder-and-postorder-traversal		construct-binary-tree-from-inorder-and-postorder-traversal
construct-binary-tree-from-preorder-and-inorder-traversal		construct-binary-tree-from-preorder-and-inorder-traversal
construct-k-palindrome-strings		construct-k-palindrome-strings
container-with-most-water		container-with-most-water
contains-duplicate-ii		contains-duplicate-ii
contains-duplicate		contains-duplicate
convert-binary-number-in-a-linked-list-to-integer		convert-binary-number-in-a-linked-list-to-integer
count-negative-numbers-in-a-sorted-matrix		count-negative-numbers-in-a-sorted-matrix
count-primes		count-primes
count-the-number-of-consistent-strings		count-the-number-of-consistent-strings
cousins-in-binary-tree		cousins-in-binary-tree
delete-node-in-a-linked-list		delete-node-in-a-linked-list
design-circular-queue		design-circular-queue
detect-pattern-of-length-m-repeated-k-or-more-times		detect-pattern-of-length-m-repeated-k-or-more-times
di-string-match		di-string-match
fibonacci-number		fibonacci-number
find-all-duplicates-in-an-array		find-all-duplicates-in-an-array
find-common-characters		find-common-characters
find-customer-referee		find-customer-referee
find-pivot-index		find-pivot-index
find-the-difference		find-the-difference
find-the-duplicate-number		find-the-duplicate-number
find-the-most-competitive-subsequence		find-the-most-competitive-subsequence
find-valid-matrix-given-row-and-column-sums		find-valid-matrix-given-row-and-column-sums
first-bad-version		first-bad-version
fizz-buzz		fizz-buzz
flip-string-to-monotone-increasing		flip-string-to-monotone-increasing
flipping-an-image		flipping-an-image
hamming-distance		hamming-distance
happy-number		happy-number
insert-delete-getrandom-o1		insert-delete-getrandom-o1
integer-replacement		integer-replacement
intersection-of-two-arrays-ii		intersection-of-two-arrays-ii
intersection-of-two-arrays		intersection-of-two-arrays
invalid-transactions		invalid-transactions
jump-game		jump-game
k-diff-pairs-in-an-array		k-diff-pairs-in-an-array
k-th-symbol-in-grammar		k-th-symbol-in-grammar
letter-combinations-of-a-phone-number		letter-combinations-of-a-phone-number
longest-continuous-increasing-subsequence		longest-continuous-increasing-subsequence
lowest-common-ancestor-of-a-binary-tree		lowest-common-ancestor-of-a-binary-tree
majority-element-ii		majority-element-ii
maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts		maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts
maximum-average-subarray-i		maximum-average-subarray-i
maximum-depth-of-binary-tree		maximum-depth-of-binary-tree
maximum-difference-between-increasing-elements		maximum-difference-between-increasing-elements

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

Leetcode

LeetCode Topics

Math

Dynamic Programming

Tree

Binary Search Tree

Binary Tree

Breadth-First Search

Sorting

Array

Sliding Window

Divide and Conquer

About

Releases

Packages

Languages

Md-Kais/Leetcode

Folders and files

Latest commit

History

Repository files navigation

Leetcode

LeetCode Topics

Math

Dynamic Programming

Tree

Binary Search Tree

Binary Tree

Breadth-First Search

Sorting

Array

Sliding Window

Divide and Conquer

About

Topics

Resources

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages