Skip to content

ShadiBahaa/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

LeetCode Topics

Math

0231-power-of-two
0268-missing-number
1014-k-closest-points-to-origin
1274-number-of-days-between-two-dates

String

0125-valid-palindrome
0208-implement-trie-prefix-tree
0692-top-k-frequent-words
0990-verifying-an-alien-dictionary
1023-time-based-key-value-store
1274-number-of-days-between-two-dates

Bit Manipulation

0231-power-of-two
0268-missing-number
0287-find-the-duplicate-number

Recursion

0021-merge-two-sorted-lists
0143-reorder-list
0231-power-of-two

Two Pointers

0125-valid-palindrome
0141-linked-list-cycle
0143-reorder-list
0287-find-the-duplicate-number

Array

0033-search-in-rotated-sorted-array
0056-merge-intervals
0121-best-time-to-buy-and-sell-stock
0215-kth-largest-element-in-an-array
0268-missing-number
0287-find-the-duplicate-number
0692-top-k-frequent-words
0876-hand-of-straights
0907-koko-eating-bananas
0990-verifying-an-alien-dictionary
1014-k-closest-points-to-origin
1319-unique-number-of-occurrences
2102-find-the-middle-index-in-array

Dynamic Programming

0121-best-time-to-buy-and-sell-stock

Prefix Sum

2102-find-the-middle-index-in-array

Hash Table

0141-linked-list-cycle
0208-implement-trie-prefix-tree
0268-missing-number
0692-top-k-frequent-words
0876-hand-of-straights
0990-verifying-an-alien-dictionary
1023-time-based-key-value-store
1029-vertical-order-traversal-of-a-binary-tree
1319-unique-number-of-occurrences

Linked List

0021-merge-two-sorted-lists
0114-flatten-binary-tree-to-linked-list
0141-linked-list-cycle
0143-reorder-list

Stack

0114-flatten-binary-tree-to-linked-list
0143-reorder-list
0145-binary-tree-postorder-traversal

Divide and Conquer

0215-kth-largest-element-in-an-array
1014-k-closest-points-to-origin

Sorting

0056-merge-intervals
0215-kth-largest-element-in-an-array
0268-missing-number
0692-top-k-frequent-words
0876-hand-of-straights
1014-k-closest-points-to-origin
1029-vertical-order-traversal-of-a-binary-tree

Heap (Priority Queue)

0215-kth-largest-element-in-an-array
0692-top-k-frequent-words
1014-k-closest-points-to-origin

Quickselect

0215-kth-largest-element-in-an-array
1014-k-closest-points-to-origin

Geometry

1014-k-closest-points-to-origin

Binary Search

0033-search-in-rotated-sorted-array
0268-missing-number
0287-find-the-duplicate-number
0907-koko-eating-bananas
1023-time-based-key-value-store

Greedy

0876-hand-of-straights

Tree

0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0112-path-sum
0114-flatten-binary-tree-to-linked-list
0145-binary-tree-postorder-traversal
0226-invert-binary-tree
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0404-sum-of-left-leaves
0530-minimum-absolute-difference-in-bst
0998-check-completeness-of-a-binary-tree
1029-vertical-order-traversal-of-a-binary-tree
2384-root-equals-sum-of-children

Depth-First Search

0104-maximum-depth-of-binary-tree
0112-path-sum
0114-flatten-binary-tree-to-linked-list
0145-binary-tree-postorder-traversal
0226-invert-binary-tree
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0404-sum-of-left-leaves
0530-minimum-absolute-difference-in-bst
1029-vertical-order-traversal-of-a-binary-tree

Breadth-First Search

0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0112-path-sum
0226-invert-binary-tree
0404-sum-of-left-leaves
0530-minimum-absolute-difference-in-bst
0998-check-completeness-of-a-binary-tree
1029-vertical-order-traversal-of-a-binary-tree

Binary Tree

0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0112-path-sum
0114-flatten-binary-tree-to-linked-list
0145-binary-tree-postorder-traversal
0226-invert-binary-tree
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0404-sum-of-left-leaves
0530-minimum-absolute-difference-in-bst
0998-check-completeness-of-a-binary-tree
1029-vertical-order-traversal-of-a-binary-tree
2384-root-equals-sum-of-children

Binary Search Tree

0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0530-minimum-absolute-difference-in-bst

Design

0208-implement-trie-prefix-tree
1023-time-based-key-value-store

Trie

0208-implement-trie-prefix-tree
0692-top-k-frequent-words

Bucket Sort

0692-top-k-frequent-words

Counting

0692-top-k-frequent-words

About

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

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published