Vedant

Day 39 of #GeekStreak60 🚀 Solved POTD — Partitions with Given Difference Converted partition problem into subset sum. Target = (sum + diff) / 2, then counted subsets using DP. TC: O(n * target) SC: O(target) @geeksforgeeks @NPCI_NPCI #geekstreak60 #npci #DSA #DP

Hold. The. Pose. Hold. The. Pose. Hold. The. Pose.

Happy Sunday

Day 38 of #GeekStreak60 🚀 Solved POTD — Articulation Point - II Used Tarjan’s Algo (DFS + tin & low) to find critical nodes. A node is marked if its removal increases comp. check low[child] ≥ tin[node] TC: O(V + E) SC: O(V) @geeksforgeeks @NPCI_NPCI #geekstreak60 #npci #DSA

Day 37 of #GeekStreak60 🚀 Solved POTD — Chocolates Pickup Used 3D DP (row, col1, col2) to track both robots. Tried all 9 moves and avoided double counting when they meet. Used 2D DP for space opti. TC: O(n*m²) SC: O(m²) @geeksforgeeks @NPCI_NPCI #geekstreak60 #npci #DSA

200 days of daily commitment done Got better at chess

Day 36 of #GeekStreak60 🚀 Solved POTD — Number of Ways to Arrive at Destination Used Dijkstra + path counting Tracked shortest distance to each node Counted ways when same shortest path found TC: O(E log V) SC: O(V) @geeksforgeeks @NPCI_NPCI #geekstreak60 #npci #DSA

Duolingo fun! 199 🤞

Woke up to this news!!!

Day 35 of #GeekStreak60 🚀 Solved POTD — Minimum height roots Used BFS trimming (topological approach) Removed leaves layer by layer Found centroids of the tree TC: O(V + E) SC: O(V) @geeksforgeeks @NPCI_NPCI #geekstreak60 #npci #DSA

#Day39 of learning AI & Machine Learning 🚀 Today's Learning Overview: ⭐ What is Loss Function ⭐ Types of Loss Functions (MSE, MAE, Binary Cross-Entropy, Categorical Cross-Entropy) ⭐ Role of Loss in Model Training & Optimization #deeplearning #machinelearning #ML #AI

Day 34 of #GeekStreak60 🚀 Solved POTD — Course Schedule I Used DFS with 3-state visit tracking Detected cycles in directed graph Marked nodes as processing & processed TC: O(V + E) SC: O(V) @geeksforgeeks @NPCI_NPCI #geekstreak60 #npci #DSA

Cloud Launchpad: Linux & EC2 Live Project ☁️ We are hosting an offline, hands-on session on AWS EC2 & Linux and learn how real cloud servers work. 👨‍🏫 Speaker: Dr. Siddhartha Choubey 🗓️25th March | 💻Offline | ⏰ 02:00 PM #LearnWithAWS #CloudLaunchpad

#Day38 of learning AI & Machine Learning Today's Learning Overview: ⭐ Forward Propagation ⭐ Prediction using ANN ⭐ Keras and Tensorflow #deeplearning #machinelearning #ML #AI

Day 33 of #GeekStreak60 🚀 Solved POTD — Length of Longest Cycle in a Graph Used visit tracking to detect cycles Stored step count to compute cycle length Handled single outgoing edge efficiently TC: O(V) SC: O(V) @geeksforgeeks @NPCI_NPCI #geekstreak60 #npci #DSA

Day 32 of #GeekStreak60 🚀 Solved POTD — Rotten Oranges Used BFS (multi-source) for level-wise spread Tracked fresh oranges and processed neighbors Simulated time using queue levels TC: O(N × M) SC: O(N × M) @geeksforgeeks @NPCI_NPCI #geekstreak60 #npci #DSA

Day 31 of #GeekStreak60 🚀 Solved POTD — Number of BST From Array Used Catalan numbers for counting BSTs Computed elements smaller and greater for each root Optimized using sorting + rank mapping TC: O(N log N) SC: O(N) @geeksforgeeks @NPCI_NPCI #geekstreak60 #npci #DSA

#Day37 of learning AI & Machine Learning Today's Learning Overview: ⭐ Multilayer Perceptron (MLP) ⭐ Intuition behind hidden layers ⭐ Geometric interpretation of neural networks #deeplearning #machinelearning #ML #AI

Twitter/X is cool. But it’s 100x better when you connect with people who code daily & held each other accountable If you’re into tech, AI, DSA, Web development, Designing or programming, say hi let's #connect

Day 30 of #GeekStreak60 🚀 Solved POTD — Predecessor and Successor Used inorder traversal to get sorted value Checked element smaller and greater than key Tracked predecessor and successor using traversal TC: O(N) SC: O(N) @geeksforgeeks @NPCI_NPCI #geekstreak60 #npci #DSA