Java Fundamentals: Data Types, Conditionals & Loops

Day 59 of Sharing What I’ve Learned 🚀 Comparator in Java — Custom Sorting Made Easy After learning how Map stores key-value pairs, I explored something powerful — controlling how data is sorted using Comparator. 👉 Default sorting is useful… but real-world problems need custom logic 🔹 What is Comparator? Comparator is an interface in Java used to define custom sorting logic. 👉 It allows us to sort objects based on our own rules 🔹 How does Comparator work? 👉 We override compare(a, b) method 👉 Returns: ✔ Negative → a comes before b ✔ Zero → both are equal ✔ Positive → a comes after b 🔹 Why use Comparator? ✔ Custom sorting logic ✔ Multiple sorting options ✔ Works without modifying the original class 🔹 Real-World Use Cases 👉 Sorting students by marks 👉 Sorting employees by salary 👉 Sorting products by price or rating 🔹 Key Features ✔ External sorting logic (separate from class) ✔ Can create multiple comparators ✔ Works with Collections.sort() & Arrays.sort() 🔹 Comparator vs Comparable 👉 Comparable = default/internal sorting 👉 Comparator = custom/external sorting 🔹 When should we use Comparator? 👉 Use it when: ✔ You need multiple ways to sort data ✔ You don’t want to modify the class ✔ You need dynamic sorting logic 🔹 When NOT to use? ❌ When only one natural sorting is enough ❌ When simple primitive sorting is required 🔹 Key Insight 💡 Sorting is not just arranging data… 👉 It’s about organizing data based on needs 🔹 Day 59 Realization 🎯 Good developers don’t just sort data… 👉 They decide how it should be sorted #Java #Comparator #DataStructures #CollectionsFramework #Programming #DeveloperJourney #100DaysOfCode #Day59 Grateful for guidance from, TAP Academy Sharath R kshitij kenganavar

☕ Learn Java with Me — Day 17 After understanding variables and memory, today we’re learning a very useful concept in Java 💻 👉 Type Casting & Type Conversion This is important not just for learning, but also from an interview and coding perspective 🎯 👉 What is Type Conversion? Type conversion means converting one data type into another. Example: int num = 10; double value = num; Here, int is automatically converted into double. This is called: 👉 Implicit Type Casting / Widening Why? Because Java converts a smaller data type into a bigger one automatically. Example: int → double No data loss 🚀 👉 Explicit Type Casting / Narrowing Sometimes we manually convert a bigger type into a smaller type. Example: double price = 99.99; int amount = (int) price; Output: 99 Here, decimal part gets removed. This is called: 👉 Explicit Type Casting Because we are forcing the conversion manually. 📌 Easy trick to remember: Small → Big = automatic Big → Small = manual ❓ Quick Question: What will be the output? double num = 12.8; int x = (int) num; System.out.println(x); We’re learning deeper — together 🤝 #java #coding #learning #interviewprep #showup #day17 #primitivetypecasting

Why I Stopped Using Scanner in Competitive Programming (Java) While solving problems in Java, I noticed something frustrating — even when my logic was correct, I was still getting TLE (Time Limit Exceeded) on some problems. After digging deeper, I realized the issue wasn’t my algorithm… it was my input method. 💡 The Problem with Scanner Java’s Scanner is very convenient, but it comes with a cost: It uses regex parsing internally Performs extra processing for tokenizing input Slower compared to other input methods 👉 This makes it inefficient for handling large inputs (like 10⁵ or 10⁶ values), which are very common in competitive programming. ⚡ The Better Approach: Fast I/O I switched to using: BufferedReader StringTokenizer These are much faster because they: Read input in bulk Avoid unnecessary parsing overhead Give better performance in tight time constraints 🛠️ What I Learned ✔️ Correct logic is not enough — performance matters ✔️ Input/output handling can impact your results ✔️ Choosing the right tools is part of problem-solving 🔥 Key Takeaway in competitive programming, even small optimizations like faster input methods can make a big difference between AC and TLE. 💻 Advice to Beginners If you’re using Java for competitive coding: Use Scanner only for small inputs Switch to fast I/O for serious problems Practice with efficient templates Always learning and improving ⚡ #CompetitiveProgramming #Java #DSA #CodingJourney #PerformanceMatters #LearnAndGrow

🚀 Mastering Time & Space Complexity in Java DSA When I started learning Data Structures & Algorithms in Java, the biggest mindset shift wasn’t coding… it was thinking in complexity. 📌 Time Complexity (⏱️) It tells how fast your code runs as input grows. O(1) → Constant (Best 👍) O(log n) → Logarithmic O(n) → Linear O(n log n) → Efficient sorting O(n²) → Slow (avoid when possible ⚠️) 📌 Space Complexity (💾) It tells how much memory your code uses. Efficient programs don’t just run fast — they also use less memory. 💡 Key Learnings: ✔️ Always analyze before optimizing ✔️ Nested loops ≠ always bad, but be careful ✔️ Trade-offs exist between time & space ✔️ Practice problems to build intuition 🔥 Current Focus: Improving problem-solving by writing optimized Java solutions and analyzing their complexity. Consistency > Motivation 💯 #Java #DSA #CodingJourney #TimeComplexity #SpaceComplexity #Programming #SoftwareEngineering

