Just got First big PR merged in open source 🚀.

Learned the basics of Go and built a simple REST api for CRUD operations. Used Go with SQLite for persistent storage via storage.db.Check it out at What should I dive into next to level up in Go?.

Learned Observer Pattern today 🚀 . • Auto-update when something changes at runtime. • Heavily used in Swing. • Just like a publisher and subscriber model. #Java #DesignPatterns.

Solved Leetcode daily question .Q. Using A Robot To Print The Lexicographically Smallest String . Approach: Used freq array and stack.

Solved Leetcode Daily Question .1061. Lexicographically Smallest Equivalent String. Got 1 PR merged.

Solved Leetcode Daily Question . Approach: Use Queue to store available boxes if can't open add them again, exit if the boxes remain same. Opened issue for missing test case:.

RT @kunalstwt: mann ki baat

Mainframe . It's a high-performance computer used for large-scale, critical workloads — like banking, telecom, or government systems. It can handle millions of transactions/day with near-zero downtime. That’s why even today, banks & enterprises still rely on them. #Mainframe.

Bit disappointed but will try more harder from now on!!. #OpenSource #developer #Java #GSoC #learning

Hello, good morning!.It’s been a long time since my last post — the past few months were really chaotic, but that phase has finally ended. Semester 4 is officially over, and I’m back, ready to continue my journey to become a developer. #collegelife #LearningJourney.

Day 14 and 15 of #100DaysOfCode . Solved LeetCode Daily Challenge Question:. Q. Count Total Number of Colored Cells.Solution had O(1) time complexity . Q. Find missing and repeated value .Solution had O(n) time complexity . Got 1 more PR merged🎉.

Day 13 of #100DaysOfCode . Solved LeetCode Daily Challenge Question:.Q. Check if Number is a Sum of Powers of Three.Solution had time complexity of O(logn). Got 1 PR merged in project.

Day 12 of #100DaysOfCode . Solved LeetCode Daily Challenge Problem:.Q. Partition Array According to Given Pivot.Solution had time complexity of O(n). Made 2 PR in GSoC project

Day 11 of #100DaysOfCode . Solved LeetCode Daily Challenge Problem:.Q. Merge Two 2D Arrays by Summing Values .Solution had time complexity of O(n). Exploring my GSoC project

Day 10 of #100DaysOfCode . Solved LeetCode Daily Challenge Problem:.Q. Apply Operations to an Array.Solution had time complexity of O(n). Worked on Project!

Day 9 of #100DaysOfCode. Solved LeetCode Problem .Q. Generate Parantheses. Solved it using recursion need to optimise it further. Exams ended!

Day 8 of #100DaysOfCode. Solved LeetCode Daily Challenge Problem:.Q. Longest of Longest Fibonacci Subsequence.Solution had time complexity of O(n²). Q. Longest Common Prefix .Solution had time O(n×l) where n is number of strings and l is the length of smallest string

Day 7 of #100DaysOfCode . 🔵 Solved LeetCode Daily Challenge Problem .Q. Maximum Absolute Sum of Any Subarray .Solution had the time complexity of O(n). Q. Maximum Subarray .Solution had the time complexity of O(n). 🔵 Head First Java . - Learnt about Exceptional handling.

The journey so far has been filled with learning, debugging, and plenty of "Aha!" moments. Next goal: Mastering harder problems and improving problem-solving speed and keeping consistency.

Day 7 of #100DaysOfCode.🚀 100 LeetCode Questions Solved! . Just hit my first milestone on LeetCode—solving 100 problems across a variety of topics like Arrays, Strings, Sorting, Two Pointer, Linked List, Trees, Dynamic Programming.