Day 34 of Coding Practice 🚀 Today’s learning reminded me that small logic improvements make a big difference in problem solving. 🔹 Practiced string manipulation problems in Java 🔹 Focused on understanding conditions, loops, and edge cases 🔹 Learned how to think step-by-step instead of jumping to the final answer 💡 Key takeaway: Writing code is easy, but understanding why it works is what actually builds confidence. Every day of practice is helping me improve my logic, clarity, and debugging skills. Consistency really is the key 🔑 On to Day 35 💪 #Day34 #CodingPractice #Java #ProblemSolving #LearningJourney #Consistency #DeveloperLife my code ===== class Solution { static ArrayList<Integer> removeDuplicates(int[] arr) { ArrayList<Integer> n=new ArrayList<>(); for(int i=0;i<arr.length;i++) { if(!n.contains(arr[i])) { n.add(arr[i]); } } return n; } public static void main(String hjk[]) { removeDuplicates(new int[]{1,2,3,2,1,5,9}); } }
Java Problem Solving Practice Day 34
More Relevant Posts
-
🛣️Sharing my problem-solving journey. Today i worked on a Leetcode coding challenge that looked simple but taught me powerful lessons about breaking down problems, learning from mistakes, and refining logic step by step. 📌 In this PPT, I’ve shared: • How I understood the problem • My initial thinking and mistakes • Key fixes and final approach • Lessons and takeaways Would love to hear your thoughts — feedback welcome 🙂 #ProblemSolving #LearningJourney #Algorithms #Java #DeveloperGrowth #LearningInPublic
To view or add a comment, sign in
-
Code reviews taught me more than writing code ever did When I started, I thought code reviews were mainly about finding bugs. If it works, it should be fine. Right? Over time, I realized code reviews are rarely about syntax errors. They’re about questions like: • Is this logic easy to understand six months later? • Is this the right abstraction, or just the quickest fix? • What happens if this fails in production? • Can someone else debug this at 2 AM? Some of my biggest improvements came from review comments that didn’t change functionality at all — only clarity, structure, and intent. Code reviews slowly changed how I write code before submitting it. I think more about: • readability • edge cases • naming • future changes Good reviews don’t just improve code. They improve how engineers think. Still learning. Still refining. #SoftwareEngineering #Java #BackendDevelopment #CodeReviews #CareerGrowth #Learning
To view or add a comment, sign in
-
🚀 Mastering Oops Concept | Day 3 📘 Topic: Constructors & Their Types Today’s learning focused on constructors, a core OOP concept used to initialize objects and ensure they start in a valid state. 🔑 What is a Constructor? A special method used to initialize objects Same name as the class No return type (not even void) Automatically called when an object is created using new 🧩 General Syntax: class ClassName { ClassName() { // initialization code } } 📌 Types of Constructors Covered: 1️⃣ Default Constructor Provided by the compiler if no constructor is defined class Demo { // Compiler creates Demo() } 2️⃣ No‑Argument Constructor Explicitly defined with no parameters class Car { Car() { System.out.println("Car created"); } } 3️⃣ Parameterized Constructor Used to initialize objects with specific values class Animal { Animal(String name) { this.name = name; } } 4️⃣ Copy Constructor Creates a new object by copying another object class Book { Book(Book b) { this.title = b.title; } } 💡 Key Takeaways: Constructors ensure proper object initialization They improve code clarity and reliability Essential for building robust and maintainable applications This session strengthened my understanding of how objects are created and managed in Core Java using constructors. Vaibhav Barde sir Grateful for the clear explanations and practical examples that made learning effective. #ObjectOrientedProgramming #CoreJava #Constructors #JavaLearning #Day3 #LearningJourney #ProfessionalGrowth
To view or add a comment, sign in
-
-
📌 𝗟𝗶𝗻𝗸𝗲𝗱 𝗟𝗶𝘀𝘁 & Recursion 𝗹𝗲𝗲𝘁𝗰𝗼𝗱𝗲 𝗽𝗿𝗼𝗯𝗹𝗲𝗺 🍀 👉 Question : Flattening a Linked List 👉 Link : https://lnkd.in/gTzeAGpm 🌏Don't forget to check the 1st Qn sol code on my Github profile! 🌈 https://lnkd.in/gpAFH385 🔥 Key Points of the Code: : 𝗔𝗽𝗽𝗿𝗼𝗮𝗰𝗵 𝗙𝗼𝗿 𝗤 : Recursive Merge Approach (Divide and Conquer) ✔ Uses recursion for flattening. ✔ First flattens the next list. ✔ Then merges current list with flattened list. ✔ Merge happens using bottom pointer only. ✔ next pointer is not used after flattening. ✔ Works only because each bottom list is already sorted. 🕒 O(n × k) (Worst Case) , k = number of linked lists 💾 Space: O(k) (Recursive stack space) 💖 Gratitude Corner A huge shoutout to Mazhar Imam Khan🙌, Code Help by Love Babbar🙌, Raj Vikramaditya for sharing valuable insights and motivating coders like me to keep pushing forward #codestorywithMIK #geeksforgeeks #takeuforward #Codehelp #Telusko #Java #Math #CodingChallenge #KeepGrinding #LeetCode #Problem #Coding #DSA #Algorithms #POTD #Tech #CompetitiveProgramming #KeepCoding #dailyproblem #DataStructres #code #approaches #algorithms
To view or add a comment, sign in
-
-
🚀 DSA Practice — A Realization I’ve solved 43 problems on LeetCode so far (31 Easy, 12 Medium) 💻 While practicing, I realized something important — problem solving is not about streaks, badges, or increasing numbers. There were days when I focused more on maintaining the streak than truly understanding the problem. That’s when I understood I was tracking numbers, not growth 📊 But during this process, I learned something valuable. Before jumping into code, the first step is to understand the question deeply. Break it down. Think about the logic. Try solving it roughly on paper. Only then write the code. Code is the final step — not the first. I also started understanding how to decide which approach to use — whether it involves sliding window, two pointers, prefix sum or another pattern. From here, consistency is not about maintaining a streak — it’s about building real problem-solving ability. One problem. Full understanding. Every day. 🔁 #DSA #LeetCode #Java #ProblemSolving #PlacementPreparation
To view or add a comment, sign in
-
-
LeetCode Grinding 🚀 Today was focused on pattern recognition in problem solving and applying it through hands-on practice. 🔹 DSA & LeetCode Practice 1. Solved LeetCode 15 — 3Sum Understood how sorting + two pointers help reduce time complexity Learned how to handle duplicates effectively 2. Solved LeetCode 167 — Two Sum II (Input Array is Sorted) Implemented the two pointers pattern Gained clarity on pointer movement based on sum comparison Overall takeaway: 👉 Strong understanding of how the Two Pointers pattern works and when to apply it in sorted arrays. 🔹 Learning Mindset Focused not just on solving problems, but on understanding the underlying pattern to reuse it in similar questions 📌 Progress happens when concepts start connecting, not just when problems get solved. #DailyGrind #DSA #LeetCode #TwoPointers #ProblemSolving #Java #Consistency #LearningInPublic
To view or add a comment, sign in
-
🎉🔥 #Day13 of my #100DaysCodingChallenge 🔥🎉 What began as a habit is now turning into a strong foundation of logical thinking and clean coding practices. Today marks Day 13, with a focus on array traversal, optimization, and observation-based problem solving 💪 🔹 Problem 1: Replace Elements with Greatest Element on Right Side (LeetCode Submission: https://lnkd.in/dnBr_wEY ) This problem required replacing every element in the array with the greatest element among the elements to its right. 💡 Approach: ➡️ Traversed the array from right to left ➡️ Maintained the maximum element seen so far ➡️ Replaced each element with the current maximum ➡️ Updated the maximum during traversal ⏱️ Time Complexity: O(N) 💾 Space Complexity: O(1) 🎯 Key Takeaway: Right-to-left traversal helps eliminate unnecessary comparisons and allows in-place optimization. 🔹 Problem 2: Max Consecutive Ones (LeetCode Submission: https://lnkd.in/dVjAiXUc ) A fundamental array problem focused on counting the maximum number of consecutive 1s in a binary array. 💡 Approach: ➡️ Iterated through the array once ➡️ Maintained a counter for current consecutive 1s ➡️ Reset the counter when a 0 was encountered ➡️ Tracked the maximum count throughout traversal ⏱️ Time Complexity: O(N) 💾 Space Complexity: O(1) 🎯 Key Takeaway: Simple counters combined with single-pass traversal can solve many array problems efficiently. 🌟 Final Reflection 13 days in. Stronger logic. Cleaner solutions. Small consistent efforts are building long-term confidence 🚀 🔖 Hashtags #100DaysOfCode #Day13 #DSA #Java #LeetCode #Arrays #ProblemSolving #InterviewPreparation #CodingPractice #LearningInPublic #StudentDeveloper #CodingJourney #Consistency
To view or add a comment, sign in
-
In this insightful article, Spruce Emmanuel explores how developers can transition from simple programming exercises to creating real-world applications. I found it interesting that the foundation built through basic projects can significantly enhance our understanding of programming complexities. What projects have helped you in your development journey?
To view or add a comment, sign in
-
🚫 Week 1 of Java: I Skipped the History Lesson (And the Interviewers Thanked Me) Everyone says: 👉 “Start with Java history.” 👉 “Read all the theory first.” Reality check: interviewers don’t ask who invented Java, they ask how you think and how you code. So here’s how Week 1 of my learning curve actually went 👇 💡 Step 1: Be a developer, not a historian Instead of memorizing unnecessary theory, I focused on what actually matters: Writing code ->Understanding logic ->Solving real problems 📌 Step 2: Git & GitHub before gyaan ->Because let’s be honest — ->If you can’t push code, you’re not “learning”, you’re just reading. ->Version control ->Team collaboration mindset ->Showing progress, not just claiming it 🧠 Step 3: Problem → Pseudocode → Program ->Jumping straight into code is a trap. So I learned to: ->Understand the problem statement ->Think about edge cases ->Write pseudocode first Then convert thoughts into Java. ⚙️ Step 4: Datatypes & Type Casting (the real game) ->Implicit & explicit type casting taught me: ->How Java really behaves ->How bugs are born (and fixed 😄) 🔁 Step 5: if-else, switch, loops — logic gym Not just syntax, but how to implement logic for any problem statement. Here is my Notion notes : https://lnkd.in/dkrvizUZ 📒 I documented my entire learning journey in Notion 💻 Pushed my practice code to GitHub (Proof > promises) And honestly, this didn’t feel like studying. ✨ It felt like storytelling. That’s the magic of Student Tribe — learning concepts like a story so your brain remembers, not memorizes. Special respect to: Madhu Samala sir 🪄 — for showing how interviewers actually think Sri Charan Lakkaraju & Amarnath KR sir — for mentoring people who start lazy but want to finish strong. 🎯 Week 1 takeaway: You don’t need more theory. You need clarity, consistency, and code. If this is just Week 1, I’m excited for the chapters ahead. 🚀 #Java #LearningInPublic #StudentTribe #DeveloperJourney #GitHub #Freshers #InterviewPrep #Consistency #Week1
To view or add a comment, sign in
-
Introducing Smart Code Assistant (SCA) CLI – Your Offline Coding Companion As developers, we often switch between coding IDEs and browsers to look up solutions, which research shows can cause up to 30% loss of attention. Notifications and internet distractions make it even worse, eating into our precious coding time. To solve this, our team developed Smart Code Assistant (SCA) – a fully offline CLI tool that helps you test, debug, optimize, and understand your code without ever leaving your IDE. ⚡ Key Features Explain Code: Generates clear explanations of your code directly in your project directory. Debug: Identifies and fixes errors efficiently. Optimize: Suggests better approaches to improve your code. Test: Creates edge test cases to ensure your code is robust. 🛠 How It Works Install Ollama 3.2:1B model on your PC - https://lnkd.in/gMdtwFkM Install our package in your project directory - https://lnkd.in/gZaCXvbf Run commands like: sca test <file_name> sca debug <file_name> sca optimize <file_name> sca explain <file_name> All outputs are generated locally, so there’s no distraction from internet tabs or notifications. Core Contributors: Deepak Kambala and Akhil Siva Chowdary Nandigam Other Contributors: Vinay sai pavan Banduchode, Lourdhu Mounika Nare and Akhila Mokkapati 🔗 Check it out on PyPI: https://lnkd.in/gZaCXvbf 💡 Stay focused, code smarter, and keep distractions away!
To view or add a comment, sign in
Explore content categories
- Career
- Productivity
- Finance
- Soft Skills & Emotional Intelligence
- Project Management
- Education
- Technology
- Leadership
- Ecommerce
- User Experience
- Recruitment & HR
- Customer Experience
- Real Estate
- Marketing
- Sales
- Retail & Merchandising
- Science
- Supply Chain Management
- Future Of Work
- Consulting
- Writing
- Economics
- Artificial Intelligence
- Employee Experience
- Workplace Trends
- Fundraising
- Networking
- Corporate Social Responsibility
- Negotiation
- Communication
- Engineering
- Hospitality & Tourism
- Business Strategy
- Change Management
- Organizational Culture
- Design
- Innovation
- Event Planning
- Training & Development