Developer_X01's profile picture. MERN Stack Developer | Architecting Scalable Solutions | Diving into AWS, Java & Microservices | Where Code Meets Product Strategy

Developer X

@Developer_X01

MERN Stack Developer | Architecting Scalable Solutions | Diving into AWS, Java & Microservices | Where Code Meets Product Strategy

Day 22 of #100DaysOfCode Solved the Fibonacci Number problem on LeetCode with an iterative DP approach. Achieved 0ms runtime, top 100% performance. Shows how iteration optimizes recursion for efficiency. #LeetCode #Java #DynamicProgramming #Coding

Developer_X01's tweet image. Day 22 of #100DaysOfCode
Solved the Fibonacci Number problem on LeetCode with an iterative DP approach.
Achieved 0ms runtime, top 100% performance.
Shows how iteration optimizes recursion for efficiency.
#LeetCode #Java #DynamicProgramming #Coding

Day 21 of #100DaysOfCode Climbing Stairs in Java with 0ms runtime, beating 100% of submissions. Used an optimized iterative Fibonacci approach, reducing space complexity from O(n) to O(1). Efficient for large inputs, showcasing simplified dynamic programming. #Leetcode #Java #DSA

Developer_X01's tweet image. Day 21 of #100DaysOfCode
Climbing Stairs in Java with 0ms runtime, beating 100% of submissions.
Used an optimized iterative Fibonacci approach, reducing space complexity from O(n) to O(1).
Efficient for large inputs, showcasing simplified dynamic programming.
#Leetcode #Java #DSA

Day 20 of #100DaysOfCode LeetCode 50: Pow(x, n) Achieved 0ms runtime, top 100% Used fast exponentiation to compute x^n efficiently. Handled n = Integer.MIN_VALUE safely using long. Clean logic, optimal time: O(log n) #Java #LeetCode #DSA #Coding

Developer_X01's tweet image. Day 20 of #100DaysOfCode
LeetCode 50: Pow(x, n)
Achieved 0ms runtime, top 100%
Used fast exponentiation to compute x^n efficiently.
Handled n = Integer.MIN_VALUE safely using long.
Clean logic, optimal time: O(log n)
#Java #LeetCode #DSA #Coding

Day 19 of #100DaysOfCode Solved "Largest Number" on LeetCode using custom sorting in Java. Converted numbers to strings, sorted by (b+a).compareTo(a+b) for max concatenation. Runtime: 5ms, beats 98.6%. Mastering comparator logic is key.

Developer_X01's tweet image. Day 19 of #100DaysOfCode
Solved "Largest Number" on LeetCode using custom sorting in Java.
Converted numbers to strings, sorted by (b+a).compareTo(a+b) for max concatenation.
Runtime: 5ms, beats 98.6%.
Mastering comparator logic is key.

Day 19 #100DaysOfCode Achieved 98.39% runtime (5ms) on LeetCode's "Largest Number." Optimized: • Ints to strings • Sort w/ custom comparator (b+a).compareTo(a+b) • Handle leading 0s • Use StringBuilder #Java #LeetCode

Developer_X01's tweet image. Day 19 #100DaysOfCode
Achieved 98.39% runtime (5ms) on LeetCode's "Largest Number."
Optimized:
• Ints to strings
• Sort w/ custom comparator (b+a).compareTo(a+b)
• Handle leading 0s
• Use StringBuilder
#Java #LeetCode

Day 18 of #100DaysOfCode Solved LeetCode's "Insert Interval" in Java, beating 98.91% in runtime and 77.09% in memory. Used a 3-step approach: - Add non-overlapping intervals - Merge overlaps - Add remaining Efficient and readable. #Java #LeetCode #Coding

Developer_X01's tweet image. Day 18 of #100DaysOfCode
Solved LeetCode's "Insert Interval" in Java, beating 98.91% in runtime and 77.09% in memory.
Used a 3-step approach:
- Add non-overlapping intervals
- Merge overlaps
- Add remaining
Efficient and readable.
#Java #LeetCode #Coding

Day 17 of #100DaysOfCode Solved the Merge Intervals problem on LeetCode with a unique range-based approach. Runtime: 1 ms — Beats 99.86% Efficiently handled overlapping with preprocessing and range compression using min-max indexing. #Java #LeetCode #Coding #DSA #Algorithm

Developer_X01's tweet image. Day 17 of #100DaysOfCode 
Solved the Merge Intervals problem on LeetCode with a unique range-based approach.  
Runtime: 1 ms — Beats 99.86%  
Efficiently handled overlapping with preprocessing and range compression using min-max indexing.  
#Java #LeetCode #Coding #DSA #Algorithm

Day 16 of #100DaysOfCode Solved "Sort Colors" on LeetCode with 0ms runtime! Used Dutch National Flag algorithm for efficient in-place sorting. #Java #LeetCode #100DaysOfCode #CodingInterview #DSA

Developer_X01's tweet image. Day 16 of #100DaysOfCode
Solved "Sort Colors" on LeetCode with 0ms runtime!
Used Dutch National Flag algorithm for efficient in-place sorting.
#Java #LeetCode #100DaysOfCode #CodingInterview #DSA

Day 15 of #100DaysOfCode Solved LeetCode 1662: Check if two string arrays form the same string. Used StringBuilder for efficient concatenation. 0 ms runtime, beats 100% of solutions. Clean logic, clean result. #Java #LeetCode #ProblemSolving #CodeSmart

Developer_X01's tweet image. Day 15 of #100DaysOfCode
Solved LeetCode 1662: Check if two string arrays form the same string. Used StringBuilder for efficient concatenation. 0 ms runtime, beats 100% of solutions. Clean logic, clean result. #Java #LeetCode #ProblemSolving #CodeSmart

Day 14 of #100DaysOfCode Length of Last Word in Java with 0ms runtime, beating 100% of solutions! Efficient reverse traversal, no split/trim needed—pure logic. Small wins keep momentum strong. #LeetCode #Java #ProblemSolving #CodeNewbie

Developer_X01's tweet image. Day 14 of #100DaysOfCode
Length of Last Word in Java with 0ms runtime, beating 100% of solutions! Efficient reverse traversal, no split/trim needed—pure logic. Small wins keep momentum strong. 
#LeetCode #Java #ProblemSolving #CodeNewbie

Day 13 of #100DaysOfCode Solved Add Binary on LeetCode with a 1ms runtime (top 0.2%)! Used a two-pointer approach with StringBuilder for binary addition from end to start. Efficient and clean 💡 #Java #LeetCode #Coding #100DaysOfCode #DevJourney

Developer_X01's tweet image. Day 13 of #100DaysOfCode
Solved Add Binary on LeetCode with a 1ms runtime (top 0.2%)!
Used a two-pointer approach with StringBuilder for binary addition from end to start.
Efficient and clean 💡
#Java #LeetCode #Coding #100DaysOfCode #DevJourney

Day 12 of #100DaysOfCode I achieved "Accepted" status, passing all 30 test cases! My CountAndSay implementation has excellent runtime (2ms, beating 92.46%) and efficient memory usage (41.3MB, beating 67.13%). #CodingSuccess #Java #Algorithms

Developer_X01's tweet image. Day 12 of #100DaysOfCode
I achieved "Accepted" status, passing all 30 test cases! My CountAndSay implementation has excellent runtime (2ms, beating 92.46%) and efficient memory usage (41.3MB, beating 67.13%). #CodingSuccess #Java #Algorithms

Day 11 of #100daysofcoding LeetCode grind continues! Just conquered another challenge: reversing words in a string. Each line of code brings me closer to mastering algorithms. #leetcode #coding #java #algorithms #problemsolving #developer

Developer_X01's tweet image. Day 11 of #100daysofcoding 
 LeetCode grind continues! Just conquered another challenge: reversing words in a string. Each line of code brings me closer to mastering algorithms.  #leetcode #coding #java #algorithms #problemsolving #developer

Day 10 of #100DaysOfCode Solved "Set Matrix Zeroes" on LeetCode using in-place optimization (no extra space). Used the first row and column as markers to track zeros. Java | 1ms | Beats 72% Comment down for the full code. #LeetCode #DSA #Java #Coding #CodeNewbie #ProblemSolving

