Name		Name	Last commit message	Last commit date
Latest commit History 632 Commits
(Brute force approach) Remove Nth Node From End of List.cpp		(Brute force approach) Remove Nth Node From End of List.cpp
(O(1) space) Remove Nth Node From End of List.cpp		(O(1) space) Remove Nth Node From End of List.cpp
10-12-22.cpp		10-12-22.cpp
100. Same Tree.cpp		100. Same Tree.cpp
100166. Check if Bitwise OR Has Trailing Zeros.cpp		100166. Check if Bitwise OR Has Trailing Zeros.cpp
1171. Remove Zero Sum Consecutive Nodes from Linked List.cpp		1171. Remove Zero Sum Consecutive Nodes from Linked List.cpp
12-8-24-Kth Largest Element in a Stream.cpp		12-8-24-Kth Largest Element in a Stream.cpp
143. Reorder List.cpp		143. Reorder List.cpp
15-4-23 Sum Root to Leaf Numbers.cpp		15-4-23 Sum Root to Leaf Numbers.cpp
1514. Path with Maximum Probability.cpp		1514. Path with Maximum Probability.cpp
1544. Make The String Great(No use of reverse function).cpp		1544. Make The String Great(No use of reverse function).cpp
1544. Make The String Great.cpp		1544. Make The String Great.cpp
16-4-24 Add One Row to Tree.cpp		16-4-24 Add One Row to Tree.cpp
1609. Even Odd Tree.cpp		1609. Even Odd Tree.cpp
19. Remove Nth Node From End of List.cpp		19. Remove Nth Node From End of List.cpp
198. House Robber(TLE).cpp		198. House Robber(TLE).cpp
198. House Robber.cpp		198. House Robber.cpp
1Climbing Stairs.cpp		1Climbing Stairs.cpp
1Continuous Subarray Sum.cpp		1Continuous Subarray Sum.cpp
1Determine if String Halves Are Alike.cpp		1Determine if String Halves Are Alike.cpp
1Determine if Two Strings Are Close.cpp		1Determine if Two Strings Are Close.cpp
1Evaluate Reverse Polish Notation.cpp		1Evaluate Reverse Polish Notation.cpp
1Find Players With Zero or One Losses.cpp		1Find Players With Zero or One Losses.cpp
1Implement Queue using Stacks.cpp		1Implement Queue using Stacks.cpp
1Minimum Number of Arrows to Burst Balloons.cpp		1Minimum Number of Arrows to Burst Balloons.cpp
2 Keys Keyboard.cpp		2 Keys Keyboard.cpp
20-8-24 Stone Game II.cpp		20-8-24 Stone Game II.cpp
201. Bitwise AND of Numbers Range.cpp		201. Bitwise AND of Numbers Range.cpp
21-4-24 Find if Path Exists in Graph.cpp		21-4-24 Find if Path Exists in Graph.cpp
2285. Maximum Total Importance of Roads.cpp		2285. Maximum Total Importance of Roads.cpp
231. Power of Two.cpp		231. Power of Two.cpp
2326. Spiral Matrix IV.cpp		2326. Spiral Matrix IV.cpp
2485. Find the Pivot Integer.cpp		2485. Find the Pivot Integer.cpp
2487. Remove Nodes From Linked List.cpp		2487. Remove Nodes From Linked List.cpp
2540. Minimum Common Value.cpp		2540. Minimum Common Value.cpp
2616. Minimize the Maximum Difference of Pairs.cpp		2616. Minimize the Maximum Difference of Pairs.cpp
268. Missing Number.cpp		268. Missing Number.cpp
279. Perfect Squares.cpp		279. Perfect Squares.cpp
28-4-24Sum of Distances in Tree.cpp		28-4-24Sum of Distances in Tree.cpp
287. Find the Duplicate Number(constant Space).cpp		287. Find the Duplicate Number(constant Space).cpp
287. Find the Duplicate Number.cpp		287. Find the Duplicate Number.cpp
3005. Count Elements With Maximum Frequency.cpp		3005. Count Elements With Maximum Frequency.cpp
3069. Distribute Elements Into Two Arrays I.cpp		3069. Distribute Elements Into Two Arrays I.cpp
3075. Maximize Happiness of Selected Children.cpp		3075. Maximize Happiness of Selected Children.cpp
31-3-24Count Subarrays With Fixed Bounds.cpp		31-3-24Count Subarrays With Fixed Bounds.cpp
349. Intersection of Two Arrays.cpp		349. Intersection of Two Arrays.cpp
3Sum Closest.cpp		3Sum Closest.cpp
41. First Missing Positive.cpp		41. First Missing Positive.cpp
442. Find All Duplicates in an Array(O N space).cpp		442. Find All Duplicates in an Array(O N space).cpp
463. Island Perimeter.cpp		463. Island Perimeter.cpp
49. Group Anagrams.cpp		49. Group Anagrams.cpp
5-5-23Delete Node in a Linked List.cpp		5-5-23Delete Node in a Linked List.cpp
513. Find Bottom Left Tree Value.cpp		513. Find Bottom Left Tree Value.cpp
543. Diameter of Binary Tree.cpp		543. Diameter of Binary Tree.cpp
57. Insert Interval.cpp		57. Insert Interval.cpp
844. Backspace String Compare.cpp		844. Backspace String Compare.cpp
876. Middle of the Linked List.cpp		876. Middle of the Linked List.cpp
881. Boats to Save People.cpp		881. Boats to Save People.cpp
993. Cousins in Binary Tree.cpp		993. Cousins in Binary Tree.cpp
Add Binary(14-2-23).cpp		Add Binary(14-2-23).cpp
Add Digits(26-4-23).cpp		Add Digits(26-4-23).cpp
Add One Row to Tree.cpp		Add One Row to Tree.cpp
Add to Array-Form of Integer(15-2-23).cpp		Add to Array-Form of Integer(15-2-23).cpp
All Ancestors of a Node in a Directed Acyclic Graph.cpp		All Ancestors of a Node in a Directed Acyclic Graph.cpp
All Paths From Source to Target.cpp		All Paths From Source to Target.cpp
Amount of Time for Binary Tree to Be Infected.cpp		Amount of Time for Binary Tree to Be Infected.cpp
Append Characters to String to Make Subsequence.cpp		Append Characters to String to Make Subsequence.cpp
Arithmetic Slices II - Subsequence.cpp		Arithmetic Slices II - Subsequence.cpp
As Far from Land as Possible(TLE).cpp		As Far from Land as Possible(TLE).cpp
As Far from Land as Possible.cpp		As Far from Land as Possible.cpp
Average Salary Excluding the Minimum and Maximum Salary.cpp		Average Salary Excluding the Minimum and Maximum Salary.cpp
Average Waiting Time.cpp		Average Waiting Time.cpp
Balance a Binary Search Tree.cpp		Balance a Binary Search Tree.cpp
Best Team With No Conflicts(DP).cpp		Best Team With No Conflicts(DP).cpp
Best Team With No Conflicts.cpp		Best Team With No Conflicts.cpp
Best Time to Buy and Sell Stock with Cooldown.cpp		Best Time to Buy and Sell Stock with Cooldown.cpp
Best Time to Buy and Sell Stock(Greedy).cpp		Best Time to Buy and Sell Stock(Greedy).cpp
Binary Search Tree to Greater Sum Tree.cpp		Binary Search Tree to Greater Sum Tree.cpp
Binary Search.cpp		Binary Search.cpp
Binary Subarrays With Sum.cpp		Binary Subarrays With Sum.cpp
Binary Tree Level Order Traversal II.cpp		Binary Tree Level Order Traversal II.cpp
Binary Tree Maximum Path Sum.cpp		Binary Tree Maximum Path Sum.cpp
Binary Tree Postorder Traversal.cpp		Binary Tree Postorder Traversal.cpp
Binary Tree Preorder Traversal.cpp		Binary Tree Preorder Traversal.cpp
Binary Tree Zigzag Level Order Traversal.cpp		Binary Tree Zigzag Level Order Traversal.cpp
Boats to Save People.cpp		Boats to Save People.cpp
Break a Palindrome.cpp		Break a Palindrome.cpp
Build a Matrix With Conditions.cpp		Build a Matrix With Conditions.cpp
Bulb Switcher.cpp		Bulb Switcher.cpp
Can Make Arithmetic Progression From Sequence.cpp		Can Make Arithmetic Progression From Sequence.cpp
Can Place Flowers.cpp		Can Place Flowers.cpp
Capacity To Ship Packages Within D Days.cpp		Capacity To Ship Packages Within D Days.cpp
Cheapest Flights Within K Stops.cpp		Cheapest Flights Within K Stops.cpp
Check Completeness of a Binary Tree.cpp		Check Completeness of a Binary Tree.cpp
Check If Array Pairs Are Divisible by k.cpp		Check If Array Pairs Are Divisible by k.cpp
Check If It Is a Straight Line.cpp		Check If It Is a Straight Line.cpp
Check If Two String Arrays are Equivalent		Check If Two String Arrays are Equivalent
Check If Two String Arrays are Equivalent.cpp		Check If Two String Arrays are Equivalent.cpp
Check if the Sentence Is Pangram.cpp		Check if the Sentence Is Pangram.cpp
Checking Existence of Edge Length Limited Paths.cpp		Checking Existence of Edge Length Limited Paths.cpp

Ayushluthra2001/LeetCodePOTD

Folders and files

Latest commit

History

Repository files navigation

LeetCodePOTD

About

Topics

Resources

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages