Skip to content

chappdev2019/leetcode

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

LeetCode Topics

Array

0033-search-in-rotated-sorted-array
0045-jump-game-ii
0046-permutations
0049-group-anagrams
0053-maximum-subarray
0055-jump-game
0228-summary-ranges
0253-meeting-rooms-ii
0542-01-matrix
0630-course-schedule-iii
0646-maximum-length-of-pair-chain
0761-employee-free-time
1014-k-closest-points-to-origin
1019-squares-of-a-sorted-array
1476-count-negative-numbers-in-a-sorted-matrix
1802-number-of-students-unable-to-eat-lunch
1927-maximum-ascending-subarray-sum

Binary Search

0033-search-in-rotated-sorted-array
0270-closest-binary-search-tree-value
1476-count-negative-numbers-in-a-sorted-matrix

Matrix

0542-01-matrix
1476-count-negative-numbers-in-a-sorted-matrix

Hash Table

0003-longest-substring-without-repeating-characters
0049-group-anagrams
0133-clone-graph
0141-linked-list-cycle
0387-first-unique-character-in-a-string
0653-two-sum-iv-input-is-a-bst
0893-all-nodes-distance-k-in-binary-tree
0896-smallest-subtree-with-all-the-deepest-nodes
2053-check-if-all-characters-have-equal-number-of-occurrences

String

0003-longest-substring-without-repeating-characters
0005-longest-palindromic-substring
0008-string-to-integer-atoi
0049-group-anagrams
0067-add-binary
0387-first-unique-character-in-a-string
1894-merge-strings-alternately
2053-check-if-all-characters-have-equal-number-of-occurrences
2217-step-by-step-directions-from-a-binary-tree-node-to-another

Sorting

0049-group-anagrams
0253-meeting-rooms-ii
0630-course-schedule-iii
0646-maximum-length-of-pair-chain
0761-employee-free-time
1014-k-closest-points-to-origin
1019-squares-of-a-sorted-array

Dynamic Programming

0005-longest-palindromic-substring
0045-jump-game-ii
0053-maximum-subarray
0055-jump-game
0096-unique-binary-search-trees
0542-01-matrix
0646-maximum-length-of-pair-chain

Greedy

0045-jump-game-ii
0055-jump-game
0253-meeting-rooms-ii
0630-course-schedule-iii
0646-maximum-length-of-pair-chain

Math

0067-add-binary
0096-unique-binary-search-trees
1014-k-closest-points-to-origin

Tree

0096-unique-binary-search-trees
0098-validate-binary-search-tree
0199-binary-tree-right-side-view
0235-lowest-common-ancestor-of-a-binary-search-tree
0270-closest-binary-search-tree-value
0653-two-sum-iv-input-is-a-bst
0893-all-nodes-distance-k-in-binary-tree
0896-smallest-subtree-with-all-the-deepest-nodes
2217-step-by-step-directions-from-a-binary-tree-node-to-another

Binary Search Tree

0096-unique-binary-search-trees
0098-validate-binary-search-tree
0235-lowest-common-ancestor-of-a-binary-search-tree
0270-closest-binary-search-tree-value
0653-two-sum-iv-input-is-a-bst

Binary Tree

0096-unique-binary-search-trees
0098-validate-binary-search-tree
0199-binary-tree-right-side-view
0235-lowest-common-ancestor-of-a-binary-search-tree
0270-closest-binary-search-tree-value
0653-two-sum-iv-input-is-a-bst
0893-all-nodes-distance-k-in-binary-tree
0896-smallest-subtree-with-all-the-deepest-nodes
2217-step-by-step-directions-from-a-binary-tree-node-to-another

Depth-First Search

0098-validate-binary-search-tree
0133-clone-graph
0199-binary-tree-right-side-view
0207-course-schedule
0210-course-schedule-ii
0235-lowest-common-ancestor-of-a-binary-search-tree
0270-closest-binary-search-tree-value
0653-two-sum-iv-input-is-a-bst
0893-all-nodes-distance-k-in-binary-tree
0896-smallest-subtree-with-all-the-deepest-nodes
1558-course-schedule-iv
2121-find-if-path-exists-in-graph
2217-step-by-step-directions-from-a-binary-tree-node-to-another

Breadth-First Search

0133-clone-graph
0199-binary-tree-right-side-view
0207-course-schedule
0210-course-schedule-ii
0542-01-matrix
0653-two-sum-iv-input-is-a-bst
0893-all-nodes-distance-k-in-binary-tree
0896-smallest-subtree-with-all-the-deepest-nodes
1558-course-schedule-iv
2121-find-if-path-exists-in-graph

Two Pointers

0005-longest-palindromic-substring
0141-linked-list-cycle
0253-meeting-rooms-ii
0653-two-sum-iv-input-is-a-bst
1019-squares-of-a-sorted-array
1894-merge-strings-alternately

Bit Manipulation

0067-add-binary

Simulation

0067-add-binary
1802-number-of-students-unable-to-eat-lunch

Union Find

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

Graph

0133-clone-graph
0207-course-schedule
0210-course-schedule-ii
1558-course-schedule-iv
2121-find-if-path-exists-in-graph

Queue

0232-implement-queue-using-stacks
0387-first-unique-character-in-a-string
0969-number-of-recent-calls
1802-number-of-students-unable-to-eat-lunch

Counting

0387-first-unique-character-in-a-string
2053-check-if-all-characters-have-equal-number-of-occurrences

Design

0232-implement-queue-using-stacks
0969-number-of-recent-calls

Data Stream

0969-number-of-recent-calls

Stack

0232-implement-queue-using-stacks
1802-number-of-students-unable-to-eat-lunch

Heap (Priority Queue)

0253-meeting-rooms-ii
0630-course-schedule-iii
0761-employee-free-time
1014-k-closest-points-to-origin

Prefix Sum

0253-meeting-rooms-ii

Topological Sort

0207-course-schedule
0210-course-schedule-ii
1558-course-schedule-iv

Divide and Conquer

0053-maximum-subarray
1014-k-closest-points-to-origin

Geometry

1014-k-closest-points-to-origin

Quickselect

1014-k-closest-points-to-origin

Linked List

0141-linked-list-cycle

Sliding Window

0003-longest-substring-without-repeating-characters

Backtracking

0046-permutations

About

leetcode_daily

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published