Diwakar Upadhyay Profile
Diwakar Upadhyay

@diwa810

Followers
82
Following
165
Media
107
Statuses
186

Joined April 2025
Don't wanna be here? Send us removal request.
@diwa810
Diwakar Upadhyay
7 hours
Day 71 of #100DaysOfCode Solved 2 #POTD & 1 graph problem Max DAG Edges on #GFG → got topo order, for each node max edges = topo index, counted remaining edges 2257 on #LeetCode → built grid, traversed up/down/left/right marking visible cells as visited #Coding #DSA #Graphs
0
0
3
@diwa810
Diwakar Upadhyay
1 day
Day 70 of #100DaysOfCode Solved 2 #POTD Course Schedule II on #GFG & Delete Node from LL on #LeetCode 2-Built adj list, applied topo sort, and return the order 2-Used a set to store nodes to delete, traversed the list, and removed matching nodes #Coding #DSA #geeksforgeeks
0
0
6
@diwa810
Diwakar Upadhyay
2 days
Day 69 of #100DaysOfCode solved 2 #POTD on #GFG & #LeetCode 1->Shortest Cycle – run BFS from each node, check if a cycle exists, and keep the minimum length. 2->3289 – use a hashmap to store element frequencies and return those with freq = 2 #Coding #DSA #graph #CodingJourney
0
0
7
@diwa810
Diwakar Upadhyay
3 days
Day 68 of #100DaysOfCode Solved the #POTD on #GFG — Replace O's with X's Approach: First, pick all boundary ‘O’s and perform DFS/BFS from them to mark all connected ‘O’s as visited. Finally, convert all unvisited ‘O’s to ‘X’s. #Coding #DSA #LeetCode #CodingJourney
0
0
5
@diwa810
Diwakar Upadhyay
4 days
Day 67 of #100DaysOfCode Solved 2 #POTD — Graph Diameter on #GFG & [3370] on #LeetCode Run BFS from any node to find the farthest node, then another BFS from that node to get the graph diameter. Compute the nearest power of 2 for the number and take (pow − 1) #DSA #Coding #Graph
1
0
8
@diwa810
Diwakar Upadhyay
5 days
Day 35 of #WebDevelopment Learned Promises in #JavaScript → resolve / reject → JSON parse/stringify → fetch + response handling Understanding how to convert JSON ⇄ Object #Coding #JS #CSS #Frontend #WebDev #MERN #100DaysOfCode
0
0
4
@diwa810
Diwakar Upadhyay
5 days
Day 66 of #100DaysOfCode Solved 2 #POTD Distance of Nearest Cell having 1 (#GFG): Push all 1’s into queue and run BFS to update distances. LC 3354: Used prefix sum. If right-left ≤ 1 at index with 0, increment ops accordingly. #LeetCode #Coding #DSA #CodingJourney
1
0
9
@diwa810
Diwakar Upadhyay
6 days
Day 65 of #100DaysOfCode Solved the #POTD on #GFG Find K Smallest Sum Pair Approach Use a min-heap to store pair sums along with their ind Pop the smallest sum & push the next element from the second array with the same index from the first array #DSA #Coding #LeetCode #CPP
1
0
9
@diwa810
Diwakar Upadhyay
7 days
Day 64 of #100DaysOfCode Solved the #POTD on #GFG Minimum Cost of Rope Approach Use a Min-Heap Repeatedly pick the two smallest ropes, merge them, add the merge cost to the ans & push the new rope back Continue until only one rope #DSA #Coding #LeetCode #ProblemSolving
0
0
13
@diwa810
Diwakar Upadhyay
8 days
Day 63 of #100DaysOfCode Solved POTD (Min Steps to Halve Sum) using max-heap and halving top each step. Solved Word Ladder II by storing levels with BFS + backtracking with DFS. #dsa #gfg #leetcode #cpp #Coding #graph
1
0
8
@diwa810
Diwakar Upadhyay
9 days
Day 62 of #100DaysOfCode Solved #GFG #potd: Split Array into Subsequences. Count frequencies & track subsequences needing next number. Extend if possible, else start new subsequence of length ≥ k if not possible return false . #Coding #DSA #ProblemSolving #hashmap
0
0
8
@diwa810
Diwakar Upadhyay
10 days
Day 34 of #WebDevelopment From @rohit_negi9 bhaiya — learned about callback hell in #JavaScript and its drawbacks like poor readability and complex structure completed To-Do List project & learned to optimize the delete and done features by add the event listener outside #MERN
0
0
4
@diwa810
Diwakar Upadhyay
10 days
Day 61 of #100DaysOfCode Solved the #POTD on #GFG — K Closest Points to Origin Used a max-heap with a custom comparator. Pushed first k elements, then compared the top with each new coordinate to keep the k closest. Finally stored them in the ans array. #DSA #Coding #LeetCode
0
0
3
@diwa810
Diwakar Upadhyay
11 days
Day 60 of #100DaysOfCode Solved the #POTD on #GFG -Nearly Sorted Approach: Store the first k+1 elements in a min-heap. Then, for each remaining element, push it into the heap, pop the smallest, and place it in the array using an index pointer #DSA #LeetCode #Coding #PriorityQueue
4
0
17
@diwa810
Diwakar Upadhyay
11 days
Day 33 of #WebDevelopment from @rohit_negi9 bhaiya Today learned about #JavaScript asynchronous behavior callback queue, microtask queue, & how they work in a single-threaded JS completed 2 projects Note: JS itself is synchronous but it handles asynchronous tasks. #WebDev #MERN
0
1
4
@diwa810
Diwakar Upadhyay
12 days
Day 32 of #WebDevelopment form @rohit_negi9 bhaiya today created 6 project out of 10 Random Quote Generator Background Color Changer Love Calculator Income Tax Calculator Digital Clock Countdown Timer learn about eventDefault in #javaScript #CSS #HTML #MERN #WebDev
2
1
21
@diwa810
Diwakar Upadhyay
12 days
Day 59 of #100DaysOfCode Solved #POTD on #GeeksforGeeks - Top K Frequent Elements in an Array Approach: Count the frequency of each number, use a min-heap to keep the top K frequent elements, then extract them into an array and return #DSA #Coding #CodingJourney #Heap #Algorithms
0
0
7
@diwa810
Diwakar Upadhyay
13 days
Day 58 of #100DaysOfCode Solved 2 #POTD on #LeetCode (2011) & #GFG (Number of BST From Array). → Find Catalan number for array size using DP. → Sort array and compute number of BSTs by multiplying Catalan numbers of left and right subtrees. #DSA #Coding #Tree #Algorithms
3
0
11
@diwa810
Diwakar Upadhyay
13 days
#Practice #Animation in #CSS Created a 3D cube using transform-style: preserve-3d, positioned 6 faces, and added rotation animation. Thankyou @rohit_negi9 bhaiya. #WebDevelopment #CSS3 #3DTransform #100DaysOfCode #javascriptlearning #JavaScript
1
1
11
@diwa810
Diwakar Upadhyay
14 days
Day 57 of #100DaysOfCode solved 2 potd #gfg K closest Values store the pre order and get the target ind (low/ high) use 2 pointer to get the nearest value #LeetCode 1625: use the bfs store the added and rotated str in q & the min string in mini variable #DSA #Tree #BFS #Coding
0
0
11