Abhay Pratap Singh

Today Solved another Problem #Leetcode 268. Missing number and clear array patterns and also invests deep concentration to this problem in a different way not the optimal approach but this is an my approach and i have to solve my idea ...coming back with a optimised approach

Day’s DSA ✅ LeetCode 283 – Move ZeroesLearned why pointer discipline matters and how a clean O(n) overwrite approach beats swap-heavy logic.One problem, solid learning 💪 uses two approaches to solve the problem first is brute then Optimised #DSA #LeetCode #Java

Day X of DSA 🚀 Solved Remove Duplicates from Sorted Array using Two Pointers. Key learning: • i → scans the array • j → tracks position for unique elements Focused on logic & patterns, not “beats %” 💯 #DSA #LeetCode #Java #Consistency #CodingJourney

DSA Win Today! Solved LeetCode 1752 – Check if Array Is Sorted and Rotated ✅ Key insight: a sorted + rotated array has at most one break in non-decreasing order (including last → first comparison). No sorting, just clean O(n) logic 💡 #DSA #LeetCode #ProblemSolved #Java

Tomorrow's Progress! Solved 3 problem on #CodeWars Today's Progress! Solved Leetcode 75.Medium Sort colours or Dutch National Flag Problem Understand Three Pointer Approach and In - place array positioning . A clean in-place solution with O(n) time — great boost #DSA

#Today I solved some solid #DSA questions— understood two-pointer techniques, and cracked problems step-by-step on my own. 1)Move Zeroes : Classical Problem 2)Palindrome Check (Two Pointers) 3)Maximum Product of Two Elements in an Array One day at a time. #100DaysOfCode #Java

Had a great experience participating in TechQuest 2025, organized by the BCA–O–CRATES Club of GLA University this November. 💻⚙️ It was an amazing platform to explore ideas, problem-solving, and teamwork in a tech-driven environment. #TechQuest #GLAUniversity #Technology #Learn

In September 2025, I had the opportunity to participate in the “Cyberquest” workshop and quiz competition organized by the Cyberonites Club of GLA University. 💻. #Cybersecurity #GLAUniversity #Learning #TechEvents #Cyberquest

#Today's Problem #DSA #leetcode 125. Valid Palindrome Covering Edge Cases of Alphanumeric and Cases While Solving the Palindrome Problem Solved using Two Pointer Approach Also Solved #DBMS Question of Relational Algebra and knowing about the concept of Projection and Selection

#Today's Problem #DSA #Leetcode 344. Reverse String Approach = Use Two Pointer learnings = way of implementing two pointer in problems and also revised Swap case Algorithms #100DaysOfCode #learning #Java #buildinpublic

Today I tackled closure, superkeys, candidate keys & 2NF in DBMS: ✅ AD⁺ closure, AC as superkey ✅ Candidate keys: AB, BC ✅ 2NF: removed partial dependencies (B→D) ✅ Merged FDs when needed (A→C & AC→F → R(A,C,F)) ✅ Done a bunch of Good and Tricky problems 💪 Score: 9/11

@Sheetal_Singh02 Force se nahi, curiosity se seekhne ka maza hi alag hai.

Koi mujhe padne ke liye force kardo 😭😭😭 #100DaysOfCode

@Taufiq_Trails Sure Brother I am glad to connect with you. Lets follow and support each other in build in public journey

Recursion Practice – Today’s Problems Solved 3 problems today 2 Basics of Recursion and another looping series 1️⃣ Print numbers from N to 1 using recursion. 2️⃣ Calculate sum of first N numbers in Series . Simple yet powerful way to master recursion! 💻🔥 #100DaysOfCode #Java

Today, I built a solution to calculate the sum of divisors for numbers from 1 to n. 💡 For each number, I summed its divisors using a simple nested loop. ⚡️ Example: For n = 4, the total sum is 15 (1 + 3 + 4 + 7). 🔧 Next goal: Optimize using a sieve-like approach. #BuildInPublic

@codelysticX Absloutely , the Reverse Integer problem and handling 32-bit overflow is no joke—It tests your Precision and Patience

@Codewith_Abhay the Reverse Integer problem and handling 32-bit overflow is no joke—complexity and edge cases really test your skills. Great attention to detail!

Solving #LeetCode Medium – Reverse Integer (#7) Main challenge → handling overflow in 32-bit signed Range: [-2147483648 , 2147483647] Time Complexity: O(n) (n = digits, ≤10) Correctness > micro-optimizations ⚡ #100DaysOfCode #Java #Coding #DSA

Today’s DSA grind! ✅ Solved multiple pattern printing problems in Java: Inverted Pyramid Hourglass Pattern Diamond Pattern (with symmetry fixes ✨) Step by step, patterns are making me sharper 💡 Understanding difference b diamond vs hourglass #100DaysOfCode #DSA #Java

📝 Today’s Progress: 🔹 Solved Pattern Printing (Right Angled Pyramid – 1 & 2) 🔹 Learned #DBMS Concepts – ER Model, Schemas ,Intro to Normalization 🔹 Explored Computer Fundamentals – Binary Addition & Multiplication Step by step, a stronger foundation 🚀 #BuildInPublic #DSA

✨ Day X of #DSA journey ✨ Today solved Star Pattern Problems 🌟 Printed a right-angled triangle Solved Right Angled Triangle – 2 ⭐ Pattern learned: decreasing stars row by row ⬇️ #100DaysOfCode #BuildInPublic #Java #DSA