Akhilesh K M’s Post

Namaste Connections! 🙏 🚀 Day 89 of my #100DaysOfCodingChallenge Journey! 🎯 Today, I took on a really exciting challenge in the world of Binary Trees 🌳: the 𝐌𝐚𝐱𝐢𝐦𝐮𝐦 𝐒𝐮𝐦 𝐨𝐟 𝐍𝐨𝐧-𝐀𝐝𝐣𝐚𝐜𝐞𝐧𝐭 𝐍𝐨𝐝𝐞𝐬 problem! 💻 This problem was not only fun but also pushed me to think deeply about optimizing the solution for both time and space complexity. The goal was to select nodes from the tree such that no two adjacent nodes were chosen while still maximizing the sum. 💡 𝐾𝑒𝑦 𝐿𝑒𝑎𝑟𝑛𝑖𝑛𝑔𝑠: ⏳ Time Complexity: Managed to solve it in O(n), where n is the number of nodes in the tree. 🚀 🛰 Space Complexity: Optimized to O(h), where h is the height of the tree, keeping the recursion stack space minimal. 🧠 Every day, I’m reminded of how rewarding the journey of continuous learning and problem-solving can be. 🔥 Looking forward to more challenges in the coming days! Let’s keep pushing forward together. 💪 #DataStructures #ProblemSolving #BinaryTrees #CodingJourney #CodingChallenge #100DaysOfCode #CodeToConquer #GeeksForGeeks #LearnInPublic

🎉Milestone Unlocked: Conquered a Medium-Level Recursion Challenge!🎉 I'm thrilled to share that I've successfully solved the "Combination Sum II" problem on my own—a medium-level recursion and backtracking question! 🌟 Recursion and backtracking have always been areas where I tend to struggle. It’s not every day that I crack a medium-level recursion problem without assistance, so this achievement feels especially rewarding. Tackling this problem on my own has boosted my confidence and deepened my understanding of these challenging concepts. It’s a small victory, but it’s milestones like these that make the journey of continuous learning so exciting and fulfilling. Here’s to many more days of pushing through the challenges and conquering the topics that seem the hardest. 🚀 #Recursion #Backtracking #CodingChallenge #LeetCode #ContinuousLearning #ProblemSolving

🚀 Back in Action! 🚀 Just completed Recursion Class - 2 and took a deep dive into advanced recursion concepts with the guidance of Love Babbar and Lakshay Kumar. After a well-needed break, it feels incredible to be back on track and exploring the depths of recursion! 🔍 #CodingJourney #Recursion #WebDevelopment #LearningNeverStops #TechGrowth #LoveBabbar #LakshayKumar

🎯 **Day 3 of #Leetcode100DaysChallenge** 🎯 Today’s challenge was solving the **"Iongest Palindromic SubString"** problem on Leetcode! 🌟 **Problem:**[Iongest Palindromic SubString ] Excited for the continuous learning ahead! 💪 #100DaysOfCode #LeetcodeChallenge #IongestPalindromicSubString #CodingJourney #ProblemSolving

💡 Conquering Recursion with Confidence! 💡 Recursion has always been a challenging concept for me. Every time it came up, I felt overwhelmed and unsure how to approach it. However, I knew that mastering recursion was essential, especially as I prepare for a career in software engineering. That’s when I discovered Kunal Kushwaha’s DSA series on YouTube. His detailed explanations and clear teaching style finally made recursion click for me! 🙌 ✨ Before watching his videos: - I wasn’t confident in my understanding of recursion. - I had no clue how recursion worked in the backend, especially with the call stack. ✨ After completing the recursion topic: - I feel great! 🏆 - I can solve recursion-based problems and approach them with a deeper understanding. I can confidently say that Kunal Kushwaha’s DSA series is far better than many paid courses. If you're on your DSA journey, I highly recommend his content. Here's the link to the series: https://lnkd.in/gWHjcuRG — it’s a game-changer! 🚀 #DSAwithKunal #Recursion #Programming #DSA #ProblemSolving #SoftwareEngineering

