✅ DSA Day 6 / 100 Solved Maximum Product of Two Elements in an Array on LeetCode using Java. Logic - -We need the two largest numbers in the array -Traverse the array once -Keep track of the largest (max1) and second largest (max2) values - Update them whenever a bigger number is found -Final answer = (max1 - 1) * (max2 - 1) This approach avoids sorting and works efficiently in a single pass. Learning how tracking values smartly can reduce time complexity 🚀 #DSA #100DaysOfCode #Java #LeetCode #Arrays #Consistency
Max Product of Two Elements in Array Java Solution
More Relevant Posts
-
🚀 DSA Learning Journey | Day 9 | Java Solved “125. Valid Palindrome.” 💡 Key Idea: Used Two Pointers while ignoring non-alphanumeric characters and comparing characters in a case-insensitive way. ⚙ Implementation • Language: Java • Time Complexity: O(n) • Space Complexity: O(1) 📚 Learning how two-pointer technique simplifies string validation problems. #Java #DSA #LeetCode #ProblemSolving #TwoPointers #JavaDeveloper
To view or add a comment, sign in
-
-
Day 44 of #100DaysOfLeetCode 💻✅ Solved Very Simple #169. Majority Element problem in Java. Approach: • Sorted the given array using Arrays.sort() • Observed that the majority element appears more than n/2 times • After sorting, the majority element will always be present at index n/2 • Returned the element at nums[n/2] Performance: ✓ Runtime: 7 ms (Beats 42.86% submissions) ✓ Memory: 55.96 MB (Beats 16.21% submissions) Key Learning: ✓ Understood how sorting can help identify the majority element ✓ Learned the property that the majority element always occupies the middle position after sorting ✓ Practiced array manipulation and problem solving in Java Learning one problem every single day 🚀 #Java #LeetCode #DSA #Arrays #ProblemSolving #CodingJourney #100DaysOfCode
To view or add a comment, sign in
-
-
Day 43 of #100DaysOfLeetCode 💻✅ Solved #100. Same Tree problem in Java. Approach: • Used recursion to compare both binary trees simultaneously • If both nodes are null, returned true • If one node is null and the other is not, returned false • Checked whether the values of both nodes are equal • Recursively compared the left subtrees and right subtrees Performance: ✓ Runtime: 0 ms (Beats 100% submissions) 🚀 ✓ Memory: 43.10 MB (Beats 30.15% submissions) Key Learning: ✓ Practiced recursive traversal of binary trees ✓ Learned how to compare two trees node by node ✓ Strengthened understanding of tree recursion logic Learning one problem every single day 🚀 #Java #LeetCode #DSA #BinaryTrees #ProblemSolving #CodingJourney #100DaysOfCode
To view or add a comment, sign in
-
-
Today I practiced Generics in Java. Generics help us write reusable and type-safe code. Instead of creating separate methods for different data types, we can use a generic type to handle multiple types with the same logic. In this example, a single generic method display() prints both Integer and Double arrays. Learning small concepts like this helps write cleaner and more flexible Java code 🚀 Saketh Kallepu Anand Kumar Buddarapu Uppugundla Sairam Kishor Kumar #Java #Generics #Programming #LearningJourney
To view or add a comment, sign in
-
-
🚀 Day 17 of #100DaysOfDSA & Java Development Today I explored one of the most interesting problem-solving techniques in programming — Recursion. Key concepts covered: 🔹 Understanding recursion and the importance of the base case 🔹 Recursive function calls and stack behavior 🔹 Solving problems like factorial, Fibonacci, and printing numbers using recursion 🔹 Practicing recursion-based questions to strengthen logical thinking Recursion really changes the way you think about solving problems. Instead of solving the whole problem at once, you break it into smaller versions of the same problem. Big takeaway: Every recursive solution depends on two key parts — base case (stopping condition) and recursive call (reducing the problem). Day 17 ✅ Continuing to improve problem-solving skills step by step. #DSA #Java #Recursion #100DaysOfCode #ProblemSolving #DeveloperJourney #LearningInPublic
To view or add a comment, sign in
-
-
Day 38 of #100DaysOfLeetCode 💻✅ Solved #222. Count Complete Tree Nodes problem in Java. Approach: • Used recursion to traverse the binary tree • Counted the current node and recursively counted nodes in left and right subtrees • Added the counts to get the total number of nodes • Returned 0 when the node is null to stop recursion Performance: ✓ Runtime: 0 ms (Beats 100% submissions) ✓ Memory: 44 MB Key Learning: ✓ Practiced recursion with binary trees ✓ Understood how tree traversal helps count nodes in a tree ✓ Improved recursive thinking while solving tree problems Learning one problem every single day 🚀 #Java #LeetCode #DSA #ProblemSolving #CodingJourney #100DaysOfCode
To view or add a comment, sign in
-
-
🚀 Day 30 / 180 – DSA with Java 🚀 📘 Topic Covered: Strings & Sorting Technique 🧩 Problem Solved: Longest Common Prefix Problem: Given an array of strings, find the longest common prefix shared among all the strings. Approach: Sorted the array of strings and compared only the first and last strings. Since sorting groups similar prefixes together, the common prefix between these two strings represents the common prefix for the entire array. Key Learning: ✔️ Using sorting to simplify string comparison problems ✔️ Observing patterns to reduce unnecessary checks ✔️ Efficient prefix detection in string arrays If you’re also preparing for DSA, let’s connect and learn together 🤝 #DSA #Java #180DaysOfCode #LearningInPublic #Strings #ProblemSolving #Consistency
To view or add a comment, sign in
-
-
Today I implemented Array Reversal in Java using the Two-Pointer Technique! 🔄 Logic: ∙ Set left = 0 and right = arr.length - 1 ∙ Swap elements at both ends ∙ Move pointers inward until they meet ✅ Input: {1, 2, 3, 4, 5} ✅ Output: 5 4 3 2 1 💡 Why Two-Pointer? Instead of using extra space, we swap in-place — making it O(n) time and O(1) space! No extra array needed. Just two pointers doing the work. 💪 Every small concept I practice brings me one step closer to DSA mastery. Keep building. Keep learning. 🙌 #100daysofcode #dsa #java #program #array #problem #leetcode #javadeveloper #learning
To view or add a comment, sign in
-
-
💻 Practicing Binary to Decimal Conversion using Java Today I worked on converting a binary number into its decimal equivalent using logic and iteration. 🔍 Key Learnings: Understanding how binary digits map to powers of 2 Strengthening loop and mathematical logic Improving problem-solving skills step by step Instead of just memorizing, I focused on understanding the logic deeply and practicing with different inputs. 📌 Example: Binary: 1010 → Decimal: 10 Consistency + Practice = Progress 🚀 #Java #DSA #CodingJourney #Programming #100DaysOfCode #LearnToCode #ProblemSolving #DeveloperJourney #CodingPractice #TechSkills
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
Well done neha!