Marc Garner

🚀 Day 12 of my DSA Challenge 🚀 Today, I tackled the Set Matrix Zeroes problem! 🔢 The task was to efficiently set entire rows and columns to zero if an element in the matrix is zero. While it seemed tricky at first, breaking it into smaller steps and optimizing the approach helped me achieve an efficient solution! ✅ Key takeaways: Reinforced my understanding of array manipulation and problem-solving strategies. Every day in this challenge brings new learning, and I'm loving the process! 💻 If you're also solving DSA problems, let me know in the comments—let's share ideas and grow together! 🙌 #DSAChallenge #ProblemSolving #CodingJourney #NeverStopLearning

2

1 commentaire

🚀 Day 12/30 of the DSA Challenge 🚀 Today, I dive deep into the world of singly linked list. I have explore more problems with different approach and new concepts. Consistency is proving to be the most rewarding aspect of my journey! 🔄 Previous Revision + Problems Solved 🔄 Merging Two Sorted Linked Lists into One: Combining two sorted lists into a single, streamlined sorted list. Merging Multiple Sorted Linked Lists into One: Tackling the challenge of merging multiple sorted lists while maintaining order. Finding the Middle Element of a Linked List: Implementing efficient algorithms to pinpoint the exact middle of the list. Cycle Detection in a Linked List: Utilizing advanced techniques to determine if a linked list contains a cycle, a crucial skill for list manipulation. This marks Day 12 of my 30-day DSA challenge. The journey has been incredibly enlightening, and I'm thrilled to continue exploring more data structures and algorithms in the days ahead. Let's keep pushing the boundaries and growing together! 💪✨ #dsa #30daydsachallenge #cpp #striverdsasheet #linkedlist #coding #programming #learning #growth

4

|| Ashu Maurya || : This post for restart our social sharing journey and showing some good skills 🙂 🎉 Just unlocked a new achievement: 🎉 I passed the HackerRank CSS Certification test! 🚀✨ It was quite a surprise to stumble upon this opportunity today, but I couldn't be happier with the outcome. While I make it a point to keep my CSS skills sharp through regular practice, this certification test was a fantastic way to validate my knowledge and take it to the next level. Huge shoutout to HackerRank for offering such a valuable certification program. It's not only a great confidence booster but also an excellent way to showcase your skills to potential employers in the competitive world of Front-end Development. 💼💻 If you're looking to level up your skills and stand out in the field of web development, I highly recommend checking out HackerRank's Certification track. Trust me, it's worth the journey! 🌟 #HackerRank #CSS #Certification #FrontEnd #WebDev #LevelUp #CareerDevelopment #LinkedInLearning

15

Hello connections..!! A quick project to refresh my skills and add a little inspiration to the mix. "Who doesn’t love a good quote?"💡 I've built a "Random-Quote-Generator" using HTML, CSS, and JS to brush up on my web development skills using API. Always good to revisit the basics! 🚀 You can definitely check it out this project and it's codes from here: https://lnkd.in/guzAqC6H #WebDevelopment #Learning #HTML #CSS #JavaScript

61

3 commentaires

Solved todays POTD of geeks for geeks the problem was simple in which we were asked to find the repeating and missing in an array of 1 to n. the most straight forward approach is to make a visited array of size n+1 and maintain it according to the given array. if arr[i]==2 in visited array then that index is repeating. if arr[i]==0 in visited array then that index is missing. keep coding:)). #geekstreak2024  #deutschebank GeeksforGeeks Deutsche Bank

20

1 commentaire

🚀Day 180 of #365daysofcodechallenge #problemsolving #restart #competitiveprogramming 🎯Today's Problem on GeeksforGeeks is :- Find maximum volume of a cuboid:- You are given a perimeter & the area. Your task is to return the maximum volume that can be made in the form of a cuboid from the given perimeter and surface area. Note: Round off to 2 decimal places and for the given parameters, it is guaranteed that an answer always exists. Examples Input: perimeter = 22, area = 15 Output: 3.02 Explanation: The maximum attainable volume of the cuboid is 3.02 Expected Time Complexity: O(1) Expected Auxiliary Space: O(1) Constraints : 1 ≤ perimeter ≤ 109 1 ≤ area ≤ 109 Difficulty Level of this problem is EASY. #problemsolving #codingchallenge #geeksforgeeks #codingjourney #consistency #consistencyiskey #leetcode #leetcodechallenge #nesaralam GeeksforGeeks LeetCode

18

1 commentaire

Day 51 of #365daysofcode 📢 Todays DSA progress 💻 ✅ Minimum Moves to Equal Array Elements II 🔗 https://lnkd.in/gW9En35j #LearnInPublic #buildinpublic #Coding #DSA #leetcode #letsconnect

