Skip to content

Utkarssh11/gfg-leetcode-dsa

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

146 Commits
.Longest Palindrome in a String.cpp
.Longest Palindrome in a String.cpp
 
 
1027. Longest Arithmetic Subsequence.java
1027. Longest Arithmetic Subsequence.java
 
 
1091. Shortest Path in Binary Matrix.cpp
1091. Shortest Path in Binary Matrix.cpp
 
 
111. Minimum Depth of Binary Tree.java
111. Minimum Depth of Binary Tree.java
 
 
1140. Stone Game II.cpp
1140. Stone Game II.cpp
 
 
1146. Snapshot Array.java
1146. Snapshot Array.java
 
 
1161. Maximum Level Sum of a Binary Tree.java
1161. Maximum Level Sum of a Binary Tree.java
 
 
1218. Longest Arithmetic Subsequence of Given Difference.java
1218. Longest Arithmetic Subsequence of Given Difference.java
 
 
1232. Check If It Is a Straight Line.cpp
1232. Check If It Is a Straight Line.cpp
 
 
1318. Minimum Flips to Make a OR b Equal to.cpp
1318. Minimum Flips to Make a OR b Equal to.cpp
 
 
1351. Count Negative Numbers in a Sorted Matrix.cpp
1351. Count Negative Numbers in a Sorted Matrix.cpp
 
 
137. Single Number II.java
137. Single Number II.java
 
 
1376. Time Needed to Inform All Employees.cpp
1376. Time Needed to Inform All Employees.cpp
 
 
1396. Design Underground System.java
1396. Design Underground System.java
 
 
1406. Stone Game III.java
1406. Stone Game III.java
 
 
146. LRU Cache.java
146. LRU Cache.java
 
 
1502. Can Make Arithmetic Progression From Sequence.cpp
1502. Can Make Arithmetic Progression From Sequence.cpp
 
 
1514. Path with Maximum Probability.java
1514. Path with Maximum Probability.java
 
 
1547. Minimum Cost to Cut a Stick.java
1547. Minimum Cost to Cut a Stick.java
 
 
1575. Count All Possible Routes.java
1575. Count All Possible Routes.java
 
 
1603. Design Parking System.cpp
1603. Design Parking System.cpp
 
 
1802. Maximum Value at a Given Index in a Bounded Array.cpp
1802. Maximum Value at a Given Index in a Bounded Array.cpp
 
 
1970. Last Day Where You Can Still Cross.cpp
1970. Last Day Where You Can Still Cross.cpp
 
 
207. Course Schedule.java
207. Course Schedule.java
 
 
2090. K Radius Subarray Averages.java
2090. K Radius Subarray Averages.java
 
 
2101. Detonate the Maximum Bombs.cpp
2101. Detonate the Maximum Bombs.cpp
 
 
2272. Substring With Largest Variance.java
2272. Substring With Largest Variance.java
 
 
228. Summary Ranges.java
228. Summary Ranges.java
 
 
2305. Fair Distribution of Cookies.cpp
2305. Fair Distribution of Cookies.cpp
 
 
2328. Number of Increasing Paths in a Grid.java
2328. Number of Increasing Paths in a Grid.java
 
 
2352. Equal Row and Column Pairs.java
2352. Equal Row and Column Pairs.java
 
 
238. Product of Array Except Self.java
238. Product of Array Except Self.java
 
 
2462. Total Cost to Hire K Workers.cpp
2462. Total Cost to Hire K Workers.cpp
 
 
2485. Find the Pivot Integer.java
2485. Find the Pivot Integer.java
 
 
2542. Maximum Subsequence Score.cpp
2542. Maximum Subsequence Score.cpp
 
 
2551. Put Marbles in Bags.java
2551. Put Marbles in Bags.java
 
 
373. Find K Pairs with Smallest Sums.cpp
373. Find K Pairs with Smallest Sums.cpp
 
 
445. Add Two Numbers II.java
445. Add Two Numbers II.java
 
 
452. Minimum Number of Arrows to Burst Balloons.java
452. Minimum Number of Arrows to Burst Balloons.java
 
 
525. Contiguous Array.java
525. Contiguous Array.java
 
 
530. Minimum Absolute Difference in BST.java
530. Minimum Absolute Difference in BST.java
 
 
547. Number of Provinces.cpp
547. Number of Provinces.cpp
 
 
57. Insert Interval.java
57. Insert Interval.java
 
 
621. Task Scheduler.java
621. Task Scheduler.java
 
 
706. Design HashMap.java
706. Design HashMap.java
 
 
744. Find Smallest Letter Greater Than Target.cpp
744. Find Smallest Letter Greater Than Target.cpp
 
 
802. Find Eventual Safe States.java
802. Find Eventual Safe States.java
 
 
837. New 21 Game.java
837. New 21 Game.java
 
 
859. Buddy Strings.cpp
859. Buddy Strings.cpp
 
 
863. All Nodes Distance K in Binary Tree.java
863. All Nodes Distance K in Binary Tree.java
 
 
864. Shortest Path to Get All Keys.java
864. Shortest Path to Get All Keys.java
 
 
930. Binary Subarrays With Sum.java
930. Binary Subarrays With Sum.java
 
 
956. Tallest Billboard.java
956. Tallest Billboard.java
 
 
AVL Tree Deletion.java
AVL Tree Deletion.java
 
 
Adding Ones.py
Adding Ones.py
 
 
Arranging the array.cpp
Arranging the array.cpp
 
 
Boolean Matrix.cpp
Boolean Matrix.cpp
 
 
CamelCase Pattern Matching.py
CamelCase Pattern Matching.py
 
 
Chocolate Distribution Problem.cpp
Chocolate Distribution Problem.cpp
 
 
Construct list using given q XOR queries.java
Construct list using given q XOR queries.java
 
 
Count Pairs whose sum is equal to X.java
Count Pairs whose sum is equal to X.java
 
 
Count number of hops.java
Count number of hops.java
 
 
Delete a Node in Single Linked List.cpp
Delete a Node in Single Linked List.cpp
 
 
Delete middle element of a stack.cpp
Delete middle element of a stack.cpp
 
 
Delete nodes having greater value on right.java
Delete nodes having greater value on right.java
 
 
Delete without head pointer.java
Delete without head pointer.java
 
 
Diagonal sum in binary tree.java
Diagonal sum in binary tree.java
 
 
Express as sum of power of natural numbers.py
Express as sum of power of natural numbers.py
 
 
Expression Add Operators.py
Expression Add Operators.py
 
 
Fibonacci series up to Nth term.java
Fibonacci series up to Nth term.java
 
 
Find Maximum Equal sum of Three Stacks.cpp
Find Maximum Equal sum of Three Stacks.cpp
 
 
Find kth element of spiral matrix.cpp
Find kth element of spiral matrix.cpp
 
 
Find the Closest Element in BST.cpp
Find the Closest Element in BST.cpp
 
 
Find the Index of the First Occurrence in a String.java
Find the Index of the First Occurrence in a String.java
 
 
Find the string in grid.cpp
Find the string in grid.cpp
 
 
Find triplets with zero sum.java
Find triplets with zero sum.java
 
 
First and last occurrences of x.cpp
First and last occurrences of x.cpp
 
 
Frequency Game.cpp
Frequency Game.cpp
 
 
Implement two stacks in an array.cpp
Implement two stacks in an array.cpp
 
 
Insert an Element at the Bottom of a Stack.java
Insert an Element at the Bottom of a Stack.java
 
 
Job Sequencing Problem.java
Job Sequencing Problem.java
 
 
Largest subsquare surrounded by X.java
Largest subsquare surrounded by X.java
 
 
Leaf under budget.java
Leaf under budget.java
 
 
Least Prime Factor.cpp
Least Prime Factor.cpp
 
 
Level order traversal in spiral form.cpp
Level order traversal in spiral form.cpp
 
 
Level order traversal.java
Level order traversal.java
 
 
Linked List that is Sorted Alternatingly.java
Linked List that is Sorted Alternatingly.java
 
 
Longest K unique characters substring.java
Longest K unique characters substring.java
 
 
Longest Palindromic Subsequence.java
Longest Palindromic Subsequence.java
 
 
Longest Repeating Subsequence.cpp
Longest Repeating Subsequence.cpp
 
 
Lucky Numbers..java
Lucky Numbers..java
 
 
Matchsticks game.java
Matchsticks game.java
 
 
Maximum Depth Of Binary Tree.java
Maximum Depth Of Binary Tree.java
 
 
Maximum Diamonds.py
Maximum Diamonds.py
 
 
Maximum Identical Bowls.cpp
Maximum Identical Bowls.cpp
 
 
Merge Without Extra Space.cpp
Merge Without Extra Space.cpp
 
 
Modify Linked List-1.py
Modify Linked List-1.py
 
 
Multiply two strings.cpp
Multiply two strings.cpp
 
 
Next Happy Number.java
Next Happy Number.java
 
 
Non Repeating Character.cpp
Non Repeating Character.cpp
 
 

Repository files navigation

Problem of the Day Solutions: GeeksforGeeks and LeetCode

Welcome to our Problem of the Day Solutions page, where we provide comprehensive solutions to daily programming challenges from two renowned platforms: GeeksforGeeks and LeetCode.

GeeksforGeeks Solutions

GeeksforGeeks is a popular platform that offers a vast collection of programming problems and tutorials. Our team diligently solves the Problem of the Day from GeeksforGeeks, providing clear explanations and efficient code implementations. We break down the problem statement, discuss the approach, and present a step-by-step solution. Our solutions are designed to cater to all levels of proficiency, from beginners to advanced programmers.

LeetCode Solutions

LeetCode is widely recognized as an invaluable resource for practicing coding skills and preparing for technical interviews. Our dedicated team also solves the Problem of the Day from LeetCode, ensuring you have access to comprehensive and well-explained solutions. We analyze the problem requirements, propose effective algorithms, and present optimized code solutions. Our goal is to assist you in mastering problem-solving techniques and boosting your confidence.

About

Current POTD Streak | | Problem Of The Day | |

Topics

problem leetcode-solutions gfg daily-coding-problem gfg-solutions problemoftheday

Resources

Readme
Activity

Stars

3 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages