Siddhant Dwivedi
@sidtwts
Followers
65
Following
4K
Media
35
Statuses
1K
Developing things 👀
Pune
Joined August 2018
This robot solving a rubiks cube in 0.103 seconds is a little preview of what "AGI" really means
1K
3K
17K
No one is safe in the AI era 👀
Mark Zuckerberg, killed Bhaiya Didi’s DSA course business. Now if every company will follow this (letting candidates use AI during interview) bhaiya-didi’s will lose all their money and have to rely only on their monthly salary. 😢 AI is replacing Bhaiya-Didi’s too.
0
0
2
The most popular opinion
Unpopular/Popular opinion. Ab is still better than half the internationals at IPL. Maybe even more.
0
0
1
Bhaii notice period prr nye projects me kaam kon krwata hai 😶🌫️ #SoftwareDevelopment #SoftwareEngineering #EngineeringJobs
1
0
2
⏱️ Time: (V + E) × log V 💾 Space: V + E Dijkstra is like your GPS — it always chooses the best known path and keeps improving. Thanks for reading! If this helped, like or repost. Follow for more clear DSA threads 🙌 #DSA #algorithms #googlemap
0
0
0
You keep updating shorter paths until the queue is empty. At the end, `distance[office]` gives your answer. If it’s still infinity? There’s no path. Looks like… “Work From Home” Here’s the Java code ⬇️
1
0
0
You want to explore the quickest one first. So how do you always pick the location with least time? Use a Priority Queue (Min Heap). - Add w1 and w2 to it - Pick the min - Explore neighbors - Update time if shorter - Repeat
1
0
0
Step 1: Mark the time to all locations as infinity. You're clueless about the paths. Except home — it’s 0 mins. You're already there. Now say two roads go from home: w1 takes 5 mins, w2 takes 7 mins. Update: distance[w1] = 5, distance[w2] = 7
1
0
0
Imagine you're at home, trying to reach your office. There are multiple roads (some faster than others). You obviously want the **quickest route**. That’s what Dijkstra helps you find — the **shortest time** from source to destination in a graph with non-negative weights.
1
0
0
Ever wondered how apps like Google Maps always find the fastest route instantly? The trick? A simple but powerful algorithm — Dijkstra. Give me 1 min — I’ll explain it in the easiest way possible, and you'll never forget it.
1
0
2
You don't need to have all the answers before you begin. Starting gives clarity, and confidence . Started a freelance project with my buddy @sidtwts
0
1
2
Read “Pascal’s Triangle(Striver’s way)“ by Siddhant Dwivedi on Medium:
0
0
0
Read “Set Matrix Zeroes(Striver’s way)“ by Siddhant Dwivedi on Medium: https://t.co/Z29mQYn5o3
0
0
0
This video ❤️🔥❤️🔥
0
0
0
People on Sundays -Giving #leetcode weekly contest -Sleeping peacefully Meanwhile aktu students Going to give the end sem exam 😂 #developers
1
0
0
My leetcode worth 😂👀 Checkout yours as well https://t.co/VxIqf05RSs
#leetcode
#letsconnect
#developers
1
0
3
Finally the day has arrived Jai shree Ram #AyodhyaRamMandir
#JaiShreeRam
#AyodhyaSriRamTemple
#RamMandirPranPrathistha
0
0
0
0
0
0