Poornish Babu’s Post

🚀 Capstone Project Update – Phase 1 Completed The first phase of the capstone project “Automated Technical Interview API (Interview Lab)” has been successfully completed. 🔧 Phase 1 Overview: API Development This phase focused on building the foundation of an online coding interview system, where users can submit code and receive structured outputs. Key accomplishments: Development of a backend API using FastAPI and Uvicorn Implementation of request routing and validation Design of structured JSON responses Creation of core endpoints: GET / → Health check POST /submit → Code submission The API is fully functional and testable through Swagger UI, providing a solid base for further system development. 🧠 Key Focus Areas: Clean API design and architecture Input validation and error handling Structured and consistent response formats 🔜 Upcoming Phases: Integration with PostgreSQL for storing submissions Secure code execution using Docker containers Development of a test case evaluation engine End-to-end system integration This marks an important step toward building a scalable and secure technical interview platform. #DataScience #BackendDevelopment #FastAPI #Python #SoftwareEngineering #Projects

60-Day LeetCode Challenge – Day 44 Solved Product of Array Except Self on LeetCode. 📌 Approach: Used prefix and suffix products: First pass → store left (prefix) products Second pass → multiply with right (suffix) products using a variable 🧠 Learning: This problem builds strong intuition for space optimization and avoiding division, which is a common interview constraint. ⚡ Complexity: • Time Complexity: O(n) • Space Complexity: O(1) (excluding output array) This wasn’t just another problem — this is one of those patterns that repeats in interviews 🔁 #LeetCode #DSA #Java #Arrays #ProblemSolving #Consistency #InterviewPrep

I built CodePrep to make coding interview prep feel more like a real interview and less like grinding random problems and allow everyone to ace interviews without paying money for platforms like leetcode premium. Most prep platforms tell you whether your code passes. I wanted something that also helps with the parts that actually matter in interviews: thinking clearly, handling pressure, explaining tradeoffs, and improving from session to session. CodePrep includes: - classic coding problems across easy, medium, and hard - progressive hints and editorials - a built-in coding workspace with run, submit, notes, saved drafts and even debugging - streaks, XP, badges, leaderboard, and activity tracking - CodePair-style interview simulations for frontend, backend, and full-stack practice - Post-Interview Debrief feedback on problem framing, edge cases, code clarity, tradeoff explanation, and speed vs correctness If you want to try it, here’s the link: https://codeprep.net I’d really appreciate any feedback, especially from people who’ve done technical interviews recently. What’s one feature you wish interview prep tools had? We take feedback in the feedback link of the website so feel free to submit anything there and I will try to implement it as well #buildinpublic #webdevelopment #softwareengineering #reactjs #aws #codinginterview #interviewprep #fullstack #programming #devtools

🚀 Day 11 of My LeetCode Journey – Solved Binary Search! 💻✨ Today I worked on LeetCode #704 – Binary Search ✅ This is one of those classic problems that every developer comes across during interview preparation, and solving it really helped me strengthen my fundamentals. 📌 What the problem is about Given a sorted array and a target value, the task is to find the index of that target. If the target is not present, return -1. Example: nums = [-1,0,3,5,9,12] target = 9 ✅ Output: 4 🔍 My approach Instead of checking every element one by one, I used Binary Search. The idea is simple: Find the middle element Compare it with the target If target is greater → search right half If smaller → search left half Repeat until found This reduces the search space by half every time 🚀 What I really like about this problem is how powerful the logic is. A simple idea, but very efficient. 💡 Key takeaway This problem reminded me that understanding the right approach matters more than writing long code. ⏱ Complexity Time Complexity: O(log n) Space Complexity: O(1) Slowly building strong DSA fundamentals, one problem at a time 🔥 #LeetCode #Python #BinarySearch #DSA #ProblemSolving

🚀 𝗖𝗿𝗮𝗰𝗸𝗲𝗱 𝘁𝗵𝗲 "𝗩𝗮𝗹𝗶𝗱 𝗔𝗻𝗮𝗴𝗿𝗮𝗺" 𝗣𝗿𝗼𝗯𝗹𝗲𝗺 𝗶𝗻 𝟰 𝗗𝗶𝗳𝗳𝗲𝗿𝗲𝗻𝘁 𝗪𝗮𝘆𝘀! 𝗧𝗼𝗱𝗮𝘆 𝗜 𝗲𝘅𝗽𝗹𝗼𝗿𝗲𝗱 𝗮 𝗰𝗹𝗮𝘀𝘀𝗶𝗰 𝗶𝗻𝘁𝗲𝗿𝘃𝗶𝗲𝘄 𝗽𝗿𝗼𝗯𝗹𝗲𝗺: 👉 𝗖𝗵𝗲𝗰𝗸 𝗶𝗳 𝘁𝘄𝗼 𝘀𝘁𝗿𝗶𝗻𝗴𝘀 𝗮𝗿𝗲 𝗮𝗻𝗮𝗴𝗿𝗮𝗺𝘀 Example: "anagram" & "nagaram" → ✅ True 💡 𝗜𝗻𝘀𝘁𝗲𝗮𝗱 𝗼𝗳 𝗷𝘂𝗺𝗽𝗶𝗻𝗴 𝘁𝗼 𝗼𝗻𝗲 𝘀𝗼𝗹𝘂𝘁𝗶𝗼𝗻, 𝗜 𝗯𝗿𝗼𝗸𝗲 𝗶𝘁 𝗱𝗼𝘄𝗻 𝘀𝘁𝗲𝗽 𝗯𝘆 𝘀𝘁𝗲𝗽: 🔹 𝟭. 𝗕𝗿𝘂𝘁𝗲 𝗙𝗼𝗿𝗰𝗲 𝗔𝗽𝗽𝗿𝗼𝗮𝗰𝗵 > Compare characters one by one > Replace matched characters ⏱️ Time: O(n² / n³) 🔹 𝟮. 𝗦𝗼𝗿𝘁𝗶𝗻𝗴 𝗔𝗽𝗽𝗿𝗼𝗮𝗰𝗵 > Sort both strings and compare > Simple & clean ⏱️ Time: O(n log n) 🔹 𝟯. 𝗛𝗮𝘀𝗵𝗠𝗮𝗽 𝗔𝗽𝗽𝗿𝗼𝗮𝗰𝗵 (𝗢𝗽𝘁𝗶𝗺𝗮𝗹) > Count frequency of characters > Reduce count using second string ⏱️ Time: O(n) 🔹 𝟰. 𝗔𝗿𝗿𝗮𝘆 𝗔𝗽𝗽𝗿𝗼𝗮𝗰𝗵 (𝗠𝗼𝘀𝘁 𝗢𝗽𝘁𝗶𝗺𝗶𝘇𝗲𝗱 🔥) > Use fixed array (size 26) > Map characters using ord() ⏱️ Time: O(n), Space: O(1) 🧠 𝗞𝗲𝘆 𝗟𝗲𝗮𝗿𝗻𝗶𝗻𝗴𝘀: > Strings are immutable in Python > HashMap vs Array optimization matters > ord() helps convert characters → indices efficiently 💻 𝗜’𝘃𝗲 𝘀𝗵𝗮𝗿𝗲𝗱 𝗰𝗹𝗲𝗮𝗻, 𝗯𝗲𝗴𝗶𝗻𝗻𝗲𝗿-𝗳𝗿𝗶𝗲𝗻𝗱𝗹𝘆 𝗰𝗼𝗱𝗲 👇 🔗 GitHub: https://lnkd.in/gXiTE5FP 📌 𝗜𝗳 𝘆𝗼𝘂’𝗿𝗲 𝗽𝗿𝗲𝗽𝗮𝗿𝗶𝗻𝗴 𝗳𝗼𝗿 𝗰𝗼𝗱𝗶𝗻𝗴 𝗶𝗻𝘁𝗲𝗿𝘃𝗶𝗲𝘄𝘀, 𝘁𝗵𝗶𝘀 𝗽𝗿𝗼𝗯𝗹𝗲𝗺 𝗶𝘀 𝗮 𝗠𝗨𝗦𝗧! #Python #DSA #CodingInterview #LeetCode #Programming #SoftwareEngineering #Developers

