README.md

leetCode

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

LeetCode Topics

String

0003-longest-substring-without-repeating-characters
0017-letter-combinations-of-a-phone-number
0020-valid-parentheses
0297-serialize-and-deserialize-binary-tree
0782-jewels-and-stones

Stack

0020-valid-parentheses
0225-implement-stack-using-queues
0232-implement-queue-using-stacks
0739-daily-temperatures

Array

0001-two-sum
0039-combination-sum
0046-permutations
0078-subsets
0108-convert-sorted-array-to-binary-search-tree
0128-longest-consecutive-sequence
0200-number-of-islands
0347-top-k-frequent-elements
0739-daily-temperatures
0747-min-cost-climbing-stairs
0860-design-circular-queue
1171-shortest-path-in-binary-matrix

Monotonic Stack

0739-daily-temperatures

Hash Table

0001-two-sum
0003-longest-substring-without-repeating-characters
0017-letter-combinations-of-a-phone-number
0128-longest-consecutive-sequence
0347-top-k-frequent-elements
0782-jewels-and-stones

Union Find

0128-longest-consecutive-sequence
0200-number-of-islands

Tree

0104-maximum-depth-of-binary-tree
0108-convert-sorted-array-to-binary-search-tree
0110-balanced-binary-tree
0226-invert-binary-tree
0236-lowest-common-ancestor-of-a-binary-tree
0297-serialize-and-deserialize-binary-tree
0543-diameter-of-binary-tree
0617-merge-two-binary-trees
0687-longest-univalue-path
0799-minimum-distance-between-bst-nodes
0975-range-sum-of-bst
1114-binary-search-tree-to-greater-sum-tree

Depth-First Search

0104-maximum-depth-of-binary-tree
0110-balanced-binary-tree
0200-number-of-islands
0226-invert-binary-tree
0236-lowest-common-ancestor-of-a-binary-tree
0297-serialize-and-deserialize-binary-tree
0332-reconstruct-itinerary
0543-diameter-of-binary-tree
0617-merge-two-binary-trees
0687-longest-univalue-path
0744-network-delay-time
0799-minimum-distance-between-bst-nodes
0803-cheapest-flights-within-k-stops
0871-keys-and-rooms
0975-range-sum-of-bst
1114-binary-search-tree-to-greater-sum-tree

Binary Tree

0104-maximum-depth-of-binary-tree
0108-convert-sorted-array-to-binary-search-tree
0110-balanced-binary-tree
0226-invert-binary-tree
0236-lowest-common-ancestor-of-a-binary-tree
0297-serialize-and-deserialize-binary-tree
0543-diameter-of-binary-tree
0617-merge-two-binary-trees
0687-longest-univalue-path
0799-minimum-distance-between-bst-nodes
0975-range-sum-of-bst
1114-binary-search-tree-to-greater-sum-tree

Breadth-First Search

0104-maximum-depth-of-binary-tree
0200-number-of-islands
0226-invert-binary-tree
0297-serialize-and-deserialize-binary-tree
0617-merge-two-binary-trees
0744-network-delay-time
0799-minimum-distance-between-bst-nodes
0803-cheapest-flights-within-k-stops
0871-keys-and-rooms
1171-shortest-path-in-binary-matrix

Matrix

0200-number-of-islands
1171-shortest-path-in-binary-matrix

Graph

0332-reconstruct-itinerary
0744-network-delay-time
0803-cheapest-flights-within-k-stops
0871-keys-and-rooms

Math

0002-add-two-numbers
0062-unique-paths
0070-climbing-stairs

Dynamic Programming

0062-unique-paths
0070-climbing-stairs
0747-min-cost-climbing-stairs
0803-cheapest-flights-within-k-stops

Memoization

0070-climbing-stairs

Combinatorics

0062-unique-paths

Heap (Priority Queue)

0347-top-k-frequent-elements
0744-network-delay-time
0803-cheapest-flights-within-k-stops

Shortest Path

0744-network-delay-time
0803-cheapest-flights-within-k-stops

Linked List

0002-add-two-numbers
0024-swap-nodes-in-pairs
0092-reverse-linked-list-ii
0328-odd-even-linked-list
0860-design-circular-queue

Recursion

0002-add-two-numbers
0024-swap-nodes-in-pairs

Design

0225-implement-stack-using-queues
0232-implement-queue-using-stacks
0297-serialize-and-deserialize-binary-tree
0860-design-circular-queue

Queue

0225-implement-stack-using-queues
0232-implement-queue-using-stacks
0860-design-circular-queue

Sliding Window

0003-longest-substring-without-repeating-characters

Divide and Conquer

0108-convert-sorted-array-to-binary-search-tree
0347-top-k-frequent-elements

Sorting

0347-top-k-frequent-elements

Bucket Sort

0347-top-k-frequent-elements

Counting

0347-top-k-frequent-elements

Quickselect

0347-top-k-frequent-elements

Backtracking

0017-letter-combinations-of-a-phone-number
0039-combination-sum
0046-permutations
0077-combinations
0078-subsets

Bit Manipulation

0078-subsets

Eulerian Circuit

0332-reconstruct-itinerary

Binary Search Tree

0108-convert-sorted-array-to-binary-search-tree
0799-minimum-distance-between-bst-nodes
0975-range-sum-of-bst
1114-binary-search-tree-to-greater-sum-tree