Skip to content

ADITYAGABA1322/Daily-LeetCode-Challenge-Solution

Folders and files

NameName
Last commit message
Last commit date

Latest commit

Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 

Repository files navigation

Daily-LeetCode-Challenge-Solution πŸ‘€

MasterHead

Hi Everyone. It's me Aditya and Here I'm providing you Daily LeetCode Challenge Solution with a full Explanation(Line to Line)

In Nine Languages:

C++🫢 && JAVA && Python && Python3 && C && C# && JavaScript && Swift && Dart πŸ”₯

LeetCode Topics

Greedy

0045-jump-game-ii
0055-jump-game
1616-minimum-difference-between-largest-and-smallest-value-in-three-moves
1818-maximum-score-from-removing-substrings
2379-maximum-total-importance-of-roads
2538-minimum-cost-to-make-array-equal
3229-minimum-cost-to-make-array-equalindromic

Graph

1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph
1701-remove-max-number-of-edges-to-keep-graph-fully-traversable
2379-maximum-total-importance-of-roads
3271-count-the-number-of-houses-at-a-certain-distance-i

Sorting

0350-intersection-of-two-arrays-ii
0462-minimum-moves-to-equal-array-elements-ii
0726-number-of-atoms
1616-minimum-difference-between-largest-and-smallest-value-in-three-moves
2379-maximum-total-importance-of-roads
2538-minimum-cost-to-make-array-equal
2718-minimum-operations-to-make-all-array-elements-equal
2846-robot-collisions
3229-minimum-cost-to-make-array-equalindromic

Heap (Priority Queue)

2379-maximum-total-importance-of-roads

Breadth-First Search

1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph
3271-count-the-number-of-houses-at-a-certain-distance-i

Prefix Sum

2538-minimum-cost-to-make-array-equal
2718-minimum-operations-to-make-all-array-elements-equal
3271-count-the-number-of-houses-at-a-certain-distance-i

Depth-First Search

0236-lowest-common-ancestor-of-a-binary-tree
1207-delete-nodes-and-return-forest
1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph
2217-step-by-step-directions-from-a-binary-tree-node-to-another

Topological Sort

1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph

Two Pointers

0005-longest-palindromic-substring
0042-trapping-rain-water
0350-intersection-of-two-arrays-ii
0647-palindromic-substrings

String

0005-longest-palindromic-substring
0010-regular-expression-matching
0214-shortest-palindrome
0516-longest-palindromic-subsequence
0647-palindromic-substrings
0726-number-of-atoms
1298-reverse-substrings-between-each-pair-of-parentheses
1720-crawler-log-folder
1818-maximum-score-from-removing-substrings
2217-step-by-step-directions-from-a-binary-tree-node-to-another

Dynamic Programming

0005-longest-palindromic-substring
0010-regular-expression-matching
0042-trapping-rain-water
0045-jump-game-ii
0053-maximum-subarray
0055-jump-game
0062-unique-paths
0063-unique-paths-ii
0516-longest-palindromic-subsequence
0647-palindromic-substrings

Rolling Hash

0214-shortest-palindrome

String Matching

0214-shortest-palindrome

Hash Function

0214-shortest-palindrome

Union Find

1701-remove-max-number-of-edges-to-keep-graph-fully-traversable

Array

0042-trapping-rain-water
0045-jump-game-ii
0053-maximum-subarray
0055-jump-game
0063-unique-paths-ii
0307-range-sum-query-mutable
0350-intersection-of-two-arrays-ii
0453-minimum-moves-to-equal-array-elements
0462-minimum-moves-to-equal-array-elements-ii
1207-delete-nodes-and-return-forest
1293-three-consecutive-odds
1616-minimum-difference-between-largest-and-smallest-value-in-three-moves
1720-crawler-log-folder
1803-average-waiting-time
1951-find-the-winner-of-the-circular-game
2306-create-binary-tree-from-descriptions
2538-minimum-cost-to-make-array-equal
2718-minimum-operations-to-make-all-array-elements-equal
2846-robot-collisions
3229-minimum-cost-to-make-array-equalindromic

Design

0307-range-sum-query-mutable

Binary Indexed Tree

0307-range-sum-query-mutable

Segment Tree

0307-range-sum-query-mutable

Stack

0042-trapping-rain-water
0726-number-of-atoms
1298-reverse-substrings-between-each-pair-of-parentheses
1720-crawler-log-folder
1818-maximum-score-from-removing-substrings
2846-robot-collisions

Monotonic Stack

0042-trapping-rain-water

Hash Table

0350-intersection-of-two-arrays-ii
0726-number-of-atoms
1207-delete-nodes-and-return-forest
2306-create-binary-tree-from-descriptions

Binary Search

0350-intersection-of-two-arrays-ii
2538-minimum-cost-to-make-array-equal
2718-minimum-operations-to-make-all-array-elements-equal

Linked List

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

Simulation

1642-water-bottles
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

0010-regular-expression-matching
1951-find-the-winner-of-the-circular-game

Divide and Conquer

0053-maximum-subarray

Math

0062-unique-paths
0453-minimum-moves-to-equal-array-elements
0462-minimum-moves-to-equal-array-elements-ii
1642-water-bottles
1951-find-the-winner-of-the-circular-game
2645-pass-the-pillow
3229-minimum-cost-to-make-array-equalindromic

Combinatorics

0062-unique-paths

Matrix

0063-unique-paths-ii

Queue

1951-find-the-winner-of-the-circular-game

Tree

0236-lowest-common-ancestor-of-a-binary-tree
1207-delete-nodes-and-return-forest
2217-step-by-step-directions-from-a-binary-tree-node-to-another
2306-create-binary-tree-from-descriptions

Binary Tree

0236-lowest-common-ancestor-of-a-binary-tree
1207-delete-nodes-and-return-forest
2217-step-by-step-directions-from-a-binary-tree-node-to-another
2306-create-binary-tree-from-descriptions