Practice. Practice. Practice. Lots of mock interviews and prep. There are tons of interview websites including leetcode, hackerrank. Leetcode is prob your best option for software engineer interview and hackerrank for python and sql prep. And the internet is full of ML and stats questions. Practice them.

Mastering this hierarchy is the difference between writing code that "just works" and writing code that scales. 🚀 Save this cheat sheet for your next technical interview! 💾 #DataStructures #DSA #PlacementPrep #IndiaTech #SoftwareEngineering #UniqueSystemSkills #CodingFundamentals #TechInterviews #Java #Python

🚀 Day 33 of My DSA Journey | Optimized Approach 💡 Today I solved one of the classic problems from LeetCode: Merge Sorted Array 🔥 🧩 Problem Understanding Given two sorted arrays nums1 and nums2, we need to merge them into a single sorted array. Constraint: nums1 already has enough space at the end to accommodate elements of nums2. 🐢 Brute Force Approach My first thought was: Copy all elements of nums2 into nums1 Sort the entire array ⏱️ Time Complexity: O((m+n)²) 👉 Works fine, but not efficient for interviews. ⚡ Optimized Approach (Two Pointer - Reverse Merge) Then I explored the optimal solution: 💡 Key Idea: Start filling from the end of nums1 Compare elements from the back of both arrays Place the larger one at the last index 🔁 Steps: Set 3 pointers: i = m-1 (end of valid nums1) j = n-1 (end of nums2) k = m+n-1 (end of nums1 array) Compare and place elements from the back Handle remaining elements of nums2 if any 📌 Example nums1 = [1,2,3,0,0,0] nums2 = [2,5,6] Output: [1,2,2,3,5,6] ⏱️ Complexity Analysis Time: O(m+n) 🚀 Space: O(1) (In-place) 🎯 Key Learning 👉 When arrays are sorted, always think in terms of two pointers 👉 Filling from the end avoids unnecessary shifting 👉 Interviewers expect optimization, not just working code 🙏 Gratitude Grateful for continuous learning and improvement every single day 💯 🔥 Consistency Note Small steps daily → Big results over time 🚀 #DSA #LeetCode #Java #CodingJourney #ProblemSolving #100DaysOfCode #SoftwareEngineering #InterviewPrep #DataStructures #Algorithms

Understanding SOLID principles is one thing — actually applying them in real-world code is another. To make this easier, I’ve created a SOLID Principles Sheet that breaks down each principle in a simple, practical, and developer-friendly way. It covers: • Clear explanations • Real-world examples • When to use (and when not to) • Common mistakes to avoid This is something I’ve been using to strengthen my fundamentals and write cleaner, more maintainable code — and I thought it might help others too. If you’re working with object-oriented programming or preparing for interviews, this can be a great quick reference. Drop a comment or DM me if you’d like access — happy to share! And if you find this helpful, consider following DAKSH AGARWALfor more content on development, system design, and interview prep. #SOLIDPrinciples #CleanCode #SoftwareEngineering #OOP #CodingBestPractices #DeveloperGrowth

Trying to solve every LeetCode problem out there? That’s probably the slowest way to prepare. Even if you solve 2 questions daily, it will take years to go through everything. And interviews don’t test how many problems you have done. They test how you think. What actually matters? 👉 Pattern recognition Once you start spotting patterns, a lot of problems feel familiar instead of scary. Instead of random practice, try this: Pick one pattern at a time: Sliding Window Two Pointers Binary Search Graphs (BFS/DFS) Dynamic Programming Backtracking Heaps / Top K Go deep, not wide. Simple plan: → Pick 1 pattern → Solve 2 problems daily → Stick with it for a few weeks But here’s the real game changer 👇 After each problem, take 2 mins to note: What approach worked Where you got stuck What you’ll do differently next time Random practice feels productive. Structured practice actually works. If you are preparing right now, this shift can save you months. Comment "DSA" if you want a simple pattern roadmap 👍 #DSA #leetcode #codinginterview #developers #interviewpreparation