I’m learning Java — and this week I went deep into the Java Collections Framework 🚀 Honestly, this is where coding becomes practical. Here’s what clicked for me 👇 🔹 Collections = How you actually manage data in real projects Instead of arrays, Java gives structured ways to store data: 👉 List 👉 Set 👉 Map Each solves a different problem 🔹 List → Ordered, allows duplicates ✔ ArrayList → fast access (read-heavy) ✔ LinkedList → fast insert/delete 👉 Default choice → ArrayList (most cases) 🔹 Set → No duplicates allowed ✔ HashSet → fastest (no order) ✔ LinkedHashSet → maintains insertion order ✔ TreeSet → sorted data 👉 Use this when uniqueness matters 🔹 Map → Key-Value pairs (most used in real systems) ✔ HashMap → fastest, most common ✔ LinkedHashMap → maintains order ✔ TreeMap → sorted keys 👉 Example: storing userId → userData 🔹 Iteration styles (very important in interviews) ✔ for-each → clean & simple ✔ Iterator → when removing elements ✔ forEach + lambda → modern Java 🔹 Streams API → Game changer 🔥 Instead of loops: 👉 filter → select data 👉 map → transform 👉 collect → store result Example flow: filter → map → sort → collect This makes code: ✔ cleaner ✔ shorter ✔ more readable 💡 Big realization: Choosing the wrong collection can silently affect performance (O(1) vs O(n) vs O(log n)) 📌 Best practices I noted: ✔ Use interfaces (List, not ArrayList) ✔ Use HashMap by default ✔ Use Streams for transformation ✔ Avoid unnecessary mutations 🤔 Curious question for you: In real projects, 👉 When do you actually choose LinkedList over ArrayList? I’ve rarely seen it used — would love real-world scenarios 👇 #Java #JavaCollections #JavaDeveloper #LearningInPublic #SoftwareDevelopment #CodingJourney

 TreeSet in Java Imagine you have a box of numbers. But this is a special box 🎁 👉 It always keeps numbers in sorted order 👉 It never allows duplicates 👉 It arranges everything like a smart tree 🌳 💡 How does it work? (Simple story) Let’s say you add numbers: 100, 50, 150, 25, 75, 125, 175 The TreeSet thinks like this: - Bigger number? ➡️ go RIGHT - Smaller number? ⬅️ go LEFT So it builds a tree like this in its mind 🌳 And when you print it → you always get: 👉 25, 50, 75, 100, 125, 150, 175 🔁 How it gives sorted output? It follows a rule: 👉 Left → Value → Right That’s why everything comes in order automatically 😍 🚫 Important Rules ❌ No duplicate values ❌ No mixed data (only same type like all integers) ❌ No null values 🧠 Superpowers of TreeSet ✔️ first() → smallest number ✔️ last() → biggest number ✔️ higher(x) → next bigger than x ✔️ lower(x) → next smaller than x ✔️ ceiling(x) → x or just above ✔️ floor(x) → x or just below ⚡ When should you use TreeSet? ✅ When you want data in sorted order ✅ When you don’t want duplicates ✅ When you need fast searching (log n time) ✅ When working with ranges of data In one line: TreeSet = Smart Set + Sorted + No Duplicates + Tree Brain 💬 If this made TreeSet easy for you, drop a 👍 #Java #DSA #Learning #Coding #Beginners

🚀 Exploring the Collection Framework in Java Ever wondered how Java efficiently manages large amounts of data? 🤔 Recently, I stepped into the Collection Framework—a powerful concept used for handling data effectively. 🔍 What is the Collection Framework? It is a collection of classes and interfaces that help in storing, manipulating, retrieving, and processing data easily. 💡 Why use it? ✔ Easy to store data ✔ Easy to manipulate ✔ Easy to retrieve ✔ Easy to process 📌 Core Interfaces: • List • Set • Map 🔗 Started with List Interface: Explored implementations like: • ArrayList • LinkedList • ArrayDeque • PriorityQueue 📊 What I analyzed: • Usage • Initial capacity • Heterogeneous data support ➡️ Then explored: • Insertion order • Duplicates • Null handling ➡️ Also looked into: • Constructors • Internal structure • Hierarchy 🔄 Ways to Access Elements: • For loop • For-each loop ➡️ Advanced ways: • Iterator • ListIterator 👉 Key Difference: Iterator moves only forward, whereas ListIterator supports both forward and backward traversal. 🌍 Real-Life Use Case: Imagine building a student management system 📚 • Use ArrayList to store and display student records • Use LinkedList for frequent insertions/deletions • Use PriorityQueue for priority-based processing 💡 Key Takeaway: Choosing the right data structure depends on the use case and performance requirements. 💻 Mini Code Example: import java.util.*; public class Demo { public static void main(String[] args) { List<String> list = new ArrayList<>(); list.add("Java"); list.add("Python"); for(String lang : list) { System.out.println(lang); } } } ✨ Special thanks to Sharath R for the clear and practical explanation! TAP Academy Bibek Singh #Java #Collections #CollectionFramework #ArrayList #LinkedList #DataStructures #OOP #Programming #FullStackDevelopment #LearningJourney #Coding #Developer #TapAcademy

🤔 Do you know the size of char in Java? 🚀 Java Data Types — Tiny Choices, Massive Impact And more importantly… ❓ Is it the same as in C? While learning Java, I came across something interesting: ❓ Why do we need so many data types…? At first, it felt like just syntax. But slowly, I realized they actually define how data behaves inside a program. 👉 Every data type affects: • Memory usage (in bytes) • Value limits (range) • Precision (for decimals) • Runtime behavior (overflow, rounding) 🔹 Primitive Data Types (The Real Foundation) These are the basic ones we use everywhere. Integer Types: • byte (1 byte) → -128 to 127 • short (2 bytes) → -32,768 to 32,767 • int (4 bytes) → most commonly used • long (8 bytes) → for large values 💡 I realized choosing between int and long is not random — it depends on the use case Floating Types: • float (4 bytes) → ~6–7 digits precision • double (8 bytes) → ~15–16 digits precision 💡 Using the wrong one can affect accuracy Other Primitives: • char → 2 bytes (UTF-16 Unicode) • boolean → true/false ⚠️ One thing that surprised me: 👉 In C: char = 1 byte 👉 In Java: char = 2 bytes This is because Java supports Unicode characters. 🔹 Reference Types Then there are non-primitive types: • String • Arrays • Objects • Interfaces 👉 These don’t store actual values 👉 They store references (addresses in memory) ⚙️ What I’m Learning At first, data types looked very basic. But now I’m starting to see: 💥 They affect memory 💥 They affect accuracy 💥 They can even cause bugs if used incorrectly 🧠 A Small Thought Next time I write: int count = 10; I’m trying to think: 👉 Do I really need int? 👉 What if the value increases? Still learning, but this made me look at “basics” differently. 🔥 It’s interesting how even small things like data types can impact bigger systems. #Java #Programming #Learning #CodingJourney #ComputerScience

#Day45 – Map in Java: Key-Value Pairs & Problem Solving -#Programming ⚠️ Today, I explored one of the most powerful data structures in Java — Map, which helps in storing data in key-value pairs and solving real-world problems efficiently. 💡 Key Learnings: ✔ Map → collection of key-value pairs ✔ Key → unique (no duplicates allowed) and Value → can have duplicates ✔ One key maps to exactly one value ✔ Methods: put(), get(), remove(), containsKey(), containsValue() ✔ keySet() → get all keys , values() → get all values ✔ entrySet() → get key-value pairs , size() and isEmpty() ✔ Types of Map → HashMap, LinkedHashMap, TreeMap ✔ HashMap → no order , LinkedHashMap → maintains insertion order ✔ TreeMap → sorts keys 🧠 Example Solved: Solved a problem to count the frequency of each character in a string (e.g., Mississippi → M1i4s4p2) using Map. Learned how to efficiently track occurrences using containsKey(), get(), and put() methods. A big thank you to TAP Academy, Harshit T Sir, and Somanna M G Sir for explaining complex concepts in such a simple and practical way. Your teaching style, real-world examples, and constant support have made a huge difference in my understanding of Java and problem-solving. 🙏 #Java #CollectionsFramework #Map #HashMap #LinkedHashMap #DataStructures #CodingJourney #Consistency

Day 41 of Learning Java: Method Overriding If method overloading was about flexibility,method overriding is about customization. What is Method Overriding? It’s when a subclass provides its own implementation of a method that is already defined in the parent class. Same method name. Same parameters. But different behavior. 🔹 Simple example- class Parent { void watchTV() { System.out.println("Watching News/Serial"); } } class Child extends Parent { @Override void watchTV() { System.out.println("Watching Music/Sports"); } } Same method → different output depending on the object. • Parent defines a general behavior • Child modifies it based on its own need • This helps in writing more flexible and reusable code 🔹 Key points to remember • Method signature must be the same • Happens during runtime (runtime polymorphism) • Inheritance is required 👉 You cannot override: static methods private methods final methods 🔹 One important concept Parent ref = new Child(); ref.watchTV(); Even though the reference is of Parent, the method of Child gets executed. 👉 This is called dynamic method dispatch 🔹 About @Override It’s not mandatory, but it helps: ✔ Avoid mistakes ✔ Makes code more readable ✔ Ensures you’re actually overriding #Java #OOP #MethodOverriding #LearningInPublic #Programming#sql #branding