Problem of The Day - Develop the Habit of Coding
Last Updated : 08 Apr, 2025
Do you find it difficult to develop a habit of Coding? If yes, then we have a most effective solution for you - all you geeks need to do is solve one programming problem each day without any break, and BOOM, the results will surprise you! Let us tell you how:

Suppose you commit to improve yourself and get better 0.1% every day for one year (very much realistic goal it is!). Now, as per the calculations - 1.01^365 = 37.78, you will actually end up being 37 times better compared to your present state by taking such small steps. This is the power of Consistency!!
If we relate it to the career goals - when you solve just a single programming problem each day for 1 year consistently then by the end of the year, you'd have solved around 365 Problems!!! Even you can say it like you would have solved a majority of the programming problems that are often asked in the interviews of tech giants - Isn't it something great...??
And don't worry, we're not only providing you with this guidance or motivation - but we are having the required platform and resources as well for you that will surely help you to keep your motivation levels always up. We are talking about the GeeksforGeeks 'Problem Of The Day' challenge where you will develop the habit of coding and become a better & consistent coder by solving 1 problem based on Data Structures and Algorithms every day and stand a chance to win exciting prizes too.
The questions will cover different topics based on Data Structures and Algorithms and you will have 24 hours to channel your inner Geek and solve the challenge. It would be like:
Each Day You Code == Great Rewards
And now when the name of 'REWARDS' has come, let us tell you the prizes at 'Problem Of The Day' include:
- Discount on GFG Courses
- GFG Merchandise
- Amazon Gift Voucher
- Annual GFG Premium Subscription
Instructions
All the details and instructions to get ahead with the 'Problem Of The Day' challenge are provided below:
- The questions will be featured from a pool of public problems from the GFG Practice Portal.
- If you are a frequent user of our Practice Portal, you may have already solved the featured Problem of the Day in the past. In that case, you must submit your solution again to maintain the streak and earn a Geek Bit.
- Only the questions given by us each day will be considered valid for earning Geek Bits. Any record of your previous submissions or the number of questions answered in the past will not be considered.
- The questions will range across varying difficulties and DSA topics.
- Each submission will be tested on our critical test data. Only a fully submitted solution will be considered for a Geek Bit.
- Each question has hints that you may use when you are stuck on a problem. Marks are deducted on hints usage, but your submission will still be considered for a Geek Bit.
- Viewing the full solution and then submitting the answer will not earn you any Geek Bit.
- The 24 hours allotted to complete the problem will be according to Indian Standard Time and start at midnight each day.
Note: You can solve the question in C++, Java, Python, JavaScript.
Okay, so now, let's understand the Geek Nomenclature to know how can you avail the prizes and rewards:
- First and foremost, solving one problem will earn you one Geek Bit.
- If you successfully solve problems for 8 consecutive days you will get 8 additional Geek Bits.
- You must have over 50 Geek Bits to be eligible for redeeming prizes.
Once you'll collect a minimum of 50 Geeks Bits, the redeem prize option will automatically pop up on your screen and then you'll be able to redeem the preferred prize of your choice!
Here is a sneak-peek to this contest:
For each contest
- Rank 1: 700 GeekBits
- Rank 2: 400 GeekBits
- Rank 3: 200 GeekBits
For each contest
- Top 50 (Rank 4 to 50): 50 GeekBits
- Participation (Score > 0): 2 GeekBits
On the monthly Leaderboard
- Top 8: additional 50 GeekBits
And yes, do encourage others also to solve POD by sharing today’s problem on Twitter. Tag @geeksforgeeks and stand a chance to win surprise rewards!!
Moreover, to prepare for the GeeksforGeeks 'Problem Of The Day' challenge - you can use various worthwhile learning resources available to you on the GFG website:
To check out the solutions of the ‘Problem Of The Day’ challenge - you can head to our GFG Practice Youtube Channel where we are live-streaming video editorials and also taking doubts for each POD on the next day at 3 PM.
You can easily get started with the 'Problem Of The Day' challenge - all you need to do is visit the GeeksforGeeks Practice Portal and there you'll find the 'Problem Of The Day' challenge link. After clicking on this particular link, you'll be redirected to a new page where you'll find all the problems, and you can start to solve the problem by clicking on the 'Solve Problem' button. So, without giving a second thought - be a part of this 'Problem Of The Day' challenge and solve 1 problem each day to develop the habit of coding in yourself!!
Similar Reads
DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on
7 min read
Basics & Prerequisites
Data Structures
Getting Started with Array Data StructureArray is a collection of items of the same variable type that are stored at contiguous memory locations. It is one of the most popular and simple data structures used in programming. Basic terminologies of ArrayArray Index: In an array, elements are identified by their indexes. Array index starts fr
14 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
3 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Hereâs the comparison of Linked List vs Arrays Linked List:
3 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
3 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes.Basics of Tree Data StructureIntroduction to TreeTypes of Trees in Data StructuresApplications of tr
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
3 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem