Shreya Upadhyay

SWE @Quantiphi | Building Netfree UPI | BIT Mesra '26 | Backend & AI | DSA & System Design | A sports' enthusiast

[Vaidehi @Ai_Vaidehi]

Most developers never crack high-paying jobs...

Not because they can’t code —
but because they FAIL system design.

That’s the real filter.

So I’m giving away 2 powerful resources:

• System Design for Beginners
• System Design Interview Prep

Learn how real scalable systems are built.
The same concepts used at top tech companies.

This is the skill that separates ₹5L devs from ₹50L+ engineers.

Free for a limited time.

How to get it:

1. Follow me (so I can DM you)
2. Like + RT
3. Comment “COURSE”

Ill DM

Bookmark this if you’re serious about leveling up.

[Shreya Upadhyay @shryay_]

@Ai_Vaidehi COURSE

[Shreya Upadhyay @shryay_]

@ayu_sah2 Loved it

[Shreya Upadhyay @shryay_]

@AvinashSingh_20 Network Engineering

[Shreya Upadhyay @shryay_]

@nitesh_singh5 Interested

[Shreya Upadhyay @shryay_]

@AvinashSingh_20 Me

[Shreya Upadhyay @shryay_]

@geeksforgeeks Roko

[Shreya Upadhyay @shryay_]

@nitesh_singh5 Interested

[Shreya Upadhyay @shryay_]

@BharukaShraddha Notes

[Shreya Upadhyay @shryay_]

@BharukaShraddha Didn't get

[Shreya Upadhyay @shryay_]

You can’t afford to lose carelessly, because if you fail, it’s not just you who falls short, but also all those who had their hopes pinned on you.

[Shreya Upadhyay @shryay_]

@mahammadCodes @geeksforgeeks Thanks 👍🏻

[Shreya Upadhyay @shryay_]

✅ Day 140 of #geekstreak2025!
Solved Rotten Oranges on @geeksforgeeks.
Multi-source BFS → push all rotten initially → spread rot level by level (minute by minute)
If fresh left after BFS → return -1
O(nm) time | O(nm) space
#gfg160

[Shreya Upadhyay @shryay_]

✅Day 141 of #geekstreak2025!
Solved Cycle Detection in Undirected Graph on @geeksforgeeks.
DFS + parent tracking → if a visited neighbor ≠ parent → cycle exists
Handles multiple components too
O(V+E) | O(V+E)
#gfg160

[Shreya Upadhyay @shryay_]

@mahammadCodes @geeksforgeeks Thanks 🙌🏻

[Shreya Upadhyay @shryay_]

✅ Day 139 of #geekstreak2025!
Solved BFS of Graph on @geeksforgeeks.
Start from 0 → push neighbors in given order → explore level by level
Classic breadth-first traversal
O(V+E) time | O(V) space
#gfg160

[Shreya Upadhyay @shryay_]

✅ Day 138 of #geekstreak2025!
Solved DFS of Graph on @geeksforgeeks.
Start from 0 → visit neighbors in given order → recurse & mark visited
Classic depth-first traversal
O(V+E) time | O(V) space
#gfg160

[Shreya Upadhyay @shryay_]

@ritik65477 @geeksforgeeks Yes 😊

[Shreya Upadhyay @shryay_]

✅ Day 137 of #geekstreak2025!
Solved Maximize Partitions in a String on @geeksforgeeks.
Track last occurrence of each char → extend partition until all chars’ last positions are covered → cut!
Greedy gives max partitions with unique chars
O(n) time | O(1) space
#gfg160

[Shreya Upadhyay @shryay_]

@rrrautela Welcome

[Shreya Upadhyay @shryay_]

@rrrautela Audio