160 Days Of Problem Solving

GfG 160 - 160 Days of Problem Solving

A journey through 160 days of learning and mastering problem-solving with GeeksforGeeks! From arrays to sorting, this roadmap has it all. Let's dive in!

🚀 Arrays Mastery

Unleash the power of arrays with these fundamental to advanced problems. ✨ Days Covered: 1 to 13

🗓️ Day

🚀 Problem

🌟 Level

📂 Solution

Day 1

Second Largest

🟢 Easy

Day 2

Move All Zeroes to End

🟢 Easy

Day 3

Reverse an Array

🟢 Easy

Day 4

Rotate Array

🟡 Medium

Day 5

Next Permutation

🟡 Medium

Day 6

Majority Element II

🟡 Medium

Day 7

Stock Buy and Sell – Multiple Transactions Allowed

🔴 Hard

Day 8

Stock Buy and Sell – Max One Transaction Allowed

🟢 Easy

Day 9

Minimize the Heights II

🟡 Medium

Day 10

Kadane's Algorithm

🟡 Medium

Day 11

Maximum Product Subarray

🟡 Medium

Day 12

Max Circular Subarray Sum

🔴 Hard

Day 13

Smallest Positive Missing Number

🟡 Medium

🔖 Bonus Problems

🎁 Bonus No.

🧩 Problem

🚀 Level

🔗 Solution

1

Split Array in Three Equal Sum Subarrays

🟡 Medium

2

Repetitive Addition of Digits

🟢 Easy

3

Maximize Number of 1's

🟡 Medium

4

Last Moment Before All Ants Fall Out of a Plank

🟡 Medium

📌 Additional Challenges (From my side) :

🧩 Problem

🚀 Level

🔗 Problem Link

Segregate Even and Odd Numbers

🟤 Basic

Frequencies of Limited Range Array Elements

🟢 Easy

Koko Eating Bananas

🟡 Medium

Median of 2 Sorted Arrays of Different Sizes

🔴 Hard

💡 Strings Expertise

Master the art of string manipulation with these intriguing challenges. ✨ Days Covered: 14 to 20

🗓️ Day

💡 Problem

🌟 Level

📂 Solution

Day 14

Implement Atoi

🟡 Medium

Day 15

Add Binary Strings

🟡 Medium

Day 16

Anagram

🟢 Easy

Day 17

Non-Repeating Character

🟢 Easy

Day 18

Search Pattern (KMP Algorithm)

🟡 Medium

Day 19

Min Chars to Add for Palindrome

🔴 Hard

Day 20

Strings Rotations of Each Other

🟢 Easy

🔖 Bonus Problems

🎁 Bonus No.

🧩 Problem

🚀 Level

🔗 Solution

NUM 1

Fizz Buzz

🟢 Easy

NUM 2

CamelCase Pattern Matching

🟡 Medium

NUM 3

Palindrome Sentence

🟢 Easy

NUM 4

Minimum Repeat to Make Substring

🟡 Medium

NUM 5

Longest Prefix Suffix

🔴 Hard

NUM 6

Integer to Words

🟡 Medium

📌 Additional Challenges (From my side):

🧩 Problem

🚀 Level

🔗 Problem Link

Longest Substring Containing '1'

🟤 Basic

Run Length Encoding

🟢 Easy

Reverse Each Word in a Given String

🟡 Medium

Longest Palindromic Substring in Linear Time

🔴 Hard

🔥 Sorting Challenges

Polish your sorting skills with these curated problems. ✨ Days Covered: 21 to 27

🗓️ Day

🔥 Problem

🌟 Level

📂 Solution

Day 21

Sort 0s, 1s, and 2s

🟢 Easy

Day 22

Find H-Index

🟡 Medium

Day 23

Count Inversions

🟡 Medium

Day 24

Overlapping Intervals

🟡 Medium

Day 25

Insert Interval

🟡 Medium

Day 26

Non-overlapping Intervals

🟡 Medium

Day 27

Merge Without Extra Space

🔴 Hard

🔖 Bonus Problems

🎁 Bonus No.

🧩 Problem

🚀 Level

🔗 Solution

1

Minimum sum

🟡 Medium

2

Meeting Rooms

🟢 Easy

3

Form the Largest Number

🟡 Medium

4

Make array elements unique

🟡 Medium

📌 Additional Challenges (From my side):

🧩 Problem

🚀 Level

🔗 Problem Link

Minimum Difference Pair

🟤 Basic

Intersection of Two Linked Lists

