Ex -Intern at Reliance Jio || 365 Days Of Coding Challenge||5π C++||4 π C|| Data Structure ||problemSolving||OOPS||SQL||Computer Network|| Operating System
- Tweets 135
- Following 14
- Followers 6
- Likes 32
In this post, Iβve shared how the 60-day POTD streak powered by NPCI helped me improve my problem-solving consistency, strengthened my DSA concepts, and built a disciplined coding habit.@geeksforgeeks @NPCI_NPCI
12
π Day 60/60 β GFG Γ NPCI Challenge π―
Solved: URLify a Given String
Approach: π String Manipulation
Replaced spaces with %20 efficiently.
Completed 60 days of consistency ππͺ
#60DaysChallenge #DSA #Strings #GeeksforGeeks #NPCI
@geeksforgeeks @NPCI_NPCI @geeksforgeeks
1
15
π Day 59/60 β GFG Γ NPCI Challenge
Solved: Remove Spaces
Approach: βοΈ String Traversal
Filtered out spaces while building the result string.
#60DaysChallenge #DSA #Strings #GeeksforGeeks #NPCI
@geeksforgeeks @NPCI_NPCI @geeksforgeeks
8
π Day 58/60 β GFG Γ NPCI Challenge
Solved: Next Smallest Palindrome
Approach: π String Manipulation + Carry Handling
Mirrored digits and handled carry to form the next palindrome. πͺ
#60DaysChallenge #DSA #Strings #GeeksforGeeks #NPCI
@GeeksforGeeks @NPCI_NPCI
2
π Day 57/60 β GFG Γ NPCI Challenge
Solved: Toeplitz Matrix
Approach: π Matrix Traversal
Checked diagonals to ensure all elements are consistent. πͺ
#60DaysChallenge #DSA #Matrix #GeeksforGeeks #NPCI
@geeksforgeeks @NPCI_NPCI @geeksforgeeks
1
12
π Day 56/60 β GFG Γ NPCI Challenge
Solved: Count Increasing Subarrays
Approach: π Linear Traversal
Counted lengths of increasing segments to compute total subarrays. πͺ
#60DaysChallenge #DSA #Arrays #GeeksforGeeks #NPCI
@geeksforgeeks @NPCI_NPCI @geeksforgeeks
1
13
π Day 55/60 β GFG Γ NPCI Challenge
Solved: Sorted Subsequence of Size 3
Approach: π Preprocessing (Left Min + Right Max)
Tracked smaller on left & greater on right to find valid triplet. πͺ
#60DaysChallenge #DSA #Arrays #GeeksforGeeks #NPCI
@GeeksforGeeks @NPCI_NPCI
1
14
π Day 54/60 β GFG Γ NPCI Challenge
Solved: Intersection of Two Sorted Arrays
Approach: π Two Pointers
Traversed both arrays simultaneously to find common elements efficiently. πͺ
#60DaysChallenge #DSA #TwoPointers #GeeksforGeeks #NPCI
@GeeksforGeeks @NPCI_NPCI @geeksforgeeks
2
π Day 53/60 β GFG Γ NPCI Challenge
Solved: Segregate 0s and 1s
Approach: π Two Pointers
Separated 0s and 1s efficiently in a single traversal. πͺ
#60DaysChallenge #DSA #Arrays #GeeksforGeeks #NPCI
@geeksforgeeks @NPCI_NPCI @geeksforgeeks
1
10
π Day 52/60 β GFG Γ NPCI Challenge
Solved: Stable Marriage Problem
Approach: π GaleβShapley Algorithm (Greedy)
Matched pairs ensuring no unstable pair exists. πͺ
#60DaysChallenge #DSA #Greedy #GeeksforGeeks #NPCI
@geeksforgeeks @NPCI_NPCI @geeksforgeeks
9
π Day 51/60 β GFG Γ NPCI Challenge
Solved: Huffman Encoding
Approach: π² Greedy + Min Heap
Built optimal prefix codes using frequency-based tree construction. πͺ
#60DaysChallenge #DSA #Greedy #GeeksforGeeks #NPCI
@geeksforgeeks @NPCI_NPCI @geeksforgeeks
12
π Day 50/60 β GFG Γ NPCI Challenge
Solved: Target Sum
Approach: π― Dynamic Programming (Subset Sum Transformation)
Converted the problem into subset sum to count valid expressions. πͺ
#60DaysChallenge #DSA #DynamicProgramming #GeeksforGeeks #NPCI
@GeeksforGeeks @NPCI_NPCI
9
π Day 49/60 β GFG Γ NPCI Challenge
Solved: Gray Code
Approach: π’ Bit Manipulation
Generated sequence where consecutive numbers differ by one bit. πͺ
#60DaysChallenge #DSA #BitManipulation #GeeksforGeeks #NPCI
@GeeksforGeeks @NPCI_NPCI
2
7
π Day 48/60 β GFG Γ NPCI Challenge
Solved: Print Diagonally
Approach: π Matrix Traversal
Traversed the matrix by grouping elements based on diagonal indices. πͺ
#60DaysChallenge #DSA #Matrix #GeeksforGeeks #NPCI
@geeksforgeeks @NPCI_NPCI @geeksforgeeks
1
5
π Day 47/60 β GFG Γ NPCI Challenge
Solved: Painting the Fence
Approach: π¨ Dynamic Programming
Counted valid ways to paint fences without violating color constraints. πͺ
#60DaysChallenge #DSA #DynamicProgramming #GeeksforGeeks #NPCI
@geeksforgeeks @NPCI_NPCI
1
5
π Day 46/60 β GFG Γ NPCI Challenge
Solved: Consecutive 1's Not Allowed
Approach: π Dynamic Programming
Counted valid binary strings using Fibonacci-style DP. πͺ
#60DaysChallenge #DSA #DynamicProgramming #GeeksforGeeks #NPCI
@geeksforgeeks @NPCI_NPCI @geeksforgeeks
12
π Day 45/60 β GFG Γ NPCI Challenge
Solved: Buy Stock with Transaction Fee
Approach: π Dynamic Programming
Tracked buy/sell states while accounting for transaction fee to maximize profit.
#60DaysChallenge #DSA #DynamicProgramming #GeeksforGeeks #NPCI
@geeksforgeeks @NPCI_NPCI
6
π Day 44/60 β GFG Γ NPCI Challenge
Solved: Minimum Cost to Connect All Houses in a City
Approach: π Minimum Spanning Tree (Primβs/Kruskalβs)
Connected all houses with minimum cost using MST. πͺ
#60DaysChallenge #DSA #Graphs #GeeksforGeeks #NPCI
@geeksforgeeks @NPCI_NPCI
5
π Day 43/60 β GFG Γ NPCI Challenge
Solved: Partitions with Given Difference
Approach: π Dynamic Programming (Subset Sum)
Converted the problem into subset sum to count valid partitions. πͺ
#60DaysChallenge #DSA #DynamicProgramming #GeeksforGeeks #NPCI
@geeksforgeeks @NPCI_NPCI
3
π Day 42/60 β GFG Γ NPCI Challenge
Solved: Articulation Point β II
Approach: π DFS + Tarjanβs Algorithm
Identified critical vertices whose removal disconnects the graph. πͺ
#60DaysChallenge #DSA #Graphs #GeeksforGeeks #NPCI
@GeeksforGeeks @NPCI_NPCI @geeksforgeeks
8