leetcode Submissions in Kotlin

Collection of LeetCode questions to ace the coding interview!

Most problems are done use Kotlin, but cpp could also be there for few

LeetCode Topics

Array

Problem Name	Difficulty
0042-trapping-rain-water
0056-merge-intervals	Medium
0136-single-number	Easy
0268-missing-number	Easy
0303-range-sum-query-immutable
0427-construct-quad-tree	Medium
0525-contiguous-array
0560-subarray-sum-equals-k
0729-my-calendar-i	Medium
0977-squares-of-a-sorted-array	Easy
1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit	Medium
2603-collect-coins-in-a-tree	Hard

Design

Problem Name	Difficulty
0295-find-median-from-data-stream	Hard
0303-range-sum-query-immutable
0341-flatten-nested-list-iterator
0729-my-calendar-i	Medium

Prefix Sum

Problem Name	Difficulty
0303-range-sum-query-immutable
0525-contiguous-array
0560-subarray-sum-equals-k

Hash Table

Problem Name	Difficulty
0003-longest-substring-without-repeating-characters
0268-missing-number	Easy
0525-contiguous-array
0560-subarray-sum-equals-k

Two Pointers

Problem Name	Difficulty
0042-trapping-rain-water
0295-find-median-from-data-stream	Hard
0977-squares-of-a-sorted-array	Easy

Dynamic Programming

Problem Name	Difficulty
0042-trapping-rain-water
2858-minimum-edge-reversals-so-every-node-is-reachable	Hard

Stack

Problem Name	Difficulty
0042-trapping-rain-water
0341-flatten-nested-list-iterator

Monotonic Stack

Problem Name	Difficulty
0042-trapping-rain-water

String

Problem Name	Difficulty
0003-longest-substring-without-repeating-characters

Sliding Window

Problem Name	Difficulty
0003-longest-substring-without-repeating-characters
1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit	Medium

Tree

Problem Name	Difficulty
0102-binary-tree-level-order-traversal	Medium
0112-path-sum	Easy
0341-flatten-nested-list-iterator
0427-construct-quad-tree	Medium
2603-collect-coins-in-a-tree	Hard

Depth-First Search

Problem Name	Difficulty
0112-path-sum	Easy
0341-flatten-nested-list-iterator
2858-minimum-edge-reversals-so-every-node-is-reachable	Hard

Queue

Problem Name	Difficulty
0341-flatten-nested-list-iterator
1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit	Medium

Iterator

Problem Name	Difficulty
0341-flatten-nested-list-iterator

Sorting

Problem Name	Difficulty
0056-merge-intervals	Medium
0268-missing-number	Easy
0295-find-median-from-data-stream	Hard
0977-squares-of-a-sorted-array	Easy

Linked List

Problem Name	Difficulty
0023-merge-k-sorted-lists	Hard
0206-reverse-linked-list	Easy

Divide and Conquer

Problem Name	Difficulty
0023-merge-k-sorted-lists	Hard
0427-construct-quad-tree	Medium

Heap (Priority Queue)

Problem Name	Difficulty
0023-merge-k-sorted-lists	Hard
0295-find-median-from-data-stream	Hard
1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit	Medium

Merge Sort

Problem Name	Difficulty
0023-merge-k-sorted-lists	Hard

Recursion

Problem Name	Difficulty
0050-powx-n	Medium
0206-reverse-linked-list	Easy

Math

Problem Name	Difficulty
0050-powx-n	Medium
0268-missing-number	Easy

Binary Search

Problem Name	Difficulty
0268-missing-number	Easy
0729-my-calendar-i	Medium

Bit Manipulation

Problem Name	Difficulty
0136-single-number	Easy
0268-missing-number	Easy

Breadth-First Search

Problem Name	Difficulty
0102-binary-tree-level-order-traversal	Medium
0112-path-sum	Easy
2858-minimum-edge-reversals-so-every-node-is-reachable	Hard

Binary Tree

Problem Name	Difficulty
0102-binary-tree-level-order-traversal	Medium
0112-path-sum	Easy

Data Stream

Problem Name	Difficulty
0295-find-median-from-data-stream	Hard

Matrix

Problem Name	Difficulty
0427-construct-quad-tree	Medium

Graph Theory

Problem Name	Difficulty
2603-collect-coins-in-a-tree	Hard
2858-minimum-edge-reversals-so-every-node-is-reachable	Hard

Topological Sort

Problem Name	Difficulty
2603-collect-coins-in-a-tree	Hard

Ordered Set

Problem Name	Difficulty
0729-my-calendar-i	Medium
1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit	Medium

Monotonic Queue

Problem Name	Difficulty
1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit	Medium

Segment Tree

Problem Name	Difficulty
0729-my-calendar-i	Medium

