Meghana Yabaku’s Post

Day 6/45 : #CrackYourInternship #CrackYourPlacement Challenge of Arsh Goyal DSA Sheet ✅ Solved 4 problems (1 - Medium ; 3 - Hard) ->Insert Delete GetRandom O(1) - Duplicates Allowed ->Largest Rectangle in Histogram ->Split Array Largest Sum ->Search in Rotated Sorted Array Here is My GitHub Repo : https://lnkd.in/gYm7VUCV #DSAChallenge #CodingJourney #ConsistentGrowth

Day 5/45 : #CrackYourInternship #CrackYourPlacement Challenge of Arsh Goyal DSA Sheet ✅ Solved 4 problems (2 - Easy ; 2 - Medium) ->Subarray Sums Divisible by K ->Subarray Sum Equals K ->Max Value Of Equation ->Reverse Pairs Here is My Github Repo : https://lnkd.in/gYm7VUCV #DSAChallenge #CodingJourney #ConsistentGrowth

Day 30/45 : #CrackYourInternship #CrackYourPlacement Challenge of Arsh Goyal DSA Sheet ✅ Solved 3 problems (2 - Medium ; 1 - Hard) Here is My GitHub Repo : https://lnkd.in/gYm7VUCV #DSAChallenge #CodingJourney #ConsistentGrowth

🚀 Day 17 of My 45-Day DSA Challenge! 🚀 Hey everyone! 👋 Continuing strong with my 45-day challenge inspired by Arsh Goyal! Today, I focused on solving problems related to linked lists. 🌟 🔍 Problems Solved Today: Reorder List Rearrange the Given List In-Place Segregate Even and Odd Elements in a Linked List 💻 GitHub Repository: You can find all my solutions here:(https://lnkd.in/gEGZ3i-x) GitHub Repository. Feel free to explore and provide feedback! A huge thanks to Arsh Goyal for the inspiration. Let’s keep up the momentum and crack those internships together! 💪 Note: If you have any suggestions or feedback, please feel free to share them in the comments or via direct message. Your support is much appreciated! It might happen that the repository is not updated sometimes. #45DayChallenge #DSA #CodingJourney #ProblemSolving #LearningEveryday #GitHub #Coding #Programming #CrackYourInternship Arsh Goyal

🚀 Day 12/45: 45-Day Coding Challenge Arsh Goyal DSA Sheet Today I've solved 6 questions on topics Linked Lists,Array. Today, I tackled the following problems: 1)Add Two Numbers 2: Added two numbers represented by linked lists (variant). 2)Container With Most Water: Found the container that can hold the most water where at each index we have different heights. 3)Merge Two Sorted List: Merged two sorted linked lists into one. 4)Palindrome Linked List: Checked if a linked list is a palindrome. 5)Reverse Linked List: Reversed whole linked list from start to end 6)Reverse Linked List 2: Reversed a portion of a linked list from position left to end which are some nodes in between. Github Repo:[https://lnkd.in/gfKWB3PC] Challenge link:[https://lnkd.in/gv4QcHN5] #CrackYourInternship #CrackYourPlacement #CodeEveryday #45DaysOfCode

Day 56 of 100: Diving into Backtracking While Tackling College Deadlines Today, I balanced between college submission work and continuing my coding journey. Despite the busy day, I managed to dive deep into the fascinating world of Backtracking! Here’s what I covered: 1. Decision Backtracking: Used this to perform operations on arrays by making decisions and undoing them when necessary. 2. Optimization Backtracking: Focused on finding subsets of a string, ensuring I eliminated paths that wouldn't lead to valid solutions. 3. Enumeration Backtracking: Worked on generating all permutations of a string by exploring every possible configuration. Even with the added pressure of college submissions, I'm glad I stayed consistent. The hustle is real, but the learning never stops! Looking forward to more challenges ahead! #Day56 #100DaysOfCode #Backtracking #ProblemSolving #Java #CodingJourney #CollegeSubmissions #LearnToCode

🚀 Update - Day 16/45 of 45Days DSA #CrackYourInternship #CrackYourPlacement Challenge by Arsh Goyal Sir 💻 #code #PlacementPractice #leetcode #dsa #dsachallenge Attempted 5 Questions :- 1. Minimum moves to equal array element II 2. Permute two arrays sum every pair greater equal k 3. Implement stack using queues 4. Implement stack and queue using deque 5. Minimum swaps to sort GitHub - https://lnkd.in/gf9z9Afk

I'm attempting to take the 30 days DSA challenge by Educosys. They post a question each day in our DSA community. I don't think I'll be able to complete 1 question each day. But I'll stay consistent in practicing everyday and complete all the questions by the end. I have created a git repo and will keep posting my solutions for all the days in it. For day1 we were given a leetcode question to decode a string. Leetcode question : https://lnkd.in/dJa9ey9B In this problem we need to find out the number of ways we can decode a numeric string. For eg 1911 can be decoded as ‘1,9,1,1’, ’19,1,1’ ’1,9,11’ ’19,11’ . Single digits can range from 1 to 9. Double digits come with conditions : 1. If number starts with 1, second digit can be from 0 to 9. 2. If number starts with 2, second digit can’t be greater than 7 (According to the description). Also I need to check if the String doesn’t have any leading zeros. Numbers like these : 1901 will give me zero as output as 90, 0 , 01 are all invalid numbers. My actual problem is to decode the entire string. My subproblem is to decode from n - 1 or n - 2 position for n to 0 approach and decode from 0th or 1st position for 0 to n approach.  After doing recursion for both approaches, I got TLE (Time Limit Exceeded) as output. I used memoization to handle repeating subproblems. After this, I passed all test cases. I tried the DP solution with some help from the solutions section of leetcode. I’m pasting my 30Day project git repo link for all the tried solutions for day1. Leetcode question : https://lnkd.in/dJa9ey9B Day1 Link : https://lnkd.in/dEt338HQ

🎯 Day 2 of my 45-Day C++ and DSA Challenge! 🚀 Hello LinkedIn community! Today marks the beginning of an exciting journey as I embark on a 45-day challenge to master C++ programming and Data Structures & Algorithms (DSA). With the goal of enhancing my coding skills and problem-solving abilities, I’m dedicating this summer vacation to intensive learning and practice. 📚 Today's Focus: Operators and Expressions in C++ 🔍 What I Learned: Arithmetic, relational, logical, bitwise operators. 💻 Practical Application: I wrote a simple C++ program to demonstrate the use of Arithmetic, relational, logical, bitwise operators. 🔄 Reflection: It was a productive start to my challenge. I’m looking forward to diving deeper into C++ and DSA concepts. 🚀 Follow My Journey: I’ll be sharing daily updates on my progress. I’m excited to continue this journey and share my progress with all of you. hashtag #Learning hashtag #Programming hashtag #C++ hashtag #DataStructures hashtag #Algorithms hashtag #CodingChallenge hashtag #ContinuousLearning

🚀 Day 11/45: 45-Day Coding Challenge Arsh Goyal DSA Sheet Today I've solved 5 questions on topics Linked Lists. Today, I tackled the following problems: 1)Add two Linked Lists: Added two numbers in reverse order represented by linked lists. 2)Delete nodes having greater value on right: Deleted nodes in a linked list that have greater values to their right. 3)RemoveDuplicates from sorted LinkedList: Removed duplicates from a sorted linked list. 4)Remove Linked List elements: Removed specific elements from a linked list. 5)Sort a linked list of 0s, 1s, and 2s: Sorted a linked list containing 0s, 1s, and 2s. Github Repo:[https://lnkd.in/gfKWB3PC] Challenge link:[https://lnkd.in/gv4QcHN5] #CrackYourInternship #CrackYourPlacement #CodeEveryday #45DaysOfCode