🟢 Easy

Largest Divisible Subset

🟡 Medium

Smallest Positive Integer that Cannot Be Represented as Sum

🔴 Hard

🔍 Searching Proficiency

Master the art of searching techniques with these essential problems. ✨ Days Covered: 28 to 35

🗓️ Day

🔍 Problem

🌟 Level

📂 Solution

Day 28

Number of Occurrence

🟢 Easy

Day 29

Sorted and Rotated Minimum

🟢 Easy

Day 30

Search in Rotated Sorted Array

🟡 Medium

Day 31

Peak element

🟤 Basic

Day 32

K-th element of two Arrays

🟡 Medium

Day 33

Aggressive Cows

🟡 Medium

Day 34

Allocate Minimum Pages

🟡 Medium

Day 35

Kth Missing Positive Number in a Sorted Array

🟡 Medium

🔖 Bonus Problems

🎁 Bonus No.

🧩 Problem

🚀 Level

🔗 Solution

NUM 1

Implement Lower Bound

🟢 Easy

NUM 2

Bitonic Point

🟢 Easy

NUM 3

Median of 2 Sorted Arrays of Different Sizes

🔴 Hard

NUM 4

Square Root

🟢 Easy

NUM 5

Koko Eating Bananas

🟡 Medium

NUM 6

Minimum days to make M bouquets

🟡 Medium

📌 Additional Challenges (From my side):

🧩 Problem

🚀 Level

🔗 Problem Link

Value Equal to Index Value

🟤 Basic

Next Greater Number Set Digits

🟢 Easy

Largest Divisible Subset OR Minimum Times A Has to Be Repeated Such That B is a Substring of It

🟡 Medium

Median of 2 Sorted Arrays of Different Sizes

🔴 Hard

🧮 Matrix Maneuvers

Navigate through the realm of matrices with these essential problems. ✨ Days Covered: 36 to 41

🗓️ Day

🧮 Problem

🌟 Level

📂 Solution

Day 36

Spirally traversing a matrix

🟡 Medium

Day 37

Rotate by 90 degree

🟢 Easy

Day 38

Search in a Row-Column sorted matrix

🟢 Easy

Day 39

Search in a row-wise sorted matrix

🟢 Easy

Day 40

Search in a sorted Matrix

🟡 Medium

Day 41

Set Matrix Zeroes

🟡 Medium

Note:

I'm currently interning full-time, so I can only tackle bonus problems on the weekends. I apologize for the delayed uploads and sincerely appreciate your patience! I’ll continue to share daily problems in the limited time I have, and I’m committed to bringing you more exciting challenges soon! 🙏

📌 Additional Challenges (From my side):

🧩 Problem

🚀 Level

🔗 Problem Link

Sum of elements in a matrix

🟤 Basic

Search in a Row-Column sorted matrix

🟢 Easy

Search in a sorted Matrix OR Maximum sum Rectangle

🟡 Medium

Shortest Path by Removing K walls

🔴 Hard

#️⃣ Hash Hustle

Master the art of hashing with these pivotal problems. ✨ Days Covered: 42 to 50

🗓️ Day

#️⃣ Problem

🌟 Level

📂 Solution

Day 42

Two Sum - Pair with Given Sum

🟢 Easy

Day 43

Count Pairs with Given Sum

🟢 Easy

Day 44

Find All Triplets with Zero Sum

🟡 Medium

Day 45

Intersection of Two arrays with Duplicate Elements

🟢 Easy

Day 46

Union of Arrays with Duplicates

🟢 Easy

Day 47

Longest Consecutive Subsequence

🟡 Medium

Day 48

Print Anagrams Together

🟡 Medium

Day 49

Subarrays with sum K

🟡 Medium

Day 50

Count Subarrays with given XOR

🟡 Medium

📌 Additional Challenges (From my side):

🧩 Problem

🚀 Level

🔗 Problem Link

Largest Element in Array

🟤 Basic

Kth from End of Linked List

🟢 Easy

Detect Loop in linked list OR K Sized Subarray Maximum

🟡 Medium

Clone List with Next and Random

🔴 Hard

🔄 Pointer Pursuit

Optimize your journey with the elegance of two-pointer techniques. ✨ Days Covered: 51 to 60

🗓️ Day

🔄 Problem

🌟 Level

📂 Solution

Day 51

Count all triplets with given sum in sorted array

🟡 Medium

Day 52

Count Pairs whose sum is less than target

🟡 Medium

Day 53

Sum Pair closest to target

🟢 Easy

Day 54

Pair with given sum in a sorted array

🟢 Easy

Day 55

Count the number of possible triangles

🟡 Medium

Day 56

Indexes of Subarray Sum

🟡 Medium

Day 57

Count distinct elements in every window

🟢 Easy

Day 58

Longest substring with distinct characters

🟢 Easy

Day 59

Trapping Rain Water

🔴 Hard

Day 60

Container With Most Water

🟡 Medium

📌 Additional Challenges (From my side):

🧩 Problem

🚀 Level

🔗 Problem Link

Reverse a string with spaces intact

🟤 Basic

Two sum -Pairs with 0 Sum

🟢 Easy

Remove loop in Linked List OR 3 Sum Closest

🟡 Medium

Shortest Range In BST

🔴 Hard

🗺️ Prefix Precision

Master the art of prefix sum with these essential problems. ✨ Days Covered: 61 to 64

🗓️ Day

🗺️ Problem

🌟 Level

📂 Solution

Day 61

Equilibrium Point

🟢 Easy

Day 62

Longest Subarray with Sum K

🟡 Medium

Day 63

Largest subarray of 0's and 1's

🟢 Easy

Day 64

Product array puzzle

🟢 Easy

📌 Additional Challenges (From my side):

🧩 Problem

🚀 Level

🔗 Problem Link

Farthest Index

🟤 Basic

Max Sum Subarray of size K

🟢 Easy

Longest subarray with sum divisible by K OR Subarray Sum Divisible By K

🟡 Medium

Largest rectangular sub-matrix whose sum is 0

🔴 Hard

🔗 Linked List Chronicles

Master the art of linked lists with smart manipulation and efficient designs. ✨ Days Covered: 65 to 74

🗓️ Day

🔗 Problem

🌟 Level

📂 Solution

Day 65

Reverse a Linked List

🟢 Easy

Day 66

Rotate a Linked List

🟡 Medium

Day 67

Merge two sorted linked lists

🟡 Medium

Day 68

Linked List Group Reverse

🔴 Hard

Day 69

Add Number Linked Lists

🟡 Medium

Day 70

Clone List with Next and Random

🔴 Hard

Day 71

Detect Loop in linked list

🟡 Medium

Day 72

Find the first node of loop in linked list

🟢 Easy

Day 73

Remove loop in Linked List

🟡 Medium

Day 74

LRU Cache

🔴 Hard

📌 Additional Challenges (From my side):

🧩 Problem

🚀 Level

🔗 Problem Link

Linked List Insertion At End

🟤 Basic

Kth from End of Linked List

🟢 Easy

Intersection Point in Y Shaped Linked Lists OR Flattening a Linked List

🟡 Medium

Reverse a sublist of a linked list

🔴 Hard

🌀 Recursion and Backtracking Adventure

Dive into the magical world of recursion and backtracking to crack even the trickiest problems!

Days Covered: 75 to 79

🗓️ Day

🌀 Problem

🌟 Level

📂 Solution

Day 75

Permutations of a Given String

🟡 Medium

Day 76

Implement Pow

🟡 Medium

Day 77

N-Queen Problem

🔴 Hard

Day 78

Solve the Sudoku

🔴 Hard

Day 79

Word Search

🟡 Medium

📌 Additional Challenges (From my side):

🧩 Problem

🚀 Level

🔗 Problem Link

Print 1 To N Without Loop

🟤 Basic

Josephus problem

🟢 Easy

Open the gates OR Largest number in K swaps

🟡 Medium

String Permutations

🔴 Hard

🌳 Tree Traversals and Techniques

Explore the depths of tree data structures with powerful traversal techniques!

Days Covered: 80 to 94

🗓️ Day

🌲 Problem

🌟 Level

📂 Solution

Day 80

Level Order Traversal

🟢 Easy

Day 81

Height of Binary Tree

🟢 Easy

Day 82

Diameter of a Binary Tree

🟡 Medium

Day 83

Mirror Tree

🟢 Easy

Day 84

Construct Tree from Inorder & Preorder

🟡 Medium

Day 85

Inorder Traversal

🟢 Easy

Day 86

Tree Boundary Traversal

🟡 Medium

Day 87

Maximum path sum from any node

🟡 Medium

Day 88

K Sum Paths

🟡 Medium

Day 89

Check for BST

🟢 Easy

Day 90

k-th Smallest in BST

🟡 Medium

Day 91

Pair Sum in BST

🟡 Medium

Day 92

Fixing Two nodes of a BST

🔴 Hard

Day 93

Lowest Common Ancestor in a BST

🟢 Easy

Day 94

Serialize and deserialize a binary tree

🟡 Medium

📌 Additional Challenges (From my side):

🧩 Problem

🚀 Level

🔗 Problem Link

Count Leaves in Binary Tree

🟤 Basic

Mirror Tree

🟢 Easy

Tree Boundary Traversal OR Connect Nodes at Same Level

🟡 Medium

Sorted Linked List to BST

🔴 Hard

🔺 Heap Havoc

Master the art of heaps with priority queues, min-heaps, and max-heaps!

Days Covered: 95 to 98

🗓️ Day

🔗 Problem

🌟 Level

📂 Solution

Day 95

k largest elements

🟡 Medium

Day 96

K Closest Points to Origin

🟡 Medium

Day 97

Merge K sorted linked lists

🟡 Medium

Day 98

Find median in a stream

🔴 Hard

📌 Additional Challenges (From my side):

🧩 Problem

🚀 Level

🔗 Problem Link

Height of Heap

🟤 Basic

Minimum Cost of ropes

🟢 Easy

Kth Largest in a Stream OR Merge k Sorted Arrays

🟡 Medium

Find median in a stream

🔴 Hard

🏗️ Stack Struggle

Master the art of stacks with next greater elements, valid parentheses, and more!

Days Covered: 99 to 107

🗓️ Day

🔗 Problem

🌟 Level

📂 Solution

Day 99

Parenthesis Checker

🟢 Easy

Day 100

Longest valid Parentheses

🔴 Hard

Day 101

Next Greater Element

🟡 Medium

Day 102

Stock span problem

🟡 Medium

Day 103

Histogram Max Rectangular Area

🔴 Hard

Day 104

Maximum of minimum for every window size

🔴 Hard

Day 105

Get Min from Stack

🟡 Medium

Day 106

Evaluation of Postfix Expression

🟡 Medium

Day 107

Decode the string

🟡 Medium

📌 Additional Challenges (From my side):

🧩 Problem

🚀 Level

🔗 Problem Link

Preorder Traversal

🟤 Basic

Level Order in spiral form

🟢 Easy

Get Min from Stack OR The Celebrity Problem

🟡 Medium

Max rectangle

🔴 Hard

🔃 Queue Quest & Deque Duel

Conquer queues & deques with problems on first non-repeating characters, sliding windows, and more!

Days Covered: 108 to 109

🗓️ Day

🔗 Problem

🌟 Level

📂 Solution

Day 108

K Sized Subarray Maximum

🟡 Medium

Day 109

Longest Bounded-Difference Subarray

🟡 Medium

📌 Additional Challenges (From my side):

🧩 Problem

🚀 Level

🔗 Problem Link

Queue Using Array

🟤 Basic

Level Order in spiral form OR Stack using two queues

🟢 Easy

Subarrays Product Less than K OR Stream First Non-repeating OR Rotten Oranges

🟡 Medium

🧵 Dynamic Programming Dojo

Master the art of optimal subproblems, overlapping solutions & memoized magic! 🧠💻

Days Covered: 110 to 132

🗓️ Day

🔗 Problem

🌟 Level

📂 Solution

Day 110

Longest Increasing Subsequence

🟡 Medium

Day 111

Longest String Chain

🟡 Medium

Day 112

Longest Common Subsequence

🟡 Medium

Day 113

Longest Palindromic Subsequence

🟡 Medium

Day 114

Longest Palindrome in a String

🟡 Medium

Day 115

Palindrome SubStrings

🟡 Medium

Day 116

Edit Distance

🔴 Hard

Day 117

Ways to Reach the n'th Stair

🟡 Medium

Day 118

Min Cost Climbing Stairs

🟡 Medium

Day 119

0 - 1 Knapsack Problem

🟡 Medium

Day 120

Coin Change (Count Ways)

🟡 Medium

Day 121

Coin Change (Minimum Coins)

🟡 Medium

Day 122

Minimum Jumps

🟡 Medium

Day 123

Subset Sum Problem

🟡 Medium

Day 124

Partition Equal Subset Sum

🟡 Medium

Day 125

Stock Buy and Sell – Max K Transactions Allowed

🔴 Hard

Day 126

Stock Buy and Sell – Max 2 Transactions Allowed

🔴 Hard

Day 127

Stickler Thief

🟡 Medium

Day 128

Stickler Thief II

🟡 Medium

Day 129

