Skip to content

LDrago27/SuchitLeetCode

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

SuchitLeetCode

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

LeetCode Topics

String

0003-longest-substring-without-repeating-characters
0005-longest-palindromic-substring
0020-valid-parentheses
0049-group-anagrams
0076-minimum-window-substring
0091-decode-ways
0125-valid-palindrome
0208-implement-trie-prefix-tree
0211-design-add-and-search-words-data-structure
0242-valid-anagram
0424-longest-repeating-character-replacement
0647-palindromic-substrings

Dynamic Programming

0005-longest-palindromic-substring
0055-jump-game
0062-unique-paths
0091-decode-ways
0124-binary-tree-maximum-path-sum
0647-palindromic-substrings

Math

0062-unique-paths

Combinatorics

0062-unique-paths

Array

0049-group-anagrams
0055-jump-game
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0128-longest-consecutive-sequence
0417-pacific-atlantic-water-flow

Greedy

0055-jump-game

Hash Table

0003-longest-substring-without-repeating-characters
0049-group-anagrams
0076-minimum-window-substring
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0128-longest-consecutive-sequence
0133-clone-graph
0141-linked-list-cycle
0208-implement-trie-prefix-tree
0242-valid-anagram
0424-longest-repeating-character-replacement

Depth-First Search

0098-validate-binary-search-tree
0100-same-tree
0104-maximum-depth-of-binary-tree
0124-binary-tree-maximum-path-sum
0133-clone-graph
0207-course-schedule
0211-design-add-and-search-words-data-structure
0226-invert-binary-tree
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0417-pacific-atlantic-water-flow
0572-subtree-of-another-tree

Breadth-First Search

0100-same-tree
0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0133-clone-graph
0207-course-schedule
0226-invert-binary-tree
0417-pacific-atlantic-water-flow

Graph

0133-clone-graph
0207-course-schedule

Topological Sort

0207-course-schedule

Matrix

0417-pacific-atlantic-water-flow

Union Find

0128-longest-consecutive-sequence

Linked List

0019-remove-nth-node-from-end-of-list
0021-merge-two-sorted-lists
0023-merge-k-sorted-lists
0141-linked-list-cycle
0143-reorder-list
0206-reverse-linked-list

Recursion

0021-merge-two-sorted-lists
0143-reorder-list
0206-reverse-linked-list

Two Pointers

0005-longest-palindromic-substring
0019-remove-nth-node-from-end-of-list
0125-valid-palindrome
0141-linked-list-cycle
0143-reorder-list
0647-palindromic-substrings

Divide and Conquer

0023-merge-k-sorted-lists
0105-construct-binary-tree-from-preorder-and-inorder-traversal

Heap (Priority Queue)

0023-merge-k-sorted-lists

Merge Sort

0023-merge-k-sorted-lists

Stack

0020-valid-parentheses
0143-reorder-list

Tree

0098-validate-binary-search-tree
0100-same-tree
0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0124-binary-tree-maximum-path-sum
0226-invert-binary-tree
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0572-subtree-of-another-tree

Binary Tree

0098-validate-binary-search-tree
0100-same-tree
0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0124-binary-tree-maximum-path-sum
0226-invert-binary-tree
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0572-subtree-of-another-tree

String Matching

0572-subtree-of-another-tree

Hash Function

0572-subtree-of-another-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

Design

0208-implement-trie-prefix-tree
0211-design-add-and-search-words-data-structure

Trie

0208-implement-trie-prefix-tree
0211-design-add-and-search-words-data-structure

Sliding Window

0003-longest-substring-without-repeating-characters
0076-minimum-window-substring
0424-longest-repeating-character-replacement

Sorting

0049-group-anagrams
0242-valid-anagram

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