7

1 commentaire

Hello #Connections Day63/100✅ Of #DrGViswanathan Challenge Problem Statement - Shuffle String In this problem you are given a string s and an integer array indices of the same length. The string s will be shuffled such that the character at the ith position moves to indices[i] in the shuffled string. Return the shuffled string. #100DaysOfCode #Leetcode #Java

11

Hello Geeks..! We are here for you with the Ultimate Challenge GfG160 🥳🎉 Boost Your DSA Skills with GfG 160! 🎯 💻 Solve a daily DSA problem 📚 Watch editorials & tackle bonus problems ✔️ Become interview-ready in just 160 days! 🎒 And that's not all—earn an assured GeeksforGeeks bag as you complete the journey! Start your journey to mastering DSA today! 🚀 𝗛𝘂𝗿𝗿𝘆 𝗨𝗽 𝗥𝗲𝗴𝗶𝘀𝘁𝗲𝗿 𝗡𝗼𝘄! https://lnkd.in/g8fdNr9n *Insight of GfG 160💡✨ Comprehensive Topic Coverage: Arrays, Strings, Sorting, Hashing, Two Pointer Technique, and more. Perfect for Coding Interviews: Enhance Student's programming abilities and prepare for interviews. Structured Learning: Follow a roadmap for maximum effectiveness. *Key Benefits of GFG 160🗝️💻 160 Curated DSA Problems: Solve the most essential problems, each supported by detailed articles and video explanations. Bonus Practice: 90 additional problems for a total of 250 challenges to strengthen your skills. Exclusive Completion Certificate: Showcase your achievements and skills to future employers. Free Career Roadmap Workshops: Learn about trending technologies like DevOps, Full Stack, and more to stay ahead. Exciting Rewards: Consistent effort guarantees you a cool GeeksforGeeks bag as a token of their dedication!🧑🏻‍💻 #gfg160 #geeksstreak2024 #GFGStudentChapter #GeeksforGeeks #DSA #CodingJourney

27

3 commentaires

Day 15 of the #100DaysOfCode Challenge ✅ Solved 2 DSA problems ✅ Revised MERN concepts ✅ Continued working on my React project ❌ Still struggling with the ECE final year project research Another productive day focusing on both DSA and MERN revision. I’m making good progress in my web development journey, but still need to crack the right project idea for my ECE final year work. Any tips or suggestions are appreciated! #WebDevelopment #React #MERN #DSAPractice #CodingJourney #InterviewPrep #100DaysOfCode #ECE #WirelessCommunication #Electronics #TechLearning

8

🚀 DSA Journey with @ApnaCollegefb: Day 16 🚀 🔹 Bitwise Operators 🔹 One's Complement 🔹 Bitwise Shift Operators 🔹 Check if Odd or Even 🔹 Get ith Bit 🔹 Set ith Bit 🔹 Clear ith Bit 🔹 Check for Power of 2 🔹 Update ith Bit 🔹 Clear Last i Bits 🔹 Count Set Bits 🔹 Fast Exponentiation Excited to dive into the world of bit manipulation! #DSA #100DaysOfCode #ApnaCollege #CodingJourney #Day16

8

1 commentaire

Day 9️⃣ 2️⃣ of #100daysofcoding and #75daysDSA Challenge 🚀 Today , I learnt about Priority Queues and the Big O of Heaps in DSA. >> Priority Queues A priority queue is an abstract data type that operates similarly to a regular queue but with an added feature: each element has a priority associated with it. In a priority queue, elements with higher priorities are dequeued before elements with lower priorities. If two elements have the same priority, they are dequeued in the order they were enqueued. >> Big O Complexity in Heaps The time complexity of heap operations is crucial for understanding their performance in various scenarios. Below is a summary of the time complexities for different heap operations: • Insert (push): O(log n) • Remove (pop): O(log n) • Peek: O(1) • Heapify Up: O(log n) • Heapify Down: O(log n) • Build Heap: O(n) #DSA #DataStructures #Algorithms #100daysofcoding #75daysDSA #Heaps #PriorityQueue #BigO

19

2 commentaires

Day 13 of 100 Days of DSA Challenge – Two Sum II with Sorted Input 🔎🔢 Hello, LinkedIn! It’s Abinaya with today’s update on my #100DaysOfCode journey! 🎯 🔹 Challenge: Today’s task was Two Sum II – Input Array Is Sorted. Using a sorted array opened up possibilities to solve the problem more efficiently by leveraging its order. This problem gave me hands-on experience with the two-pointer technique in C! 🔹 Key Takeaway: Using sorted input as a strategy and pointers to control traversal turned out to be a game-changer for both speed and clarity. It was a practical exercise in building more efficient solutions. #DSAwithEdSlash #DSAChallenge #CProgramming #TwoPointers #SortedArray #TechWithAbinaya #ProblemSolving #LearningEveryday