Name		Name	Last commit message	Last commit date
Latest commit History 419 Commits
0003-longest-substring-without-repeating-characters		0003-longest-substring-without-repeating-characters
0036-valid-sudoku		0036-valid-sudoku
0042-trapping-rain-water		0042-trapping-rain-water
0125-valid-palindrome		0125-valid-palindrome
0167-two-sum-ii-input-array-is-sorted		0167-two-sum-ii-input-array-is-sorted
0238-product-of-array-except-self		0238-product-of-array-except-self
0303-range-sum-query-immutable		0303-range-sum-query-immutable
0341-flatten-nested-list-iterator		0341-flatten-nested-list-iterator
0347-top-k-frequent-elements		0347-top-k-frequent-elements
0525-contiguous-array		0525-contiguous-array
0560-subarray-sum-equals-k		0560-subarray-sum-equals-k
1-two-sum		1-two-sum
100-same-tree		100-same-tree
1014-k-closest-points-to-origin		1014-k-closest-points-to-origin
102-binary-tree-level-order-traversal		102-binary-tree-level-order-traversal
1023-time-based-key-value-store		1023-time-based-key-value-store
1036-rotting-oranges		1036-rotting-oranges
104-maximum-depth-of-binary-tree		104-maximum-depth-of-binary-tree
105-construct-binary-tree-from-preorder-and-inorder-traversal		105-construct-binary-tree-from-preorder-and-inorder-traversal
11-container-with-most-water		11-container-with-most-water
110-balanced-binary-tree		110-balanced-binary-tree
1146-greatest-common-divisor-of-strings		1146-greatest-common-divisor-of-strings
124-binary-tree-maximum-path-sum		124-binary-tree-maximum-path-sum
125-valid-palindrome		125-valid-palindrome
128-longest-consecutive-sequence		128-longest-consecutive-sequence
133-clone-graph		133-clone-graph
138-copy-list-with-random-pointer		138-copy-list-with-random-pointer
139-word-break		139-word-break
141-linked-list-cycle		141-linked-list-cycle
143-reorder-list		143-reorder-list
146-lru-cache		146-lru-cache
150-evaluate-reverse-polish-notation		150-evaluate-reverse-polish-notation
151-reverse-words-in-a-string		151-reverse-words-in-a-string
1528-kids-with-the-greatest-number-of-candies		1528-kids-with-the-greatest-number-of-candies
153-find-minimum-in-rotated-sorted-array		153-find-minimum-in-rotated-sorted-array
1544-count-good-nodes-in-binary-tree		1544-count-good-nodes-in-binary-tree
155-min-stack		155-min-stack
167-two-sum-ii-input-array-is-sorted		167-two-sum-ii-input-array-is-sorted
17-letter-combinations-of-a-phone-number		17-letter-combinations-of-a-phone-number
1894-merge-strings-alternately		1894-merge-strings-alternately
19-remove-nth-node-from-end-of-list		19-remove-nth-node-from-end-of-list
199-binary-tree-right-side-view		199-binary-tree-right-side-view
2-add-two-numbers		2-add-two-numbers
20-valid-parentheses		20-valid-parentheses
200-number-of-islands		200-number-of-islands
207-course-schedule		207-course-schedule
208-implement-trie-prefix-tree		208-implement-trie-prefix-tree
21-merge-two-sorted-lists		21-merge-two-sorted-lists
217-contains-duplicate		217-contains-duplicate
226-invert-binary-tree		226-invert-binary-tree
23-merge-k-sorted-lists		23-merge-k-sorted-lists
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
238-product-of-array-except-self		238-product-of-array-except-self
239-sliding-window-maximum		239-sliding-window-maximum
25-reverse-nodes-in-k-group		25-reverse-nodes-in-k-group
2552-maximum-sum-of-distinct-subarrays-with-length-k		2552-maximum-sum-of-distinct-subarrays-with-length-k
278-first-bad-version		278-first-bad-version
28-find-the-index-of-the-first-occurrence-in-a-string		28-find-the-index-of-the-first-occurrence-in-a-string
287-find-the-duplicate-number		287-find-the-duplicate-number
297-serialize-and-deserialize-binary-tree		297-serialize-and-deserialize-binary-tree
3-longest-substring-without-repeating-characters		3-longest-substring-without-repeating-characters
33-search-in-rotated-sorted-array		33-search-in-rotated-sorted-array
334-increasing-triplet-subsequence		334-increasing-triplet-subsequence
345-reverse-vowels-of-a-string		345-reverse-vowels-of-a-string
383-ransom-note		383-ransom-note
409-longest-palindrome		409-longest-palindrome
416-partition-equal-subset-sum		416-partition-equal-subset-sum
424-longest-repeating-character-replacement		424-longest-repeating-character-replacement
438-find-all-anagrams-in-a-string		438-find-all-anagrams-in-a-string
443-string-compression		443-string-compression
49-group-anagrams		49-group-anagrams
54-spiral-matrix		54-spiral-matrix
542-01-matrix		542-01-matrix
543-diameter-of-binary-tree		543-diameter-of-binary-tree
56-merge-intervals		56-merge-intervals
567-permutation-in-string		567-permutation-in-string
572-subtree-of-another-tree		572-subtree-of-another-tree
605-can-place-flowers		605-can-place-flowers
643-maximum-average-subarray-i		643-maximum-average-subarray-i
70-climbing-stairs		70-climbing-stairs
721-accounts-merge		721-accounts-merge
74-search-a-2d-matrix		74-search-a-2d-matrix
76-minimum-window-substring		76-minimum-window-substring
78-subsets		78-subsets
792-binary-search		792-binary-search
83-remove-duplicates-from-sorted-list		83-remove-duplicates-from-sorted-list
84-largest-rectangle-in-histogram		84-largest-rectangle-in-histogram
883-car-fleet		883-car-fleet
907-koko-eating-bananas		907-koko-eating-bananas
98-validate-binary-search-tree		98-validate-binary-search-tree
LeetCode		LeetCode
README.md		README.md
stats.json		stats.json

Folders and files

Latest commit

History

Repository files navigation

leetcode Submissions in Kotlin

LeetCode Topics

Array

Design

Prefix Sum

Hash Table

Two Pointers

Dynamic Programming

Stack

Monotonic Stack

String

Sliding Window

Tree

Depth-First Search

Queue

Iterator

Sorting

Linked List

Divide and Conquer

Heap (Priority Queue)

Merge Sort

Recursion

Math

Binary Search

Bit Manipulation

Breadth-First Search

Binary Tree

Data Stream

Matrix

Graph Theory

Topological Sort

Ordered Set

Monotonic Queue

Segment Tree

About

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Uh oh!

Contributors

Uh oh!

Languages

Packages