Manish Srivastav’s Post

🚨 This DP problem almost looked impossible… until I broke it down step by step. Day 23 of my Backend Developer Journey — and today was all about thinking in transitions, not brute force 👇 🧠 LeetCode Deep Dive Solved Minimum Total Distance Traveled 💡 What clicked: → Sorting robots & factories simplifies decisions → DP helps track minimum cost efficiently → Key idea: assign k robots to one factory within capacity ⚡ Transition-based thinking = Game changer ⚙️ Approach Breakdown ✔️ Sort robots & factories ✔️ Use DP → dp[i][j] = min distance for first i robots using first j factories ✔️ Try assigning multiple robots to a factory (within limit) 🔗 My Submission: https://lnkd.in/gtj9xka3 ☕ Spring Boot Learning Today I strengthened my understanding of Spring Data JPA 🚀 🔹 What I Learned: 👉 Dynamic Sorting with Sort.by() 👉 Pagination using Pageable 👉 Writing cleaner and scalable repository queries 🧠 The Real Learning 👉 DP is not about memorizing patterns 👉 It’s about breaking problems into smaller decisions 👉 Backend is not just CRUD 👉 It’s about efficient data handling at scale 📘 Spring Boot Notes: https://lnkd.in/gpWQvkyK 📈 Day 23 Progress: ✅ Improved DP intuition ✅ Better understanding of scalable APIs ✅ Stronger problem-solving mindset 💬 Have you ever struggled with DP until one idea suddenly made everything click? 👇 #100DaysOfCode #BackendDevelopment #SpringBoot #Java #LeetCode #DataStructures #CodingJourney

  • text

To view or add a comment, sign in

Explore content categories