Developer_X01's tweet image. Day 10 of #100DaysOfCode
Solved "Set Matrix Zeroes" on LeetCode using in-place optimization (no extra space).
Used the first row and column as markers to track zeros.
Java | 1ms | Beats 72%
Comment down for the full code.
#LeetCode #DSA #Java #Coding #CodeNewbie #ProblemSolving

Day9 - #100DaysOfCode LeetCode's "Missing Number"! My Java solution using an XOR bit manipulation trick was accepted with a 0ms runtime, beating 100% of submissions. This approach shows how bitwise operations can create highly efficient code. #Java #Algorithms

Developer_X01's tweet image. Day9 - #100DaysOfCode
LeetCode's "Missing Number"! My Java solution using an XOR bit manipulation trick was accepted with a 0ms runtime, beating 100% of submissions. This approach shows how bitwise operations can create highly efficient code.
#Java #Algorithms

Day 8 - #100DaysOfCode Solved "Find the Duplicate Number" on LeetCode using Floyd's Cycle Detection Algorithm in Java. Uses constant space, no array modifications. ⏱ Runtime: 4ms | 💾 Memory: 56.98MB #LeetCode #Java #Algorithms #DSA #Coding

Developer_X01's tweet image. Day 8 - #100DaysOfCode
Solved "Find the Duplicate Number" on LeetCode using Floyd's Cycle Detection Algorithm in Java. Uses constant space, no array modifications.
⏱ Runtime: 4ms | 💾 Memory: 56.98MB
#LeetCode #Java #Algorithms #DSA #Coding

Solved "Merge Sorted Array" on LeetCode with 0ms runtime using an efficient in-place Java approach. Merged from the end to avoid extra space. Clean, fast, and interview-friendly! #LeetCode #Java #DSA #Coding #Algorithms #100DaysOfCode

Developer_X01's tweet image. Solved "Merge Sorted Array" on LeetCode with 0ms runtime using an efficient in-place Java approach. Merged from the end to avoid extra space. Clean, fast, and interview-friendly!
#LeetCode #Java #DSA #Coding #Algorithms #100DaysOfCode

Day 06 #100DaysOfCode Solved LeetCode's Majority Element in 1ms | Beats 99.85% 🚀 Used Boyer-Moore Voting Algorithm – O(n) time, O(1) space | Efficient & clean. Check the code below for clarity. #LeetCode #Java #DSA #Algorithms

Developer_X01's tweet image. Day 06 #100DaysOfCode
Solved LeetCode's Majority Element in 1ms
| Beats 99.85% 🚀
Used Boyer-Moore Voting Algorithm – O(n) time, O(1) space | Efficient & clean.
Check the code below for clarity.
#LeetCode #Java #DSA #Algorithms

#100DaysOfCode - Day 5 Rotated an array in-place using three-step reversal. Runtime: 0ms in Java. O(n) solution to a classic. Tip: Use k = k % n to avoid extra rotations. In-place logic saves space. #TechTwitter #ProblemSolving #LeetCode #Java #DSA #Coding

Developer_X01's tweet image. #100DaysOfCode - Day 5
Rotated an array in-place using three-step reversal.
Runtime: 0ms in Java.
O(n) solution to a classic.
Tip: Use k = k % n to avoid extra rotations.
In-place logic saves space. 
#TechTwitter #ProblemSolving #LeetCode #Java #DSA #Coding

#100DaysOfCode - Day 4 Rotated an array in-place using a three-step reverse method in Java. Runtime: 0ms, beats 100%. Efficient, no extra space. See image for clarity. #LeetCode #Java #DSA #100Daysofcode

Developer_X01's tweet image. #100DaysOfCode - Day 4
Rotated an array in-place using a three-step reverse method in Java. Runtime: 0ms, beats 100%.
Efficient, no extra space. 
See image for clarity.
#LeetCode #Java #DSA #100Daysofcode

United States Тренды

Loading...

Something went wrong.


Something went wrong.