Are you finding it difficult to develop a habit of coding? GeeksforGeeks is providing some extra incentive to keep your motivation levels always up – The POTD (Problem Of The Day). Become a more consistent coder by solving one question every day in the GeeksforGeeks Problem Of The Day (POTD) event and stand a chance to win exciting prizes. 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.
Table of Content
What is Problem Of The Day (POTD)?
Problem Of The Day (POTD) is a daily event by GeeksforGeeks in which a coding problem is set for each day, and the users are required to solve this problem within the timespan of that day (00:00 AM to 11:59 PM-midnight), to enroll and be eligible for the prizes.
GeeksforGeeks has launched this event with the opportunity for users to “Solve one problem based on Data Structures and Algorithms every day and win exciting prizes.“
Instructions for Problem Of The Day (POTD)
- 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 number of questions answered in the past will not be considered.
- The questions will range across varying difficulties and DSA topics.
- You can solve the questions in C++, Java, Python.
- 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.
- You will not earn any GeekBit if you view the full solution or editorial before submitting the answer. This will also break your POTD streak.
- The 24 hours allotted to complete the problem will be according to Indian Standard Time and start at midnight each day.
Nomenclature for POTD (Geek Nomenclature)
Geek Nomenclature
Prizes that can be won by solving GeeksforGeeks POTD
If you have solved the GFG POTD problems, you can win exciting prizes, such as:
- GfG Merchandise
- Discount on GfG Courses
- Annual GfG Premium Subscription
Prizes that can be won by solving GeeksforGeeks POTD
GfG POTD Problems for the Month of January 2024
|
Date |
POTD Title |
Practice |
Watch |
Read |
|---|---|---|---|---|
|
1st Jan 2024 |
Array Pair Sum Divisibility Problem |
|||
|
2nd Jan 2024 |
Largest Sum Subarray of Size at least K |
|||
|
3rd Jan 2024 |
Smallest window containing 0, 1 and 2 |
|||
|
4th Jan 2024 |
Find element occuring once when all other are present thrice |
For the detailed list of POTD solutions for the previous months, please refer to below links:
- GeeksforGeeks POTD Solutions | December 2023
- GeeksforGeeks POTD Solutions | November 2023
- GeeksforGeeks POTD Solutions | October 2023
Share your approach on Twitter with the #POTDwithGFG and tag @geeksforgeeks and stand a chance to win surprise rewards. Also, Join the GFG Discord channel for some exclusive hints for POTD.