Skip to content

Collection of LeetCode questions to ace the coding interview! - Created using [LeetHub v2](https://github.com/arunbhardwaj/LeetHub-2.0)

Notifications You must be signed in to change notification settings

kms1601/Leetcode

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Leetcode

Collection of LeetCode questions to ace the coding interview! - Created using LeetHub v2

Array

0075-sort-colors

Two Pointers

0075-sort-colors

Sorting

0075-sort-colors

Database

0584-find-customer-referee
0595-big-countries
1258-article-views-i
1827-invalid-tweets
1908-recyclable-and-low-fat-products

LeetCode Topics

Tree

0101-symmetric-tree
0783-search-in-a-binary-search-tree

Depth-First Search

0101-symmetric-tree
2121-find-if-path-exists-in-graph

Breadth-First Search

0101-symmetric-tree
2121-find-if-path-exists-in-graph

Binary Tree

0101-symmetric-tree
0783-search-in-a-binary-search-tree

Binary Search Tree

0268-missing-number
0783-search-in-a-binary-search-tree
1352-maximum-profit-in-job-scheduling
1832-minimum-operations-to-make-a-subsequence
2634-minimum-common-value

Array

0085-maximal-rectangle
0118-pascals-triangle
0268-missing-number
0380-insert-delete-getrandom-o1
0502-ipo
0561-array-partition
0747-min-cost-climbing-stairs
1352-maximum-profit-in-job-scheduling
1832-minimum-operations-to-make-a-subsequence
2163-kth-distinct-string-in-an-array
2398-check-if-matrix-is-x-matrix
2634-minimum-common-value
3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i

Hash Table

0268-missing-number
0380-insert-delete-getrandom-o1
1832-minimum-operations-to-make-a-subsequence
2163-kth-distinct-string-in-an-array
2634-minimum-common-value

String

2163-kth-distinct-string-in-an-array

Counting

2163-kth-distinct-string-in-an-array

Bit Manipulation

0268-missing-number
3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i

Queue

3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i

Sliding Window

3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i

Prefix Sum

3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i

Math

0268-missing-number
0380-insert-delete-getrandom-o1

Design

0380-insert-delete-getrandom-o1

Randomized

0380-insert-delete-getrandom-o1

Matrix

0085-maximal-rectangle
2398-check-if-matrix-is-x-matrix

Two Pointers

2634-minimum-common-value

Dynamic Programming

0085-maximal-rectangle
0118-pascals-triangle
0747-min-cost-climbing-stairs
1352-maximum-profit-in-job-scheduling

Stack

0085-maximal-rectangle

Monotonic Stack

0085-maximal-rectangle

Greedy

0502-ipo
0561-array-partition
1832-minimum-operations-to-make-a-subsequence

Sorting

0268-missing-number
0502-ipo
0561-array-partition
1352-maximum-profit-in-job-scheduling

Heap (Priority Queue)

0502-ipo

Counting Sort

0561-array-partition

Graph

1916-find-center-of-star-graph
2121-find-if-path-exists-in-graph

Union Find

2121-find-if-path-exists-in-graph

About

Collection of LeetCode questions to ace the coding interview! - Created using [LeetHub v2](https://github.com/arunbhardwaj/LeetHub-2.0)

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published