🌟 Day 25 of the #DrGVishwanathanChallenge: 100 Days of Code! 🌟 Today's task was to generate all valid combinations of well-formed parentheses given `n` pairs. 🧩 Tackling this involved using recursion and backtracking to ensure balanced and complete parentheses structures. This challenge sharpened my skills in problem decomposition and taught me the value of constraint handling for efficient solutions. Every day brings a new level of learning and excitement! 🚀 #100DaysChallenge #Day25 #ProblemSolving #DataStructures #CodingJourney #DrGVishwanathanChallenge

"🚀 Day 42 of #100DaysOfCode: Revisiting Recursion! 🚀 Today, I: 🔄 Revised key recursion concepts to strengthen my understanding. 🧗♂️ LeetCode: Solved the Climbing Stairs problem - mastering ways to reach the top with recursive solutions. 🔢 LeetCode: Tackled the problem of Reducing Numbers to Zero - enhancing my problem-solving techniques using recursion. Continuing to build my skills and tackle new challenges every day! Let's keep the momentum going! 💪 #CodingJourney #ProblemSolving #TechLife"

Hello everyone, Day 48 of #100daysofAIML The Decision Tree algorithm is a popular supervised machine learning algorithm used for both classification and regression tasks. It builds a predictive model in the form of a tree structure by recursively partitioning the input space into subsets based on feature values. How Decision Tree Works Building the Tree 1. **Feature Selection**:   - Choose the best feature to split the dataset based on certain criteria such as information gain, gain ratio, or Gini impurity.    2. **Splitting**:   - Divide the dataset into subsets based on the selected feature's values. Each subset corresponds to a branch in the tree.    3. **Recursive Partitioning**:   - Repeat steps 1 and 2 for each subset (node) until a stopping criterion is met, such as reaching a maximum tree depth, minimum samples per leaf, or purity threshold. Making Predictions - **Classification**:   - For a new instance, traverse the tree from the root node down to a leaf node based on the feature values of the instance. The leaf node's majority class is then assigned as the predicted class for the instance. - **Regression**:  - For regression tasks, the leaf node's value (e.g., mean or median) is assigned as the predicted continuous value for a new instance. Criteria for Splitting Information Gain - Measures the reduction in entropy (uncertainty) caused by partitioning the dataset based on a feature. A higher information gain indicates a better feature for splitting. Gini Impurity - Measures the probability of incorrectly classifying a randomly chosen element if it were randomly labeled. A lower Gini impurity indicates a better split. Gain Ratio - Adjusts the information gain by taking into account the number of branches each split produces, penalizing splits that result in many branches. #100DaysOfTech #TechChallenge #LearnTech #TechJourney #CodeEveryday #TechLearning #ProgrammingChallenge #TechSkills #DailyTechChallenge #TechProgress #CodeChallenge #100DaysOfCode #TechMilestone #DailyCoding #TechExplorer #CodeLearning #TechCommunity #CodingJourney #TechEnthusiast #LearnToCode #edam Yasasvi Mandapati Abhishek Nagaraja Vishnu Sai Nadella e-DAM

🚀 Day 21/100: LeetCode Challenge 🚀 Today, I solved 1502. Can Make Arithmetic Progression From Sequence, and it reminded me of an important lesson: "Sometimes, in the pursuit of advanced techniques, we overlook the simplicity of a problem." This question was a refreshing reminder to not overcomplicate solutions. A quick sort and a simple traversal were all it took to crack it! 🔥 ✅ Key takeaway: Mastering the basics is just as important as learning advanced algorithms. On to the next challenge! 💪 #100DaysOfCode #LeetCode #ProblemSolving #CodingJourney #KeepItSimple

🌟 Day 30 of the #DrGVishwanathanChallenge: 100 Days of Code! 🌟 Today's challenge was all about finding unique combinations that sum to a given target using the candidate numbers from a collection! 💡 It’s a great problem to practice backtracking and exploring all possible combinations while avoiding duplicates. The problem tested my ability to efficiently handle combinations and recursion, crucial skills in tackling complex problems. 🚀 Every step towards solving this kind of problem sharpens my algorithmic thinking and problem-solving ability. 💻 Excited to keep pushing forward and solving more! 💪 #100DaysChallenge #Day30 #ProblemSolving #Backtracking #CodingJourney #DrGVishwanathanChallenge