Skip to content
BranchesTags

Latest commit

 

History

275 Commits

Folders and files

NameName
Last commit message
Last commit date
1D_arrays
1D_arrays
 
 
2d_array
2d_array
 
 
Linked_List
Linked_List
 
 
Trees
Trees
 
 
Two_Pointer
Two_Pointer
 
 
backtracking
backtracking
 
 
bitmasking
bitmasking
 
 
dp
dp
 
 
functions
functions
 
 
leetcode
leetcode
 
 
queue
queue
 
 
searching_sorting
searching_sorting
 
 
segment_tree
segment_tree
 
 
spoj
spoj
 
 
stacks
stacks
 
 
string
string
 
 
vectors
vectors
 
 
1025-Divisor-Game.cpp
1025-Divisor-Game.cpp
 
 
1123-Lowest-Common-Ancestor-of-Deepest-Leaves.cpp
1123-Lowest-Common-Ancestor-of-Deepest-Leaves.cpp
 
 
113-Path-Sum-II.cpp
113-Path-Sum-II.cpp
 
 
1192-Critical-Connections-in-a-Network.cpp
1192-Critical-Connections-in-a-Network.cpp
 
 
1235-Maximum-Profit-in-Job-Scheduling.cpp
1235-Maximum-Profit-in-Job-Scheduling.cpp
 
 
1239-Maximum-Length-of-a-Concatenated-String-with-Unique-Characters.cpp
1239-Maximum-Length-of-a-Concatenated-String-with-Unique-Characters.cpp
 
 
127-Word-Ladder.cpp
127-Word-Ladder.cpp
 
 
130-Surrounded-Regions.cpp
130-Surrounded-Regions.cpp
 
 
1314-Matrix-Block-Sum.cpp
1314-Matrix-Block-Sum.cpp
 
 
1319-Number-of-Operations-to-Make-Network-Connected.cpp
1319-Number-of-Operations-to-Make-Network-Connected.cpp
 
 
1334-Find-the-City-With-the-Smallest-Number-of-Neighbors-at-a-Threshold-Distance.cpp
1334-Find-the-City-With-the-Smallest-Number-of-Neighbors-at-a-Threshold-Distance.cpp
 
 
1335-Minimum-Difficulty-of-a-Job-Schedule.cpp
1335-Minimum-Difficulty-of-a-Job-Schedule.cpp
 
 
1351-Count-Negative-Numbers-in-a-Sorted-Matrix.cpp
1351-Count-Negative-Numbers-in-a-Sorted-Matrix.cpp
 
 
1379-Find-a-Corresponding-Node-of-a-Binary-Tree-in-a-Clone-of-That-Tree.cpp
1379-Find-a-Corresponding-Node-of-a-Binary-Tree-in-a-Clone-of-That-Tree.cpp
 
 
139-Word-Break.cpp
139-Word-Break.cpp
 
 
14-Longest-Common-Prefix.cpp
14-Longest-Common-Prefix.cpp
 
 
1514-Path-with-Maximum-Probability.cpp
1514-Path-with-Maximum-Probability.cpp
 
 
1631-Path-With-Minimum-Effort.cpp
1631-Path-With-Minimum-Effort.cpp
 
 
1668-Maximum-Repeating-Substring.cpp
1668-Maximum-Repeating-Substring.cpp
 
 
1707-Maximum-XOR-With-an-Element-From-Array.cpp
1707-Maximum-XOR-With-an-Element-From-Array.cpp
 
 
1976-Number-of-Ways-to-Arrive-at-Destination.cpp
1976-Number-of-Ways-to-Arrive-at-Destination.cpp
 
 
198-House-Robber.cpp
198-House-Robber.cpp
 
 
1991-Find-the-Middle-Index-in-Array.cpp
1991-Find-the-Middle-Index-in-Array.cpp
 
 
208-Implement-Trie-(Prefix-Tree).cpp
208-Implement-Trie-(Prefix-Tree).cpp
 
 
22-Generate-Parentheses.cpp
22-Generate-Parentheses.cpp
 
 
226-Invert-Binary-Tree.cpp
226-Invert-Binary-Tree.cpp
 
 
230-Kth-Smallest-Element-in-a-BST.cpp
230-Kth-Smallest-Element-in-a-BST.cpp
 
 
235-Lowest-Common-Ancestor-of-a-Binary-Search-Tree.cpp
235-Lowest-Common-Ancestor-of-a-Binary-Search-Tree.cpp
 
 
257-Binary-Tree-Paths.cpp
257-Binary-Tree-Paths.cpp
 
 
264-Ugly-Number-II.cpp
264-Ugly-Number-II.cpp
 
 
279-Perfect-Squares.cpp
279-Perfect-Squares.cpp
 
 
2900-Longest-Unequal-Adjacent-Groups-Subsequence-I.cpp
2900-Longest-Unequal-Adjacent-Groups-Subsequence-I.cpp
 
 
309-Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.cpp
309-Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.cpp
 
 
313-Super-Ugly-Number.cpp
313-Super-Ugly-Number.cpp
 
 
322-Coin-Change.cpp
322-Coin-Change.cpp
 
 
377-Combination-Sum-IV.cpp
377-Combination-Sum-IV.cpp
 
 
38-Count-and-Say.cpp
38-Count-and-Say.cpp
 
 
392-Is-Subsequence.cpp
392-Is-Subsequence.cpp
 
 
413-Arithmetic-Slices.cpp
413-Arithmetic-Slices.cpp
 
 
421-Maximum-XOR-of-Two-Numbers-in-an-Array.cpp
421-Maximum-XOR-of-Two-Numbers-in-an-Array.cpp
 
 
437-Path-Sum-III.cpp
437-Path-Sum-III.cpp
 
 
446-Arithmetic-Slices-II---Subsequence.cpp
446-Arithmetic-Slices-II---Subsequence.cpp
 
 
45-Jump-Game-II.cpp
45-Jump-Game-II.cpp
 
 
5-Longest-Palindromic-Substring.cpp
5-Longest-Palindromic-Substring.cpp
 
 
530-Minimum-Absolute-Difference-in-BST.cpp
530-Minimum-Absolute-Difference-in-BST.cpp
 
 
547-Number-of-Provinces.cpp
547-Number-of-Provinces.cpp
 
 
576-Out-of-Boundary-Paths.cpp
576-Out-of-Boundary-Paths.cpp
 
 
653-Two-Sum-IV---Input-is-a-BST.cpp
653-Two-Sum-IV---Input-is-a-BST.cpp
 
 
662-Maximum-Width-of-Binary-Tree.cpp
662-Maximum-Width-of-Binary-Tree.cpp
 
 
669-Trim-a-Binary-Search-Tree.cpp
669-Trim-a-Binary-Search-Tree.cpp
 
 
701-Insert-into-a-Binary-Search-Tree.cpp
701-Insert-into-a-Binary-Search-Tree.cpp
 
 
721-Accounts-Merge.cpp
721-Accounts-Merge.cpp
 
 
785-Is-Graph-Bipartite
785-Is-Graph-Bipartite
 
 
863-All-Nodes-Distance-K-in-Binary-Tree.cpp
863-All-Nodes-Distance-K-in-Binary-Tree.cpp
 
 
865-Smallest-Subtree-with-all-the-Deepest-Nodes.cpp
865-Smallest-Subtree-with-all-the-Deepest-Nodes.cpp
 
 
889-Construct-Binary-Tree-from-Preorder-and-Postorder-Traversal.cpp
889-Construct-Binary-Tree-from-Preorder-and-Postorder-Traversal.cpp
 
 
947-Most-Stones-Removed-with-Same-Row-or-Column.cpp
947-Most-Stones-Removed-with-Same-Row-or-Column.cpp
 
 
95-Unique-Binary-Search-Trees-II.cpp
95-Unique-Binary-Search-Trees-II.cpp
 
 
96-Unique-Binary-Search-Trees.cpp
96-Unique-Binary-Search-Trees.cpp
 
 
97-Interleaving-String.cpp
97-Interleaving-String.cpp
 
 
983-Minimum-Cost-For-Tickets.cpp
983-Minimum-Cost-For-Tickets.cpp
 
 
993-Cousins-in-Binary-Tree.cpp
993-Cousins-in-Binary-Tree.cpp
 
 
Accounts-Merge.cpp
Accounts-Merge.cpp
 
 
Bag-of-Tokens.cpp
Bag-of-Tokens.cpp
 
 
Binary-Search-Tree-Iterator.cpp
Binary-Search-Tree-Iterator.cpp
 
 
Combinations.cpp
Combinations.cpp
 
 
Continuous-Subarray-Sum.cpp
Continuous-Subarray-Sum.cpp
 
 
Count-Number-of-Nice-Subarrays.cpp
Count-Number-of-Nice-Subarrays.cpp
 
 
Count-Pairs-Whose-Sum-is-Less-than-Target.cpp
Count-Pairs-Whose-Sum-is-Less-than-Target.cpp
 
 
Count-Servers-that-Communicate.cpp
Count-Servers-that-Communicate.cpp
 
 
Count-of-Smaller-Numbers-After-Self.cpp
Count-of-Smaller-Numbers-After-Self.cpp
 
 
Daily-Temperatures.cpp
Daily-Temperatures.cpp
 
 
Delete-Operation-for-Two-Strings.cpp
Delete-Operation-for-Two-Strings.cpp
 
 
Delete-and-Earn.cpp
Delete-and-Earn.cpp
 
 
Find-Building-Where-Alice-and-Bob-Can-Meet.cpp
Find-Building-Where-Alice-and-Bob-Can-Meet.cpp
 
 
Find-the-Duplicate-Number.cpp
Find-the-Duplicate-Number.cpp
 
 
Gas-Station.cpp
Gas-Station.cpp
 
 
Generate-Binary-Strings-Without-Adjacent-Zeros.cpp
Generate-Binary-Strings-Without-Adjacent-Zeros.cpp
 
 
Generate-Parentheses.cpp
Generate-Parentheses.cpp
 
 
H-Index-II.cpp
H-Index-II.cpp
 
 
Implement-Trie-(Prefix-Tree).cpp
Implement-Trie-(Prefix-Tree).cpp
 
 
Jump-Game.cpp
Jump-Game.cpp
 
 
Letter-Case-Permutation.cpp
Letter-Case-Permutation.cpp
 
 

Repository files navigation

About
This repository is managed by LeetPush extension: https://github.com/husamahmud/LeetPush
Resources
Readme
Activity
Stars
0 stars
Watchers
1 watching
Forks
0 forks
Report repository
Releases
Packages
Contributors
Languages