Java Arrays vs ArrayLists: Size Behavior and Performance

Today I practiced Implicit and Explicit Typecasting in Java. ✔ Implicit Casting (Widening) – Automatic conversion from smaller to larger data types. ✔ Explicit Casting (Narrowing) – Manual conversion from larger to smaller data types (may cause data loss). Key Learning: byte → int → float (Safe conversion) int → byte (Possible overflow) float → byte (Data loss possible) Strong fundamentals make strong developers 💻🔥 #Java #CoreJava #TypeCasting #JavaDeveloper #Programming #BackendDeveloper #CodingJourney

📝 Day 19/30 – LeetCode #33 (Search in Rotated Sorted Array) | Java This problem combines binary search with array rotation, making it more about logic than syntax. The main challenge was identifying which half of the array is sorted at every step and deciding whether the target lies within that range. By comparing boundary values and narrowing the search space accordingly, the problem can be solved efficiently in O(log n) time. This reinforced how adaptable binary search becomes when combined with careful condition checks. Another reminder that mastering patterns is far more important than memorizing solutions. #LeetCode #Java #DSA #BinarySearch #Arrays #ProblemSolving #LearningInPublic

Day 30 of #100DaysOfLeetCode 💻✅ Solved #108. Convert Sorted Array to Binary Search Tree on LeetCode using Java. Approach: • Used Divide and Conquer strategy • Selected the middle element as the root to maintain balance • Recursively built the left subtree using left half of array • Recursively built the right subtree using right half of array • Ensured the tree remains height-balanced at every step Performance: ✓ Runtime: 0 ms (Beats 100.00% submissions) ✓ Memory: 45.18 MB (Beats 44.10% submissions) Key Learning: ✓ Understood how sorted arrays can directly map to balanced BST ✓ Strengthened recursion fundamentals in tree construction ✓ Improved understanding of height-balanced binary trees Learning one problem every single day 🚀 #Java #LeetCode #DSA #BinarySearchTree #Recursion #DivideAndConquer #ProblemSolving #CodingJourney #100DaysOfCode

Day 33 of #100DaysOfLeetCode 💻✅ Solved #145. Binary Tree Postorder Traversal on LeetCode using Java. Approach: • Used recursion to perform postorder traversal • Followed Left → Right → Root order strictly • Traversed left subtree first • Then traversed right subtree • Added node value after visiting both subtrees Performance: ✓ Runtime: 0 ms (Beats 100.00% submissions) ✓ Memory: 43.12 MB (Beats 71.37% submissions) Key Learning: ✓ Clearly understood difference between preorder, inorder, and postorder ✓ Strengthened recursive tree traversal concepts ✓ Improved confidence in handling binary tree problems Learning one problem every single day 🚀 #Java #LeetCode #DSA #BinaryTree #Recursion #TreeTraversal #ProblemSolving #CodingJourney #100DaysOfCode

Day 32 of #100DaysOfLeetCode 💻✅ Solved #144. Binary Tree Preorder Traversal on LeetCode using Java. Approach: • Used recursion to perform preorder traversal • Followed Root → Left → Right order strictly • Added node value before traversing subtrees • Traversed left subtree first, then right subtree • Stored values in a list during traversal Performance: ✓ Runtime: 0 ms (Beats 100.00% submissions) ✓ Memory: 42.83 MB (Beats 96.77% submissions) Key Learning: ✓ Strengthened understanding of preorder traversal pattern ✓ Clearly differentiated preorder from inorder traversal ✓ Improved recursive tree traversal implementation skills Learning one problem every single day 🚀 #Java #LeetCode #DSA #BinaryTree #Recursion #TreeTraversal #ProblemSolving #CodingJourney #100DaysOfCode

Learning 2D Arrays & Jagged Arrays in Java Recently explored the concepts of 2D arrays and jagged arrays in Java and focused on understanding how they actually work in memory. Key takeaways: • Each row is stored separately in memory • Jagged arrays allow different row sizes • Better understanding of references and dynamic allocation Visualizing the internal structure helped me strengthen my logical thinking and clarity in handling multidimensional data. Building strong fundamentals step by step with Harshit T at TAP Academy #Java #DataStructures #Arrays #JaggedArrays #ProgrammingFundamentals #LearningJourney #DeveloperGrowth

Day 9 of 100 | Encapsulation Today I worked on Encapsulation in Java — and it made more practical sense than ever. Encapsulation isn’t just a definition. It’s about: ✔ Keeping variables private ✔ Controlling access using getters and setters ✔ Preventing unwanted changes to data In simple terms, it’s Java saying: “Access allowed… but only in the right way.” 😄 Small concept on paper, but it changes how you design programs. Step by step, writing cleaner and safer code #Day9 #100DaysOfCode #Java #OOP #Encapsulation #LearningInPublic #BackendJourney

In Java, variables are containers for storing data values, and data types define the kind of data a variable can hold and how it is stored in memory. Java is a statically typed language, so the data type of every variable must be declared before use. #java #coding

Day 31 of #100DaysOfLeetCode 💻✅ Solved #94. Binary Tree Inorder Traversal on LeetCode using Java. Approach: • Used recursion to perform inorder traversal • Followed Left → Root → Right order strictly • Traversed left subtree first before processing current node • Stored node values in a list during traversal • Returned the final list after complete traversal Performance: ✓ Runtime: 0 ms (Beats 100.00% submissions) ✓ Memory: 42.76 MB (Beats 98.30% submissions) Key Learning: ✓ Strengthened understanding of tree traversal patterns ✓ Improved clarity on recursion stack behavior ✓ Reinforced difference between preorder, inorder, and postorder traversal Learning one problem every single day 🚀 #Java #LeetCode #DSA #BinaryTree #Recursion #TreeTraversal #ProblemSolving #CodingJourney #100DaysOfCode