Skip to content

kanchn-https/Qui-sin

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Qui-sin

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

LeetCode Topics

Linked List

0024-swap-nodes-in-pairs
0160-intersection-of-two-linked-lists
0206-reverse-linked-list
0234-palindrome-linked-list
0707-design-linked-list

Recursion

0024-swap-nodes-in-pairs
0206-reverse-linked-list
0234-palindrome-linked-list

Array

0055-jump-game
0066-plus-one
0079-word-search
0085-maximal-rectangle
0135-candy
0215-kth-largest-element-in-an-array
0496-next-greater-element-i
0713-subarray-product-less-than-k
0735-asteroid-collision
1292-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold
1423-maximum-points-you-can-obtain-from-cards
1975-maximum-matrix-sum
2104-sum-of-subarray-ranges
2943-maximize-area-of-square-hole-in-grid

Greedy

0055-jump-game
0135-candy
0402-remove-k-digits
1975-maximum-matrix-sum

Dynamic Programming

0055-jump-game
0085-maximal-rectangle
0712-minimum-ascii-delete-sum-for-two-strings
1411-number-of-ways-to-paint-n-3-grid

Hash Table

0003-longest-substring-without-repeating-characters
0076-minimum-window-substring
0160-intersection-of-two-linked-lists
0496-next-greater-element-i
0865-smallest-subtree-with-all-the-deepest-nodes
1358-number-of-substrings-containing-all-three-characters

Two Pointers

0160-intersection-of-two-linked-lists
0234-palindrome-linked-list

Stack

0085-maximal-rectangle
0094-binary-tree-inorder-traversal
0225-implement-stack-using-queues
0234-palindrome-linked-list
0402-remove-k-digits
0496-next-greater-element-i
0735-asteroid-collision
2104-sum-of-subarray-ranges

String

0003-longest-substring-without-repeating-characters
0076-minimum-window-substring
0079-word-search
0402-remove-k-digits
0712-minimum-ascii-delete-sum-for-two-strings
1358-number-of-substrings-containing-all-three-characters

Backtracking

0079-word-search

Depth-First Search

0079-word-search
0094-binary-tree-inorder-traversal
0104-maximum-depth-of-binary-tree
0199-binary-tree-right-side-view
0235-lowest-common-ancestor-of-a-binary-search-tree
0543-diameter-of-binary-tree
0865-smallest-subtree-with-all-the-deepest-nodes
1339-maximum-product-of-splitted-binary-tree

Matrix

0079-word-search
0085-maximal-rectangle
1292-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold
1975-maximum-matrix-sum

Binary Search

0713-subarray-product-less-than-k
1292-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold

Sliding Window

0003-longest-substring-without-repeating-characters
0076-minimum-window-substring
0713-subarray-product-less-than-k
1358-number-of-substrings-containing-all-three-characters
1423-maximum-points-you-can-obtain-from-cards

Prefix Sum

0713-subarray-product-less-than-k
1292-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold
1423-maximum-points-you-can-obtain-from-cards

Design

0225-implement-stack-using-queues
0707-design-linked-list

Queue

0225-implement-stack-using-queues

Divide and Conquer

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

Sorting

0215-kth-largest-element-in-an-array
2943-maximize-area-of-square-hole-in-grid

Heap (Priority Queue)

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

Quickselect

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

Monotonic Stack

0085-maximal-rectangle
0402-remove-k-digits
0496-next-greater-element-i
2104-sum-of-subarray-ranges

Simulation

0735-asteroid-collision

Tree

0094-binary-tree-inorder-traversal
0104-maximum-depth-of-binary-tree
0199-binary-tree-right-side-view
0235-lowest-common-ancestor-of-a-binary-search-tree
0543-diameter-of-binary-tree
0700-search-in-a-binary-search-tree
0865-smallest-subtree-with-all-the-deepest-nodes
1339-maximum-product-of-splitted-binary-tree

Binary Tree

0094-binary-tree-inorder-traversal
0104-maximum-depth-of-binary-tree
0199-binary-tree-right-side-view
0235-lowest-common-ancestor-of-a-binary-search-tree
0543-diameter-of-binary-tree
0700-search-in-a-binary-search-tree
0865-smallest-subtree-with-all-the-deepest-nodes
1339-maximum-product-of-splitted-binary-tree

Breadth-First Search

0104-maximum-depth-of-binary-tree
0199-binary-tree-right-side-view
0865-smallest-subtree-with-all-the-deepest-nodes

Math

0066-plus-one

Binary Search Tree

0235-lowest-common-ancestor-of-a-binary-search-tree
0700-search-in-a-binary-search-tree

About

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

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages