README.md

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