13

🚀 Day 150 of My DSA Journey: Tackling the Permutation Sequence Problem! 🎯 💡 Problem Overview: Given the numbers [1, 2, ..., n], the task is to find the k-th permutation sequence in lexicographical order. For example: 🔹 n = 3, k = 3 → Output: "213" 🔹 n = 4, k = 9 → Output: "2314" Sounds simple, right? But with 𝑛 ! n! permutations, efficiently finding the k-th sequence is a challenge! 🧩 🧠 Approaches to Solve: 1️⃣ Brute Force: Generate all permutations of [1, 2, ..., n] using backtracking, sort them, and pick the k-th one. ⏳ Time Complexity: O(n!) 💾 Space Complexity: O(n!) 2️⃣ Optimized Factorial Indexing: Instead of generating all permutations, leverage the properties of factorials: ✔️ Calculate indices directly. ✔️ Use 𝑘 − 1 k−1 as a zero-based index. ✔️ Iterate over numbers to construct the sequence. ⏳ Time Complexity: O(n 2) (due to repeated list updates) 💾 Space Complexity: O(n) 3️⃣ Recursive Factorial Logic: Similar to the factorial approach but implemented recursively for elegance! Each recursive call finds the next digit and adjusts 𝑘 ⏳ Time Complexity: O(n 2) 💾 Space Complexity: O(n) ✨ Fun Fact: The factorial-based solution doesn't require generating all permutations, making it a go-to approach for solving problems involving permutations efficiently! 🎉 🔗 GitHub Repo: I’ve documented this journey and more solutions in my GitHub repository—check it out for detailed explanations and more examples! 🌟 https://lnkd.in/dUmGeWry #DSA #Recursion #PermutationSequence #CodingJourney #AlgorithmDesign #HardProblems #ProgrammingLife #TechCareers #CodingChallenge #LeetCode #GeeksForGeeks #CodeNewbie #PythonDev #JavaScript #CPlusPlus #ProblemSolving #DataStructures #TimeComplexity #SpaceComplexity #DailyCoding #TechLearning #EfficiencyMatters #CodingCommunity #GitHubRepo #DevLife #TechEducation #ProblemOfTheDay #CodeChallenges #CodingFun #SoftwareEngineering #WomenWhoCode

37

2 commentaires

Day 7 of the GeeksforGeeks 160 Days DSA Challenge! 🎯 Today’s problem: Stock Buy and Sell - Multiple Transaction Allowed ✅ Another step forward in mastering data structures and algorithms. Let’s keep the momentum going! 🚀💻 #gfg160 #geekstreak2024 #DSAChallenge #CodingGoals #GeeksForGeeks

2

#Day22 DSA (Priya Bhatia )(Raghav Garg ) Question covered =>count pairs whose sum is less than target WebDevelopment (Anurag Singh ) #CSS -Position Static -Position Relative in Depth -Top Property with Relative Position -Bottom Property with Relative Position - Left Property with Relative Position -Inset Property with Relative Position -Unset Value of Relative Property 🔻Position property of each element is static(by default), we can set it relative or absolute or sticky or fixed. 🔻inset ⇒ it includes all 4 (top, bottom, left , right) 🔻unset ⇒ it will change the position to static #css #html #javascript #dsa #algorithms #datastructure #frontend #coding #developer #consistency #learnings #staymotivated #techjourney #leetcode #dailyquestions #connections #web #webdevelopmeny #bennett #bennetian #codeeveryday

5

Day 45/100: Determine the middle element in the LinkedList by using predefined functions in robust language Java. #100dayscodechallenge

15

"Day 4: Pushing boundaries and writing lines! 📜✨ #CodeChallenge" #NxtWaveCodingChallenge  #HTML  #CSS  #Bootstrap  #WebDevelopment  #FrontendDevelopment  #ContinuousLearning  #CodingJourney  #SkillUp

14

--- 🚀 Day 11/100 of DSA Challenge: Middle of the Linked List! Today, I dove into the world of Linked Lists and tackled the problem of finding the Middle of the Linked List. 🌟 🔍 Problem Summary: Given the head of a singly linked list, return the middle node. If the list has an even number of nodes, return the second middle node. 🛠 Key Insight: The solution involves traversing the list to count the nodes and then traversing again to find the middle—simple yet efficient with a time complexity of O(n)! 💡 Why Linked Lists? They’re dynamic and efficient with memory usage. Understanding the traversal logic is crucial for mastering many advanced algorithms. Excited and energized for Day 12! #100DaysOfCode #DSA #LinkedList #CodingChallenge #TechJourney #ProblemSolving ---

8