📄️ 0001-Matchsticks Game
This is a solution to the problem of determining the number of matchsticks the first player should pick to guarantee a win in the matchsticks game.
📄️ 0001 - Value Equal to Index Value
This is a solution to the Value Equal to Index Value problem on Geeks for Geeks.
📄️ 0002 - Fascinating Number
This is a solution to the Fascinating Number problem on Geeks for Geeks.
📄️ 0003- Count Subarrays with Product Less Than K
This is a solution to the problem of counting subarrays with product less than a given value K.
📄️ 0003 - At Least Two Greater Elements
This is a solution to the At Least Two Greater Elements problem on Geeks for Geeks.
📄️ 0003 - Kadane's Algorithm
This is a solution to the Kadane's Algorithm problem on Geeks for Geeks.
📄️ 0004 - How Many Xs
This is a solution to the How Many Xs problem.
📄️ 0004 - Fibonacci Sum
This tutorial contains a complete walk-through of the Fibonacci Sum problem from the Geeks for Geeks website. It features the implementation of the solution code in three programming languages: Python, C++, and Java.
📄️ 0005 - Pascal Triangle
This is a solution to the Pascal Triangle Row problem.
📄️ 0004 - Next Happy Number
This tutorial contains a complete walk-through of the Next Happy Number problem from the Geeks for Geeks website. It features the implementation of the solution code in three programming languages: Python, C++, and Java.
📄️ 0009 - Two Repeated Elements
This is a solution to the Two Repeated Elements problem.
📄️ 0010 Paths to Reach Origin
This document explores finding the number of paths to reach the origin (0, 0) on a grid.
🗃️ Easy problems GFG
10 items
📄️ 0020 Climbing Stairs
This document explores different approaches to solving the climbing stairs problem, including recursion, memoization, tabulation, and space optimization.
📄️ 0021 Gray to Binary Equivalent
This document explores different approaches to solving the Gray to Binary Equivalent problem, including brute force, bit manipulation, and optimization techniques, in various programming languages.
📄️ 0022 Lemonade Change
This document explores different approaches to solving the lemonade change problem, including an easy C++ solution with a greedy algorithm approach.
📄️ 0022 Minimum number of jumps
find the minimum number of jumps required to reach the end of an array, given that each element represents the maximum length of the jump that can be made from that position.
📄️ 0023 Find Triplet with Zero Sum
This document explores different approaches to solving the problem of finding a triplet in an array that sums up to zero, including solutions in JavaScript, TypeScript, Python, Java, and C++.
📄️ 0024 Minimum Indexed Character
This document explores different approaches to solving the problem of finding the minimum index of a character in a string that is also present in another string, including solutions in JavaScript, TypeScript, Python, Java, and C++.
📄️ 0025 K-Nearest Neighbor
This is a solution to the K-Nearest Neighbor problem on Geeks for Geeks.
🗃️ Basic
100 items
🗃️ Easy problems
28 items
🗃️ Hard
1 item