Jaswanth

JaswanthJun 20, 2026

Sometimes the best opportunities come when you least expect them. While casually scrolling through Instagram stories, I came across a post from CHANDAN KUMAR CHERIPALLY Anna, Founder of Repeatless Agency. In the story, he announced a technical challenge and mentioned that two participants would receive direct full-time opportunities. Honestly, I knew the competition would be intense. There are many talented developers participating, and getting selected is never guaranteed. But one thing I've learned throughout my journey is that opportunities are rarely won by those who hesitate—they are won by those who take action. So, without overthinking, I accepted the challenge and decided to give it my best effort. For this assignment, I performed an in-depth analysis of MailMind AI, an AI-powered Gmail intelligence platform. Instead of simply reviewing the project, I explored its architecture, workflows, technology stack, design decisions, and scalability considerations. Some of the key areas I analyzed included: 🔹 Google OAuth 2.0 Authentication Flow and JWT-based Security 🔹 Spring Boot Backend Architecture with Asynchronous Processing 🔹 Next.js Frontend Architecture and User Experience Design 🔹 Gmail API Integration and Incremental Email Synchronization 🔹 AI-Powered Email Categorization and Summarization 🔹 RAG (Retrieval-Augmented Generation) Pipeline for Intelligent Email Search 🔹 PostgreSQL + pgvector for Semantic Search and Embedding Storage 🔹 Google Gemini and NVIDIA NIM Integration Strategy 🔹 Database Design, Performance Optimizations, and System Trade-offs 🔹 Production Scalability Considerations and Future Improvements What impressed me most was not just the project itself, but the thought process behind the challenge. Instead of relying on traditional hiring methods, Chandan Anna and Repeatless Agency are encouraging people to demonstrate their skills through practical problem-solving and real-world analysis. I genuinely believe this approach helps uncover talent far more effectively than evaluating resumes alone. Whether I get selected or not, this challenge was already a valuable experience. It gave me an opportunity to study a production-grade AI application, strengthen my system design understanding, and think like an engineer responsible for building scalable software products. A heartfelt thank you to Chandan Anna and the entire Repeatless Agency team for creating opportunities that inspire developers to learn, build, and challenge themselves. Excited to see what comes next, and grateful for the learning journey so far. 🚀 Live Demo: https://lnkd.in/g3WdBgMu GitHub: https://lnkd.in/gYEKnjc7 #RepeatlessAgency #MailMindAI #SoftwareEngineering #Java #SpringBoot #NextJS #ArtificialIntelligence #GenerativeAI #RAG #SystemDesign #FullStackDevelopment #BackendDevelopment #LearningInPublic #BuildInPublic #Opportunities

JaswanthJul 22, 2026

🚀 Day 18 & Day 19 of my Daily DSA Practice Journey Over the last two days, I focused on mastering the Two Pointers pattern and advanced array optimization techniques. Problems solved: ✅ 167. Two Sum II – Input Array Is Sorted ✅ 80. Remove Duplicates from Sorted Array II ✅ 977. Squares of a Sorted Array ✅ 15. 3Sum ✅ 16. 3Sum Closest ✅ 581. Shortest Unsorted Continuous Subarray ✅ 75. Sort Colors Key learnings: 🔹 Using two pointers to optimize sorted-array problems from O(n²) to O(n). 🔹 Performing in-place array modifications with O(1) extra space. 🔹 Fixing one element and applying two pointers to solve 3Sum efficiently while handling duplicates carefully. 🔹 Understanding prefix maximum & suffix minimum scanning to find the shortest unsorted subarray in linear time. 🔹 Applying the Dutch National Flag algorithm for sorting 0s, 1s, and 2s without using a sorting library. 🔹 Improving my ability to identify the correct pattern before coding, which makes optimization much easier. Patterns practiced: 📌 Two Pointers 📌 In-place Array Manipulation 📌 Prefix/Suffix Scanning 📌 Dutch National Flag Algorithm 📌 Greedy Array Traversal One important realization from these problems is that pattern recognition is often more valuable than memorizing solutions. Once the right pattern is identified, the implementation becomes much more intuitive and efficient. Consistency + pattern recognition + optimization mindset = steady progress toward becoming a better problem solver. 💪🔥 #DSA #Java #LeetCode #100DaysOfCode #ProblemSolving #Algorithms #CodingJourney #SoftwareEngineering

JaswanthJun 16, 2026

🚀 Day 16/45 – #SDESheetChallenge 💻 Another strong day of problem solving completed ✅ Today’s focus was on: ✔️ Dynamic Programming ✔️ Greedy Strategy ✔️ Recursion & Backtracking The biggest learning today: 👉 Some problems look greedy at first, but only DP can guarantee the correct answer. 🔹 Minimum Coins Started by understanding why greedy does not always work. Example: For coins [1, 5, 6, 9] and target 11, greedy picks: ➡️ 9 + 1 + 1 = 3 coins But the optimal answer is: ✅ 5 + 6 = 2 coins Then explored: ✅ Memoization ✅ Tabulation ✅ Space Optimization This problem taught me: ✔️ Pick / Not Pick DP pattern ✔️ Overlapping subproblems ✔️ Minimum-value DP thinking ✔️ Why greedy fails in some cases 🔹 Assign Cookies This was a clean greedy problem. Core idea: Give the smallest sufficient cookie to the least greedy child. Approach: ✅ Sort students ✅ Sort cookies ✅ Use two pointers If the cookie satisfies the child, move both pointers. If not, try a bigger cookie. This problem taught me: ✔️ Greedy matching ✔️ Sorting-based optimization ✔️ Two pointer usage ✔️ Maximizing satisfied children efficiently 🔹 Subset Sum – Sum of All Subsets Started with the bitmasking approach where every subset is represented using binary choices. Then learned the recursive approach: ✅ Include the current element ✅ Exclude the current element ✅ Store the sum when recursion reaches the end This problem taught me: ✔️ Subset generation ✔️ Recursion tree thinking ✔️ Include / Exclude pattern ✔️ Generating all possible outcomes 🔹 Subset II – Unique Subsets This problem added an important twist: duplicates. Brute force approach: ➡️ Generate all subsets ➡️ Store them in a set to remove duplicates Optimal approach: ✅ Sort the array first ✅ Use backtracking ✅ Skip duplicates during recursion itself This problem taught me: ✔️ Backtracking with duplicate handling ✔️ Pruning unnecessary calls ✔️ Unique subset generation ✔️ Clean recursive problem solving 💡 Major Learnings from Day 16: ✅ DP is needed when greedy choices fail ✅ Sorting helps greedy and backtracking problems ✅ Recursion becomes easier with include/exclude thinking ✅ Duplicate handling should be done during generation ✅ Backtracking builds strong problem-solving intuition Every day of this challenge is improving my confidence in solving different patterns step by step. Consistency continues… 🚀 Excited for Day 17 🔥 #SDESheetChallenge #DSA #Java #DynamicProgramming #GreedyAlgorithms #Backtracking #Recursion #ProblemSolving #Algorithms #DataStructures #CodingJourney #LeetCode #LearningInPublic #PlacementPreparation #StriverDSA