3985. Palindromic Subarray Sum | 3754. Concatenate Non-Zero Digits and Multiply by Sum | Live Day 8

3985. Palindromic Subarray Sum | 3754. Concatenate Non-Zero Digits and Multiply by Sum I 5. Longest Palindromic Substring Welcome to Day 8 of my Software Engineering Journey! In this video, I solve problems from LeetCode Biweekly Contest 185 and share my thought process, approach, and coding solutions. This is part of a long-term series where I’ll be consistently improving my problem-solving skills and preparing for software engineering interviews. Over the coming days, I’ll be learning and documenting my progress in: ✅ Data Structures & Algorithms (DSA) ✅ LeetCode Contests ✅ Java ✅ Spring Boot ✅ PostgreSQL ✅ System Design (HLD) ✅ Low-Level Design (LLD) ✅ Backend Engineering ✅ Interview Preparation The goal is to become a stronger software engineer while building projects, learning new technologies, and sharing the entire journey publicly. If you’re also preparing for coding interviews or learning backend development, feel free to join me on this journey! About Me I’m Aman, a Software Engineer passionate about backend development, system design, and building scalable applications. Connect With Me Linkedin: linkedin.com/in/aman-meenia-b32a00206 Twitter: https://x.com/meenia_aman Series Playlist Software Engineering Journey (Day 8 → Ongoing) If you enjoyed the video, consider: 👍 Like 💬 Comment 🔔 Subscribe Let’s grow and learn together! Note: This is an unedited/raw contest-solving session. The goal is to track progress, improve consistency, and document the learning journey over time. #leetcode #coding #dsa #java #springboot #systemdesign #backenddevelopment #softwareengineer #competitiveprogramming #programming #codinginterview #leetcodecontest