Prince Pathak

AI & ML Enthusiast 🚀
Exploring Agentic AI, LLMs & Intelligent Systems
Building Projects in Public
DSA | Python | Java | Full-Stack Development
Open to Intern

[Prince Pathak @PrincePathak_5]

Solved the Celebrity Problem using the Stack.

A great problem that tests more than just implementation—it requires careful candidate elimination, verification, and attention to edge cases. Every challenge like this strengthens my problem-solving skills.

[Prince Pathak @PrincePathak_5]

Day 32/50 of my dsa challenge
Solved problems:
1).Sort a Stack
2).Delete Middle Element of a Stack
Every problem is sharpening my understanding of stack operations and improving my problem-solving mindset. Consistency over intensity—one day, one step closer to my placement goals

[Prince Pathak @PrincePathak_5]

Day 31/50 of my dsa challenge

Solved LeetCode 496 – Next Greater Element

Today's focus was on understanding the Monotonic Stack pattern and how preprocessing with a stack + hashmap reduces the solution from O(n²) to O(n).

[Prince Pathak @PrincePathak_5]

@AshParmarr Keep going brother 💪

[Prince Pathak @PrincePathak_5]

🚀 Day 30/50 of my dsa challenge!

Solved: LeetCode 32 – Longest Valid Parentheses

A challenging stack problem that strengthened my understanding of stack patterns, matching pairs, and boundary tracking. Every difficult problem solved is another step toward placement readiness.

[Prince Pathak @PrincePathak_5]

Day 29/50 of my dsa challenge

Solved problems:
🔹 Odd Even Linked List
🔹 Longest Valid Parentheses
Today's session reinforced pointer manipulation, stack-based thinking, and handling edge cases. Every problem solved is another step toward stronger problem-solving skills.

[Prince Pathak @PrincePathak_5]

Day 28/50 of my DSA Challenge

Solved problems:
✅ LeetCode 160 – Intersection of Two Linked Lists
✅ LeetCode 203 – Remove Linked List Elements
Focused on pointer manipulation, edge cases, and writing cleaner linked list logic. One step closer to stronger problem-solving skills

[Prince Pathak @PrincePathak_5]

Day 27/50 of my DSA Challenge

Solved LeetCode 25: Reverse Nodes in k-Group today.

A great problem that strengthened my understanding of linked list manipulation, pointer handling, and reversing nodes in groups while maintaining correct connections.

[Prince Pathak @PrincePathak_5]

Day 26/50 of my DSA Challenge

Solved LeetCode 138 – Copy List with Random Pointer today

One of the trickiest linked list problems I've faced so far Learned the optimal O(n) time, O(1) extra space approach by interleaving copied nodes, assigning random pointers without a HashMap

[Prince Pathak @PrincePathak_5]

@AshParmarr @Google @vertexai Good one(keep going) 👍

[Prince Pathak @PrincePathak_5]

Day 25/50 of my DSA Challenge

Solved LeetCode 23: Merge k Sorted Lists

A great problem to strengthen understanding of Divide & Conquer, Merge Sort on Linked Lists, and efficient pointer manipulation. Every challenging problem is another step toward better problem-solving.

[Prince Pathak @PrincePathak_5]

Day 24/50 of my dsa challenge

Solved Problems:

LeetCode 143 – Reorder List
Find middle, reverse the second half, and merge both halves efficiently.
LeetCode 237 – Delete Node in a Linked List
Learned the clever O(1) trick of deleting a node when only that node is given

[Prince Pathak @PrincePathak_5]

Solved LeetCode 148 - Sort List

Learned how Merge Sort can be efficiently applied on Linked Lists:
🔹 Find middle using Slow & Fast pointers
🔹 Recursively split the list
🔹 Merge sorted halves
Achieved O(n log n) time complexity with O(log n) recursion space.

[Prince Pathak @PrincePathak_5]

Day 23/50 of my DSA Challenge

Solved LeetCode 86 - Partition List

Learned how to rearrange a linked list around a given value while maintaining the relative order of nodes.

Practiced pointer manipulation, dummy nodes & efficient linked list traversal

[Prince Pathak @PrincePathak_5]

Solved LeetCode 92: Reverse Linked List II

A great linked list problem that deepened my understanding of pointer manipulation, dummy nodes, and in-place reversal. Learned how to reconnect sublists correctly while handling edge cases without creating cycles.

[Prince Pathak @PrincePathak_5]

Day 22/50 of my dsa challenge

Solved LeetCode 24: Swap Nodes in Pairs

Learned how dummy nodes and pointer manipulation make linked list problems much cleaner and easier to handle. Every linked list problem is teaching me something new about pointer management.

[Prince Pathak @PrincePathak_5]

Solved LeetCode 19: Remove Nth Node From End of List

A great problem to practice the Fast & Slow Pointer technique in linked lists. Learned how maintaining a fixed gap between pointers helps find and remove the target node in a single traversal.

[Prince Pathak @PrincePathak_5]

🚀 Day 21/50 of my DSA Challenge

Solved LeetCode 82: Remove Duplicates from Sorted List II 🔥

✅ Mastered linked list pointer manipulation
✅ Used a dummy node to handle edge cases
✅ Removed all duplicate occurrences while keeping only distinct values

[Prince Pathak @PrincePathak_5]

Solved Merge Sorted Arrays Without Extra Space using the Gap Method (Shell Sort technique).

✅ O((n+m) log(n+m)) Time
✅ O(1) Extra Space
Learned how to treat two arrays as a single virtual array and compare elements at a shrinking gap distance.

https://t.co/9y6ptIKBYA

[Prince Pathak @PrincePathak_5]

🚀 Day 20/50 0f my dsa challenge

Solved LeetCode 88: Merge Sorted Array ✅

Learned the optimal O(m+n) approach using the three-pointer technique and merging from the end to avoid extra space.

Every problem strengthens the fundamentals. 💪