Skip to content

supriyajathar/Leetcode

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

A collection of LeetCode questions to ace the coding interview! - Created using LeetHub v2

LeetCode Topics

Array

0026-remove-duplicates-from-sorted-array
0088-merge-sorted-array
0189-rotate-array
0283-move-zeroes
0350-intersection-of-two-arrays-ii
0948-sort-an-array
1044-find-common-characters
1207-delete-nodes-and-return-forest
1333-sort-the-jumbled-numbers
1496-lucky-numbers-in-a-matrix
1511-count-number-of-teams
1556-make-two-arrays-equal-by-reversing-subarrays
1615-range-sum-of-sorted-subarray-sums
1616-minimum-difference-between-largest-and-smallest-value-in-three-moves
1711-find-valid-matrix-given-row-and-column-sums
1720-crawler-log-folder
1741-sort-array-by-increasing-frequency
1803-average-waiting-time
1951-find-the-winner-of-the-circular-game
2163-kth-distinct-string-in-an-array
2255-minimum-swaps-to-group-all-1s-together-ii
2306-create-binary-tree-from-descriptions
2472-build-a-matrix-with-conditions
2502-sort-the-people
2727-number-of-senior-citizens
2846-robot-collisions
3235-minimum-cost-to-convert-string-i
3461-find-the-minimum-area-to-cover-all-ones-i
3471-minimum-average-of-smallest-and-largest-elements

Two Pointers

0026-remove-duplicates-from-sorted-array
0088-merge-sorted-array
0141-linked-list-cycle
0142-linked-list-cycle-ii
0189-rotate-array
0283-move-zeroes
0350-intersection-of-two-arrays-ii
1615-range-sum-of-sorted-subarray-sums
3471-minimum-average-of-smallest-and-largest-elements

Math

0002-add-two-numbers
0189-rotate-array
0273-integer-to-english-words
1951-find-the-winner-of-the-circular-game
2645-pass-the-pillow

Hash Table

0141-linked-list-cycle
0142-linked-list-cycle-ii
0242-valid-anagram
0350-intersection-of-two-arrays-ii
0387-first-unique-character-in-a-string
0726-number-of-atoms
1044-find-common-characters
1207-delete-nodes-and-return-forest
1556-make-two-arrays-equal-by-reversing-subarrays
1741-sort-array-by-increasing-frequency
2163-kth-distinct-string-in-an-array
2306-create-binary-tree-from-descriptions
2502-sort-the-people
3276-minimum-number-of-pushes-to-type-word-ii

Binary Search

0350-intersection-of-two-arrays-ii
1615-range-sum-of-sorted-subarray-sums

Sorting

0088-merge-sorted-array
0242-valid-anagram
0350-intersection-of-two-arrays-ii
0726-number-of-atoms
0948-sort-an-array
1333-sort-the-jumbled-numbers
1556-make-two-arrays-equal-by-reversing-subarrays
1615-range-sum-of-sorted-subarray-sums
1616-minimum-difference-between-largest-and-smallest-value-in-three-moves
1741-sort-array-by-increasing-frequency
2502-sort-the-people
2846-robot-collisions
3276-minimum-number-of-pushes-to-type-word-ii
3471-minimum-average-of-smallest-and-largest-elements

String

0242-valid-anagram
0273-integer-to-english-words
0387-first-unique-character-in-a-string
0726-number-of-atoms
1044-find-common-characters
1298-reverse-substrings-between-each-pair-of-parentheses
1720-crawler-log-folder
1756-minimum-deletions-to-make-string-balanced
1818-maximum-score-from-removing-substrings
2163-kth-distinct-string-in-an-array
2502-sort-the-people
2727-number-of-senior-citizens
3235-minimum-cost-to-convert-string-i
3276-minimum-number-of-pushes-to-type-word-ii

Greedy

1616-minimum-difference-between-largest-and-smallest-value-in-three-moves
1711-find-valid-matrix-given-row-and-column-sums
1818-maximum-score-from-removing-substrings
3276-minimum-number-of-pushes-to-type-word-ii

Linked List

0002-add-two-numbers
0141-linked-list-cycle
0142-linked-list-cycle-ii
2182-find-the-minimum-and-maximum-number-of-nodes-between-critical-points
2299-merge-nodes-in-between-zeros

Simulation

1803-average-waiting-time
1951-find-the-winner-of-the-circular-game
2299-merge-nodes-in-between-zeros
2645-pass-the-pillow
2846-robot-collisions

Recursion

0002-add-two-numbers
0273-integer-to-english-words
1951-find-the-winner-of-the-circular-game

Queue

0387-first-unique-character-in-a-string
1951-find-the-winner-of-the-circular-game

Stack

0726-number-of-atoms
1298-reverse-substrings-between-each-pair-of-parentheses
1720-crawler-log-folder
1756-minimum-deletions-to-make-string-balanced
1818-maximum-score-from-removing-substrings
2846-robot-collisions

Tree

0111-minimum-depth-of-binary-tree
1207-delete-nodes-and-return-forest
1653-number-of-good-leaf-nodes-pairs
2306-create-binary-tree-from-descriptions

Binary Tree

0111-minimum-depth-of-binary-tree
1207-delete-nodes-and-return-forest
1653-number-of-good-leaf-nodes-pairs
2306-create-binary-tree-from-descriptions

Depth-First Search

0111-minimum-depth-of-binary-tree
1207-delete-nodes-and-return-forest
1653-number-of-good-leaf-nodes-pairs

Matrix

1496-lucky-numbers-in-a-matrix
1711-find-valid-matrix-given-row-and-column-sums
2472-build-a-matrix-with-conditions
3461-find-the-minimum-area-to-cover-all-ones-i

Graph

1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
2171-second-minimum-time-to-reach-destination
2472-build-a-matrix-with-conditions
3235-minimum-cost-to-convert-string-i

Topological Sort

2472-build-a-matrix-with-conditions

Counting

0387-first-unique-character-in-a-string
2163-kth-distinct-string-in-an-array
3276-minimum-number-of-pushes-to-type-word-ii

Divide and Conquer

0948-sort-an-array

Heap (Priority Queue)

0948-sort-an-array

Merge Sort

0948-sort-an-array

Bucket Sort

0948-sort-an-array

Radix Sort

0948-sort-an-array

Counting Sort

0948-sort-an-array

Dynamic Programming

1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
1511-count-number-of-teams
1756-minimum-deletions-to-make-string-balanced

Shortest Path

1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
2171-second-minimum-time-to-reach-destination
3235-minimum-cost-to-convert-string-i

Breadth-First Search

0111-minimum-depth-of-binary-tree
2171-second-minimum-time-to-reach-destination

Binary Indexed Tree

1511-count-number-of-teams

Sliding Window

2255-minimum-swaps-to-group-all-1s-together-ii

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published