Total Decoding Messages

🟡 Medium

Day 130

Matrix Chain Multiplication

🔴 Hard

Day 131

Boolean Parenthesization

🔴 Hard

Day 132

Word Break

🟡 Medium

📌 Additional Challenges (From my side):

🧩 Problem

🚀 Level

🔗 Problem Link

Sum Except First and Last

🟤 Basic

Count all possible paths from top left to bottom right

🟢 Easy

Egg Dropping Puzzle OR Stock buy and sell

🟡 Medium

The Painter's Partition Problem-II

🔴 Hard

💵 Greedy Algorithm Arena

Master the art of locally optimal choices leading to globally optimal solutions! ⚡📈

Days Covered: 133 to 137

🗓️ Day

🔗 Problem

🌟 Level

📂 Solution

Day 133

Minimum Platforms

🟡 Medium

Day 134

Activity Selection

🟡 Medium

Day 135

Job Sequencing Problem

🟡 Medium

Day 136

Gas Station

🟡 Medium

Day 137

Maximize partitions in a String

🟢 Easy

📌 Additional Challenges (From my side):

🧩 Problem

🚀 Level

🔗 Problem Link

Maximum product of two numbers

🟤 Basic

Largest number with given sum

🟢 Easy

Jump Game OR Minimum Spanning Tree - Kruskal's Algorithm

🟡 Medium

Water Connection Problem

🔴 Hard

🌐 Graph Mastery Zone

Unlock the secrets of graph traversal, optimization, and pathfinding! ⚡🌍

Days Covered: 138 to 154

🗓️ Day

🔗 Problem

🌟 Level

📂 Solution

Day 138

DFS of Graph

🟢 Easy

Day 139

BFS of Graph

🟢 Easy

Day 140

Rotten Oranges

🟡 Medium

Day 141

Undirected Graph Cycle

🟡 Medium

Day 142

Find the number of islands

🟡 Medium

Day 143

Topological sort

🟡 Medium

Day 144

Directed Graph Cycle

🟡 Medium

Day 145

Bridge edge in a graph

🟡 Medium

Day 146

Articulation Point - II

🔴 Hard

Day 147

Minimum cost to connect all houses in a city

🟡 Medium

Day 148

Dijkstra Algorithm

🟡 Medium

Day 149

Flood fill Algorithm

🟡 Medium

Day 150 *

Account Merge

🔴 Hard

Day 150

Clone an Undirected Graph

🟡 Medium

Day 151

Alien Dictionary

🔴 Hard

Day 152

Bellman-Ford

🟡 Medium

Day 153

Floyd Warshall

🟡 Medium

Day 154

Minimum Weight Cycle

🔴 Hard

📌 Additional Challenges (From my side):

🧩 Problem

🚀 Level

🔗 Problem Link

Shortest path from 1 to n

🟢 Easy

Find the number of islands OR Snake and Ladder Problem

🟡 Medium

Word Ladder I OR Assignment Problem

🔴 Hard

🏁 Trie Mastery Zone

Power up your prefix operations and fast string lookups! 🔠📝

Days Covered: 155 to 156

🗓️ Day

🔗 Problem

🌟 Level

📂 Solution

Day 155

Implement Trie

🟡 Medium

Day 156

Maximum XOR of two numbers in an array

🟡 Medium

📌 Additional Challenges (From my side):

🧩 Problem

🚀 Level

🔗 Problem Link

Unique rows in boolean matrix

🟢 Easy

Open the gates OR Most frequent word in an array of strings

🟡 Medium

Word Break (Trie)

🔴 Hard

🪢 Bit Manipulation Mastery Zone

Master the art of bits — from tricks to optimization, and efficient number operations! 💡🧠

Days Covered: 157 to 160

🗓️ Day

🔗 Problem

🌟 Level

📂 Solution

Day 157

Find Only Repetitive Element from 1 to n-1

🟢 Easy

Day 158

Missing in Array

🟢 Easy

Day 159

Unique Number I

🟢 Easy

Day 160

Unique Number II

🟢 Easy

👤 Creator

Het Patel Project Maintainer

For any inquiries or feedback, please contact. Happy Contributing

🎯 Why Join This Journey?

  • 🏆 Daily structured practice for 160 days.

  • 🔍 Covers foundational concepts and advanced problem-solving techniques.

  • 🚀 Become a coding ninja ready for any technical interview!

🌟 Ready to level up? Let’s code and conquer! Feel free to fork, clone, and add your progress.

Last updated