Luis Majano’s Post

See runtime usages Code usage analytics are critical for understanding code functionality and implementing changes quickly and smoothly. Digma overlays observability over code, so developers can see the application flows triggering any code location, query, HTTP call, or any other asset. This provides an automatic view of any runtime dependencies. https://lnkd.in/dgYgicF9 #continuousfeedback #java #springboot #kotlin #coding

What do you know about Vector API and TornadoVM? 🌪️ Watch Konrad Szałkowski’s talk to learn what these solutions offer to JVM developers. 👉 https://lnkd.in/dfR7iygP #JDDKrakow #Programming #Coding #Conference #Krakow #JVM #Java #Software #Developers #SIMD #Vector #API

#Day38🚀 Successfully Solved the 💻"Game of Life" problem on LeetCode today! Implemented the simulation of the famous cellular automaton, ensuring the board evolves accurately according to the rules for each generation. This was a great exercise in matrix manipulation and simulation logic💥 #LeetCode #GameOfLife #MatrixSimulation #CodingChallenges #TechJourney #java #problemsolving #continuouslearning

Solve this question and get Rewards 🎖️ First uppercase letter in a string (Iterative and Recursive) Given a string find its first uppercase letter Examples : Input : geeksforgeeKs Output : K Input : geekS Output : S Hint : Method 1: linear search Using linear search, find the first character which is capital Solution of this question will be posted at night after 11 PM Leetcode Challenge #ProblemSolving #Recursion #C++ #Java #leetcode #hackerrank #Developers #Automation #softwareengineers

🚀 Day 72/100 of #100DaysOfCode Today, I solved LeetCode Problem 152: Maximum Product Subarray with an efficient approach that achieved a runtime of 0ms (100%)! 🎯 🔍 #Problem #Highlights: The goal was to find the subarray with the largest product in a given integer array. ⚙️ #My #Approach: Iterative Product Tracking: Maintained a running product while checking against the current maximum. Reset the product to 1 whenever it reached 0 to ensure continuous subarray evaluation. Handled edge cases like single-element arrays effectively. 📊 #Results: ✅ #Runtime: #0ms (Beats 100%) ✅ #Memory Usage: 44.97 #MB 💡 #Takeaways: Sometimes, simplicity in logic leads to optimal performance. Iterative solutions can handle a wide range of edge cases with minimal extra space. Excited to keep the momentum going as I near the finish line of this challenge! 💪 #Java #DSA #LeetCode #CodingJourney #ProblemSolving #DsaWithKunal

If you're looking for an effective tool to automate object mapping in Java, we’ve prepared an article about #MapStruct on the j-labs software specialists tech blog! ^ Eliminate the need for manual mapper creation. ^ Reduce boilerplate code, making your mappings more efficient and cleaner. ^ Discover the perfect solution for projects with many DTOs! Read how MapStruct can make your life easier: https://lnkd.in/djcMFVM3 #java #mapstruct #automation #programming #dto #cleancode

🚀 Day 63 of #100DaysLeetCodeChallenge 💻</> ✅Solved one Medium problem today. #29 Divide Two Integers :  Given two integers dividend and divisor, divide two integers without using multiplication, division, and mod operator. The integer division should truncate toward zero, which means losing its fractional part. For example, 8.345 would be truncated to 8, and -2.7335 would be truncated to -2. Return the quotient after dividing dividend by divisor. </> If you have any suggestions or feedback on this solution, please feel free to 💬 comment! . #LeetCode #100DaysOfCode  #CodingJourney #ProblemSolving  #Java #FrontendDev  #CSE #StudentLife #pu #Code #MERN  Thankyou 💐

If debugging is the process of removing bugs, then programming must be the process of putting them in. 🐛Sometimes, the only way to find a bug is to create a new one. 🐞When in doubt, blame the compiler. 😆 #codefails #devjokes #codingmishaps #ProgrammerProblems #hasbisoft

🚀 Day 88-90 of #100DaysOfCode 🚀 Revising and solving some Tree Problems - ✅ Binary Tree Level Order Traversal. ✅ Iterative Preorder Traversal. ✅ Iterative Inorder Traversal. ✅ Iterative Postorder Traversal with 2 stack. #DSA #coding #webdevelopment #leetcode #tech #java #cpp #LearnToCode #TechSkills

Day 230 of #365daysofcode Quesiton Solved : Longest Palindrome code link : https://t.ly/FDfjZ #leetcode #day230 #leetcodechallenge #java #tech #coding #string #github #problemsolving #learningeveryday #striversDSA #datastructure #algorithm