Mastering Subarray Problems with TAP Academy

Day 19 | Programming Classes at TAP Academy Consecutive Sub Arrays ⚡ 🚀 From “just arrays” to real problem-solving mindset 💡 Problem 1: Find the Missing Element in an Array Given: Array starts from 1, one number is missing. 🔥 Insight: Instead of checking each number → use math. int n = arr.length + 1; int totalSum = n * (n + 1) / 2; int arraySum = 0; for(int i = 0; i < arr.length; i++) { arraySum += arr[i]; } int missing = totalSum - arraySum; System.out.println(missing); ⚡ Clean. Efficient. O(n). No sorting. No extra space. 💡 Problem 2: Print Consecutive Subarrays 👉 Key idea: Two elements are consecutive if: arr[i+1] - arr[i] == 1 for(int i = 0; i < arr.length - 1; i++) { if(arr[i+1] - arr[i] == 1) { System.out.print(arr[i] + " "); } else { System.out.println(arr[i]); } } System.out.println(arr[arr.length - 1]); 💭 Lesson: Don’t blindly use 3 loops just because it’s “subarray”. Think first. Code later. 💡 Problem 3: Length of Consecutive Subarrays int count = 1; for(int i = 0; i < arr.length - 1; i++) { if(arr[i+1] - arr[i] == 1) { count++; } else { System.out.println(count); count = 1; } } System.out.println(count); 💡 Problem 4: Longest Consecutive Subarray int count = 1, max = 0; for(int i = 0; i < arr.length - 1; i++) { if(arr[i+1] - arr[i] == 1) { count++; } else { if(count > max) { max = count; } count = 1; } } if(count > max) { max = count; } System.out.println(max); 💡 Problem 5: Print Longest Consecutive Subarray int count = 1, max = 0; int endIndex = 0; for(int i = 0; i < arr.length - 1; i++) { if(arr[i+1] - arr[i] == 1) { count++; } else { if(count > max) { max = count; endIndex = i; } count = 1; } } if(count > max) { max = count; endIndex = arr.length - 1; } int startIndex = endIndex - max + 1; for(int i = startIndex; i <= endIndex; i++) { System.out.print(arr[i] + " "); } 🧠 Big takeaway from today: Patterns > Memorization Logic > Loops Thinking > Typing 🔥 Next level thinking: What if array doesn’t start from 1? What if we need longest increasing subarray? What about prime-only subarrays? That’s where real DSA begins. #DSA #Java #CodingJourney #ProblemSolving #Placements #LearningInPublic #CodingLogic #DataStructures #ProblemSolving #InterviewPrep #TAPAcademy #Upskilling #Java #Logics #Arrays #Traversal #Learning #Upskilling #Programming

Day 22 | Programming Classes at TAP Academy 🧾 Count Variations in Strings ✨ 💥 Problem 1: Count Words in a String General Approach: words = spaces + 1; Looks correct but… 👉 What if multiple spaces exist? 👉 What if spaces appear at the start/end? logic breaks. ✅ Correct Insight A word starts when: current character = space next character ≠ space 💡 Final Code public static int countWords(String s) { int count = 0; for (int i = 0; i < s.length() - 1; i++) { if (s.charAt(i) == ' ' && s.charAt(i + 1) != ' ') { count++; } } // Handle starting space edge case if (s.charAt(0) == ' ') { return count; } else { return count + 1; } } 💥 Problem 2: Count Vowels in a String 💡 Logic A character is a vowel if: 👉 It matches a, e, i, o, u (both cases) ✅ Code int count = 0; for (int i = 0; i < s.length(); i++) { char ch = s.charAt(i); if (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u' || ch == 'A' || ch == 'E' || ch == 'I' || ch == 'O' || ch == 'U') { count++; } } 💥 Problem 3: Count Consonants Mostly say: 👉 “Not vowel = consonant” ❌ Wrong. Because: digits -> not vowels special characters -> not vowels But they are NOT consonants. ✅ Proper Approach Check if character is alphabet Then check: vowel -> vowel count else -> consonant 💡 Code public static int countConsonants(String s) { int cc = 0; for (int i = 0; i < s.length(); i++) { char ch = s.charAt(i); // Check if alphabet if ((ch >= 'a' && ch <= 'z') || (ch >= 'A' && ch <= 'Z')) { // Check if NOT vowel → consonant if (!(ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u' || ch == 'A' || ch == 'E' || ch == 'I' || ch == 'O' || ch == 'U')) { cc++; } } } return cc; } 💥 Final Boss Problem 👉 Count: Vowels Consonants Numbers Special characters 💡 Code public static void countCharacters(String s) { int vc = 0, cc = 0, nc = 0, sc = 0; for (int i = 0; i < s.length(); i++) { char ch = s.charAt(i); if ((ch >= 'a' && ch <= 'z') || (ch >= 'A' && ch <= 'Z')) { if (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u' || ch == 'A' || ch == 'E' || ch == 'I' || ch == 'O' || ch == 'U') { vc++; } else { cc++; } } else if (ch >= '0' && ch <= '9') { nc++; } else { sc++; } } } #Java #Programming #CodingInterview #DataStructures #ProblemSolving #LearnToCode #Developers #CodingJourney #TechSkills #Code #InterviewPreparation #CoreJava #Upskilling #Learning #DSA #Strings #Logics #Thinking #TAPAcademy

Day 23 | Programming Classes at TAP Academy 🚨 Mastering String Problems: Logic Over Syntax You’re given a string: 👉 "he#l@lo123" Task? Remove only special characters. Sounds basic But this is where logic—not syntax—gets tested. 💥 The Real Trap Most of us write: if (ch >= 'a' && ch <= 'z' || ch >= 'A' && ch <= 'Z') { result += ch; } Looks correct. But this removes numbers too ❌ 👉 Problem: remove only special characters 👉 Your code: removes everything except alphabets That’s not solving. That’s assuming. 🧠 Core Concept Every character falls into 3 buckets: Alphabet Numeric Special character So don’t try to detect special characters (it’s messy across Unicode ❌) 👉 Instead, keep what you know is valid if ((ch >= 'a' && ch <= 'z') || (ch >= 'A' && ch <= 'Z') || (ch >= '0' && ch <= '9')) { result += ch; } 🔍 Underlying Logic Pattern Strings are immutable. So the real workflow is: ➡️ Traverse (for loop) ➡️ Extract (charAt(i)) ➡️ Validate (conditions) ➡️ Build new string String result = ""; for (int i = 0; i < s.length(); i++) { char ch = s.charAt(i); if (Character.isLetterOrDigit(ch)) { result += ch; } } ⚡ Level Up: Rearranging the String New problem: 👉 Uppercase -> Lowercase -> Numbers (remove specials) Two approaches: Approach 1 (naive): 3 loops -> O(3n) Approach 2 (optimized): 1 loop + 3 strings -> O(n) String uc="", lc="", nc=""; for(char ch : s.toCharArray()){ if(ch >= 'A' && ch <= 'Z') uc += ch; else if(ch >= 'a' && ch <= 'z') lc += ch; else if(ch >= '0' && ch <= '9') nc += ch; } return uc + lc + nc; 👉 Same result. Better thinking. 💣 The Dangerous Bug (ASCII Trap) You try to sum numbers: sum += ch; Output? ❌ 155 instead of 11 Why? 👉 '2' = 50, '4' = 52, '5' = 53 👉 You added ASCII, not actual numbers 🔥 Fix: sum += (ch - '0'); 👉 Converts char -> actual digit ⚠️ Operator Precedence Trap This looks harmless: result += ch + 32; But gives ❌ "H32E32..." Why? 👉 String + char + int -> left to right evaluation 🔥 Fix: result += (char)(ch + 32); 🔄 Case Conversion Logic (No Inbuilt Methods) Key insight: 👉 'A' → 'a' difference = 32 So: Upper → Lower → +32 Lower → Upper → -32 if(ch >= 'A' && ch <= 'Z'){ result += (char)(ch + 32); }else{ result += ch; } 🔁 Swap Case Logic if(ch >= 'A' && ch <= 'Z'){ result += (char)(ch + 32); } else if(ch >= 'a' && ch <= 'z'){ result += (char)(ch - 32); } else{ result += ch; } 👉 Clean. No shortcuts. Pure logic. #Java #CodingInterview #ProblemSolving #Developers #LearnToCode #Programming #TechCareers #CodeSmart #CoreJava #Strings #Logics #Thinking #Coding #Upskilling #Problems #Syntax #DSA #TAPAcademy #Software #Development #Learning

I’ve started writing to improve how I understand and explain concepts. My first blog focuses on a fundamental topic in programming—recursion vs iteration—and how they represent two different ways of thinking while solving problems. This is just the beginning. I’ll be writing on a mix of technical topics and general ideas going forward. Read here: https://lnkd.in/gw98ph77 #Programming #Learning #Algorithms #StudentJourney

Understanding Event Handling in Programming: How Apps Respond to Users Many beginners think events are small UI features. In reality, events are the mechanism that makes software respond to users....

Dynamic programming and discipline. You might ask, "What is the relation between these two separate concepts?" Stay with me, because they have a lot more in common than you think. You can take the core idea of the first and apply it to anything in life you want to be disciplined about. Let’s start by looking at one of my favorite programming problems: Climbing Stairs from LeetCode. The idea is simple: you are given a number of stairs, and your task is to find how many distinct ways you can climb to the top. You have two rules: you can either climb 1 or 2 steps at a time. To solve this, you need to apply dynamic programming (at least, that’s the solution I know!). Without getting too technical, to solve this problem, you don't worry about the top. You only worry about the two stairs right in front of you. That’s it. Solve that, save the solution, and use it for the next two. Follow this pattern, and you will find yourself at the top with the right solution without even noticing. Cool, right? Now, let’s apply this to life. Say you want to start a habit of running early in the morning. The alarm goes off. You hear it, and you immediately start thinking about the complex task of actually being outside running (climbing to the top). But if you apply Dynamic Programming, your task is simply to make the best move possible at that specific moment. 1. Opening your eyes. Save that. 2. Move to the next: throwing off the blanket. 3. Then, getting up. By solving these simple problems one by one, doing the best move possible every single second, and focusing only on the task in front of you, you eventually find yourself out there running. This is how I live my life every day: moment by moment, making the best move possible, and letting the magic happen.

*🚀Problem Solving with DSA - Day 51: Introduction to Dynamic Programming (DP) 🧠✨* ->Welcome to Day 51 of my 60-Day DSA Challenge! Today, we break down the mystery of DP and understand when and how to use it. 🤔 What is Dynamic Programming? ->DP is an algorithmic technique used to solve complex problems by breaking them down into simpler sub-problems. It is mainly used when these sub-problems overlap. 🏗️ The Two Pillars of DP: ->Overlapping Sub-problems: The same sub-problems are solved multiple times (e.g., in Fibonacci, to find F(5), you need F(4) and F(3). To find F(4), you again need F(3)). ->Optimal Substructure: The optimal solution to the main problem can be constructed from the optimal solutions of its sub-problems. 🛠️ The Two Approaches: There are two ways to implement DP: 1. Top-Down (Memoization) 📥 ->Method: Start with the big problem and break it down. ->Trick: Use a HashMap or Array to store the results of sub-problems. Before calculating anything, check if it's already in the "Memo." ->Style: Recursive. 2. Bottom-Up (Tabulation) 📤 ->Method: Start from the smallest sub-problems and build up to the final solution. ->Trick: Use a Table (DP Array) to fill values iteratively. ->Style: Iterative (using loops). 💡 The DP Recipe (Step-by-Step): ->Identify if it's a DP problem (Look for "Maximum," "Minimum," or "Total ways"). ->Define the State (What does dp[i] represent?). ->Find the Relation (The formula/transition). ->Base Case (Where does it start?). ->Optimize (Can we use less space?). 🧠 Challenge of the Day: ->"If a problem has optimal substructure but NO overlapping sub-problems, can we still call it a Dynamic Programming problem? Why or why not?" 📈 Progress Tracking: Current Topic: Intro to DP Status: Day 51/60 ✅ (85% Complete!) Next Up: Climbing Stairs & Fibonacci Optimization. 🧗♂️ DP is just recursion with a memory mama! 🧠 Once you get the "State Transition" logic, you'll start seeing DP everywhere. Ready to solve the classic Climbing Stairs problem tomorrow? 👇 #60DaysOfCode #DataStructures #Algorithms #DynamicProgramming #DP #SoftwareEngineering #CodingInterviews #BigO #Java #Python #TechEducation #LogicBuilding

Programmers Don’t Need to Know Much Math The most common anxiety I hear about learning to program is the notion that it requires a lot of math. Actually, most programming doesn't require math beyond basic arithmetic. In fact, being good at programming isn't that different from being good at solving Sudoku puzzles. To solve a Sudoku puzzle, the numbers from one to nine are placed in a grid with a field for each row, so each row and each 3x3 interior square of the full 9x9 game, some numbers are provided to give you a start, and you find a solution by making deductions based on these numbers. What this really means is that programming is more about thinking than calculating. Just like Sudoku, you are not doing heavy mathematics. You are looking for patterns, understanding rules, and making logical decisions step by step. You observe what is already given, you test possibilities, and you adjust when something does not work. That is exactly how coding works, too. When you write code, you are not sitting there solving complex equations. You are breaking problems into smaller parts, following instructions, and building solutions one step at a time. It is more about logic, patience, and practice than advanced math skills. So, if you have been holding back because you think you are not “good at math,” you might be worrying about the wrong thing. If you can think through problems, stay curious, and keep trying even when something does not work at first, you already have what it takes to start programming.

I Thought I Knew OOP... Until I Tried Explaining Encapsulation in One Sentence! 🚨 Ever had that moment where you think you know something… and then you realize you don’t? That was me with **Encapsulation** in Object-Oriented Programming. I thought I had it down. But when challenged to explain it in a single sentence, my mind went blank! 🤯 Encapsulation isn’t just about keeping data safe. It’s about bundling the data and methods that operate on it, hiding the internal state to protect it from outside interference. Simple, right? But putting that in one concise sentence? A whole different game! Have you ever stumbled on a seemingly simple concept? What’s your experience with explaining complex ideas? 🤔 #OOP #Encapsulation #SoftwareDevelopment #TechTalk #Programming