Skip to content

shreeyakapoor190/leet-code

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

LeetCode Solutions

This repository has the solution to all the LeetCode problems solved by me.

LeetCode Topics

Linked List

2182-find-the-minimum-and-maximum-number-of-nodes-between-critical-points
2299-merge-nodes-in-between-zeros

Simulation

2299-merge-nodes-in-between-zeros

Array

0347-top-k-frequent-elements
1207-delete-nodes-and-return-forest
1496-lucky-numbers-in-a-matrix
2163-kth-distinct-string-in-an-array
2210-find-target-indices-after-sorting-array
2306-create-binary-tree-from-descriptions
2447-merge-similar-items

Hash Table

0347-top-k-frequent-elements
1207-delete-nodes-and-return-forest
2163-kth-distinct-string-in-an-array
2306-create-binary-tree-from-descriptions
2447-merge-similar-items

Sorting

0347-top-k-frequent-elements
2210-find-target-indices-after-sorting-array
2447-merge-similar-items

Ordered Set

2447-merge-similar-items

String

1298-reverse-substrings-between-each-pair-of-parentheses
2163-kth-distinct-string-in-an-array

Stack

1298-reverse-substrings-between-each-pair-of-parentheses

Tree

0103-binary-tree-zigzag-level-order-traversal
0450-delete-node-in-a-bst
0572-subtree-of-another-tree
0998-check-completeness-of-a-binary-tree
1207-delete-nodes-and-return-forest
2306-create-binary-tree-from-descriptions

Breadth-First Search

0103-binary-tree-zigzag-level-order-traversal
0547-number-of-provinces
0998-check-completeness-of-a-binary-tree

Binary Tree

0103-binary-tree-zigzag-level-order-traversal
0450-delete-node-in-a-bst
0572-subtree-of-another-tree
0998-check-completeness-of-a-binary-tree
1207-delete-nodes-and-return-forest
2306-create-binary-tree-from-descriptions

Depth-First Search

0547-number-of-provinces
0572-subtree-of-another-tree
1207-delete-nodes-and-return-forest

String Matching

0572-subtree-of-another-tree

Hash Function

0572-subtree-of-another-tree

Binary Search Tree

0450-delete-node-in-a-bst
2210-find-target-indices-after-sorting-array

Union Find

0547-number-of-provinces

Graph

0547-number-of-provinces

Matrix

1496-lucky-numbers-in-a-matrix

Divide and Conquer

0347-top-k-frequent-elements

Heap (Priority Queue)

0347-top-k-frequent-elements

Bucket Sort

0347-top-k-frequent-elements

Counting

0347-top-k-frequent-elements
2163-kth-distinct-string-in-an-array

Quickselect

0347-top-k-frequent-elements