ARJUN KUMAR SONI

Ex -Intern at Reliance Jio || 365 Days Of Coding Challenge||5🌟 C++||4 🌟 C|| Data Structure ||problemSolving||OOPS||SQL||Computer Network|| Operating System

[ARJUN KUMAR SONI @Soni490]

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

[ARJUN KUMAR SONI @Soni490]

🚀 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

[ARJUN KUMAR SONI @Soni490]

🚀 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

[ARJUN KUMAR SONI @Soni490]

🚀 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

[ARJUN KUMAR SONI @Soni490]

🚀 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

[ARJUN KUMAR SONI @Soni490]

🚀 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

[ARJUN KUMAR SONI @Soni490]

🚀 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

[ARJUN KUMAR SONI @Soni490]

🚀 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

[ARJUN KUMAR SONI @Soni490]

🚀 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

[ARJUN KUMAR SONI @Soni490]

🚀 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

[ARJUN KUMAR SONI @Soni490]

🚀 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

[ARJUN KUMAR SONI @Soni490]

🚀 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

[ARJUN KUMAR SONI @Soni490]

🚀 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

[ARJUN KUMAR SONI @Soni490]

🚀 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

[ARJUN KUMAR SONI @Soni490]

🚀 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

[ARJUN KUMAR SONI @Soni490]

🚀 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

[ARJUN KUMAR SONI @Soni490]

🚀 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

[ARJUN KUMAR SONI @Soni490]

🚀 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

[ARJUN KUMAR SONI @Soni490]

🚀 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

[ARJUN KUMAR SONI @Soni490]

🚀 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