Skip to content

Im-Pranshu/LeetCode-Solutions

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

LeetCode-Solutions

A collection of LeetCode questions to ace the coding interview! - Practiced by Me (Divided in categories according to topic name).

LeetCode Topics

Linked List

0002-add-two-numbers
0021-merge-two-sorted-lists
0025-reverse-nodes-in-k-group
0083-remove-duplicates-from-sorted-list
0114-flatten-binary-tree-to-linked-list

Math

0002-add-two-numbers
0007-reverse-integer
0009-palindrome-number
0029-divide-two-integers
0069-sqrtx

Recursion

0002-add-two-numbers
0021-merge-two-sorted-lists
0025-reverse-nodes-in-k-group

Array

0001-two-sum
0015-3sum
0018-4sum
0026-remove-duplicates-from-sorted-array
0033-search-in-rotated-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array
0035-search-insert-position
0081-search-in-rotated-sorted-array-ii
0088-merge-sorted-array
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0215-kth-largest-element-in-an-array
0217-contains-duplicate

Hash Table

0001-two-sum
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0217-contains-duplicate
0653-two-sum-iv-input-is-a-bst
1029-vertical-order-traversal-of-a-binary-tree

Two Pointers

0015-3sum
0018-4sum
0026-remove-duplicates-from-sorted-array
0088-merge-sorted-array
0165-compare-version-numbers
0653-two-sum-iv-input-is-a-bst

Sorting

0015-3sum
0018-4sum
0088-merge-sorted-array
0215-kth-largest-element-in-an-array
0217-contains-duplicate
1029-vertical-order-traversal-of-a-binary-tree

String

0020-valid-parentheses
0032-longest-valid-parentheses
0058-length-of-last-word
0165-compare-version-numbers
2021-remove-all-occurrences-of-a-substring

Stack

0020-valid-parentheses
0032-longest-valid-parentheses
0094-binary-tree-inorder-traversal
0114-flatten-binary-tree-to-linked-list
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal

Bit Manipulation

0029-divide-two-integers

Dynamic Programming

0032-longest-valid-parentheses

Binary Search

0033-search-in-rotated-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array
0035-search-insert-position
0069-sqrtx
0081-search-in-rotated-sorted-array-ii

Tree

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0114-flatten-binary-tree-to-linked-list
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0199-binary-tree-right-side-view
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0437-path-sum-iii
0450-delete-node-in-a-bst
0653-two-sum-iv-input-is-a-bst
0783-search-in-a-binary-search-tree
1029-vertical-order-traversal-of-a-binary-tree
1285-balance-a-binary-search-tree

Breadth-First Search

0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0199-binary-tree-right-side-view
0653-two-sum-iv-input-is-a-bst
1029-vertical-order-traversal-of-a-binary-tree

Binary Tree

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0114-flatten-binary-tree-to-linked-list
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0199-binary-tree-right-side-view
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0437-path-sum-iii
0450-delete-node-in-a-bst
0653-two-sum-iv-input-is-a-bst
0783-search-in-a-binary-search-tree
1029-vertical-order-traversal-of-a-binary-tree
1285-balance-a-binary-search-tree

Depth-First Search

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0104-maximum-depth-of-binary-tree
0114-flatten-binary-tree-to-linked-list
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0199-binary-tree-right-side-view
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0437-path-sum-iii
0653-two-sum-iv-input-is-a-bst
1029-vertical-order-traversal-of-a-binary-tree
1285-balance-a-binary-search-tree

Divide and Conquer

0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0215-kth-largest-element-in-an-array
1285-balance-a-binary-search-tree

Binary Search Tree

0098-validate-binary-search-tree
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0450-delete-node-in-a-bst
0653-two-sum-iv-input-is-a-bst
0783-search-in-a-binary-search-tree
1285-balance-a-binary-search-tree

Greedy

1285-balance-a-binary-search-tree

Heap (Priority Queue)

0215-kth-largest-element-in-an-array

Quickselect

0215-kth-largest-element-in-an-array

About

A collection of My Practiced LeetCode questions to ace the coding interview!

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published