Daily Coding Challenge: Day 1 - Print Day Name

🚀 Mastering Java Through LeetCode 🧠 Day 17 of My DSA Journey Today I solved another problem from the LeetCode list to improve my understanding of arrays and prefix sum concepts. 📌 LeetCode Problem Solved Today: Q.1732. Find the Highest Altitude In this problem, a biker starts a road trip from altitude 0, and we are given an array that represents the gain or loss in altitude between points. The task is to find the highest altitude reached during the trip. Method 1: Using ArrayList (My 1st Approach) I stored all altitudes step by step in an ArrayList and then used Collections.max() to find the highest altitude. Method 2: Optimized Approach (My Second Approach Without Extra Space) Instead of storing all values, we can directly track the maximum altitude while iterating. 💻 Optimized Java Solution class Solution { public int largestAltitude(int[] gain) { int altitude = 0; int maxAltitude = 0; for (int g : gain) { altitude += g; maxAltitude = Math.max(maxAltitude, altitude); } return maxAltitude; } } Example: Input: gain = [-5,1,5,0,-7] Altitudes formed: [0, -5, -4, 1, 1, -6] Highest altitude = 1 Consistent practice is helping me strengthen my DSA and problem-solving skills step by step. #LeetCode #DSA #Java #CodingJourney #ProblemSolving #ArrayList #100DaysOfCode #SPPU #EngineeringLife #TechCommunity #CDAC

🚀 Want to understand how ArrayList really works in Java? In this short video, I break down the basics of the List interface and show how ArrayList handles: ✅ adding elements ✅ resizing when full ✅ inserting at a specific index ✅ removing elements ✅ fast access with get(i) A simple visual explanation of one of the most used data structures in Java. Perfect for beginners, students, and anyone sharpening their DSA fundamentals. 💡☕ #Java #ArrayList #DataStructures #Algorithms #Programming #SoftwareDevelopment #Coding #JavaDeveloper #LearnToCode #ComputerScience #DSA #BackendDevelopment #Developers #TechEducation #CodeNewbie

🚀 Week 9 Completed – #100DaysOfCode | DSA in Java Continuing the journey with consistent progress and deeper problem-solving. This week I focused on advanced tree concepts and sliding window technique, which are crucial for coding interviews. 📌 Topics Covered This Week: 🔹 Binary Search Trees (BST) Learned BST properties and operations Solved problems like finding the largest BST in a Binary Tree 🔹 Binary Trees (Advanced) Practiced problems like sum of left leaves Strengthened recursive thinking and tree traversal logic 🔹 Sliding Window Technique Applied sliding window approach to optimize subarray problems Implemented maximum subarray sum using sliding window 📌 Previously Covered Foundation: ✔ Arrays, Strings, Bit Manipulation ✔ Recursion & Backtracking ✔ Linked List, Stack, Queue ✔ Greedy Algorithms & Binary Trees 🧠 Key Learnings • Tree-based problems require a strong understanding of recursion and structure • Sliding window significantly reduces time complexity from O(n²) to O(n) • Choosing the right approach is becoming more intuitive with practice • Focus is now shifting towards optimization and pattern recognition 💻 Maintaining a structured GitHub repository with all topics organized step-by-step and consistent commits. Step by step, moving closer to interview-ready DSA skills. #100DaysOfCode #DSA #Java #ProblemSolving #SlidingWindow #BinaryTree #LearningInPublic

Day 38 – 44 of my Frontlines EduTech (FLM) AI-Powered Java Full Stack Journey Day 38: Started learning Collections in Java. Focused on ArrayList and how it stores dynamic data. Understood how it is different from arrays. Day 39: Learned about Iterator. Used it to traverse elements in collections. It made looping through data more clean and flexible. Day 40: Explored Set interface. Learned that it stores only unique elements. Good for removing duplicates from data. Day 41: Learned Map in Java. Stores data in key-value pairs. Very useful for real-world applications. Day 42: Covered Enum and Command Line Arguments. Also learned Static and Instance Blocks. Understood when and how they are executed. Day 43: Learned Clone, Comparator, and Comparable. Used for copying objects and sorting data. Important for customizing sorting logic. Day 44: Solved problem on frequency of characters. Used logic with collections to count occurrences. Good practice for improving problem-solving skills. Consistent learning, step by step. Fayaz S 🔗 Github: https://lnkd.in/gV_uis3J #Java #Collections #CodingJourney #100DaysOfCode #LearnJava #FullStack 🚀

🚀 Mastering Java Through LeetCode 🧠 Day 20 of My DSA Journey Today I solved another problem from the LeetCode 75 list to improve my understanding of HashMap and HashSet concepts and strengthen my problem-solving skills. 📌 LeetCode Problem Solved Today: Q.1207 – Unique Number of Occurrences 💡 Problem Statement: Given an integer array arr, return true if the number of occurrences of each value in the array is unique, otherwise return false. 🧩 Example 1: Input: [1,2,2,1,1,3] Output: true 🧩 Example 2: Input: [1,2] Output: false Key Learning: Today I learned how to efficiently solve problems using Hashing techniques: ✔️ Use HashMap to count frequency of each number ✔️ Use HashSet to check if frequencies are unique ✔️ If any frequency repeats → return false 🧠 Approach: 1️⃣ Traverse array and store frequency using getOrDefault() 2️⃣ Traverse map values 3️⃣ Check duplicates using HashSet ⏱️ Complexity: Time Complexity: O(n) Space Complexity: O(n) This problem helped me understand how frequency counting + uniqueness checking works in real interview scenarios. Consistency is the key — solving problems daily to become a better software engineer 💻 #LeetCode #Java #DSA #ProblemSolving #CodingJourney #LearningInPublic #SoftwareDevelopment #Programming #Coding #Tech #Developers #100DaysOfCode #TechCareer #InterviewPreparation #HashMap #HashSet #CodingPractice #PGCP #CDAC #LeetCode75

🔹 Title: Solving “Plus Minus” Problem in Java 📊 🔹 Description: Today I solved the Plus Minus problem, where the goal is to calculate the ratios of positive, negative, and zero values in an array. The challenge was not just counting the values, but also formatting the output correctly to 6 decimal places. 💡 Approach: Traverse the array and count positives, negatives, and zeros Divide each count by the total number of elements Print results using precise formatting 🔹 What I learned: ✔ Importance of output formatting ✔ Handling edge cases (like zeros) ✔ Writing clean and efficient Java code Consistency in practicing such problems really strengthens core programming skills. 🚀 #Java #Coding #ProblemSolving #Programming #DataStructures

🚀 Mastering Java Through LeetCode 🧠 Day 22 of My DSA Journey Today I solved an interesting matrix-based problem that improved my understanding of arrays and comparison logic. 📌 LeetCode Problem Solved Today: 2352 – Equal Row and Column Pairs Problem Statement: Given an n x n matrix, find how many pairs (row, column) are exactly the same. A pair is valid only if both contain the same elements in the same order. 🧠 Key Idea: Compare each row with every column Check element-by-element equality Count all matching pairs 🔍 Example: Input: [[3,2,1], [1,7,6], [2,7,7]] Output: 1 Matching Pair: Row 2 = Column 1 → [2,7,7] ⚙️ Approach: Traverse all rows Build each column dynamically Compare row[i][k] with column[k][j] If all elements match → increment count ⏱️ Time Complexity: O(n³) (Optimized solution using HashMap possible in O(n²)) What I Learned: Matrix traversal techniques Row vs Column comparison logic Importance of nested loops in grid problems 🔥 Consistency is the key! Every day one problem closer to my goal of becoming a Software Engineer #LeetCode #DSA #Java #CodingJourney #100DaysOfCode #SoftwareEngineer #ProblemSolving #Learning #Tech

📆 Day 227 & 228 of 365 Days Focused on practicing DSA basics using Python along with continued Java practice. Worked on strengthening fundamentals like arrays, loops, and basic problem-solving patterns in Python, while also maintaining consistency with Java to improve logic and coding flow. These sessions were all about building a strong foundation across both languages and getting more comfortable with solving problems step by step. #Python #Java #DSA #ProblemSolving #CodingPractice #Developers #Programming #TechJourney #BuildInPublic #Learning #SoftwareEngineering

🚀 Day 1 of My Coding Challenge Today I solved an interesting problem on Array Rotation using Java. 🔹 Problem: Rotate an array to the left by ‘d’ positions efficiently. 🔹 Approach: Instead of shifting elements one by one, I used the Reversal Algorithm: 1️⃣ Reverse first d elements 2️⃣ Reverse remaining elements 3️⃣ Reverse entire array 🔹 Example: Input: [1, 2, 3, 4, 5], d = 2 Output: [3, 4, 5, 1, 2] 🔹 What I learned: ✔ Optimized solution from O(n*d) → O(n) ✔ Importance of breaking problems into smaller steps ✔ In-place array manipulation 💻 Code: ```java import java.util.Arrays; class Solution { public static int[] reverse(int[] arr, int start, int end) { while (start < end) { int temp = arr[start]; arr[start] = arr[end]; arr[end] = temp; start++; end--; } return arr; } static int[] rotateArr(int arr[], int d) { int n = arr.length; d = d % n; if (d < 0) { d = d + n; } reverse(arr, 0, d - 1); reverse(arr, d, n - 1); reverse(arr, 0, n - 1); return arr; } public static void main(String[] args) { int[] arr = {1, 2, 3, 4, 5}; int d = 2; int[] res = rotateArr(arr, d); System.out.println(Arrays.toString(res)); } } ``` #Java #DSA #CodingChallenge #50DaysOfCode #LearningJourney #PlacementPreparation

🚀 100 Days Java + DSA Challenge | Day 2 Today’s focus was on strengthening my programming fundamentals by covering: 🔹 Operators in Java (Arithmetic, Relational, Logical, Assignment) 🔹 Conditional Statements (if, if-else, nested if, switch) Understanding how operators work and how decisions are made in code is essential for building strong logic. These concepts are the backbone of problem-solving in Data Structures and Algorithms. 💡 Practiced writing multiple programs using conditions and improved my logical thinking step by step. Consistency is the key — small progress every day leads to big results. #100DaysOfCode #Java #DSA #LearningJourney #Coding #SoftwareDevelopment