Giskard’s Post

Hello Connections! 💫 Excited to share that I've successfully completed Day 22 of #75daysofdsa 🚀 Today's focus was on LinkedList and Stacks, and here are the questions I conquered: Critical Point and maximum minimum distance Flatten a multi-level doubly circular linked list Linked list Implementation of stack Array implementation of stack I'm committed to maintaining this consistency throughout the challenge. If you have any insights or tips, feel free to share! Let's crush those coding goals together! 💻💡 #DataStructures #Algorithms #LeetCode

#day73 Hi folks, Today, I solved the leetcode problem "SearchMatrix", with a time complexity of O(log*n), which is of a medium level. Thanks! #cpp #consistency #streak #datastructure #dsa #codingchallenge #leetcode #consistency #happycoding

Hello Connections! 💫 Excited to share that I've successfully completed Day 27 of #75daysofdsa 🚀 Today's focus was on Queues, and here are the questions I conquered: Implement queue by array Implement queue by linkedlist Implement circular queue by array Implement deque by array and doubly circular linkedlist I'm committed to maintaining this consistency throughout the challenge. If you have any insights or tips, feel free to share! Let's crush those coding goals together! 💻💡 #DataStructures #Algorithms #LeetCode

Hello Connections! 💫 Excited to share that I've successfully completed Day 19 of #75daysofdsa 🚀 Today's focus was on LinkedList, and here are the questions I conquered: Find the middle node of a linkedlist Delete the middle node of a linkedlist Cycle detection in a linkedlist Finding the node where cycle begins in linkedlist I'm committed to maintaining this consistency throughout the challenge. If you have any insights or tips, feel free to share! Let's crush those coding goals together! 💻💡 #DataStructures #Algorithms #LeetCode

#day67 Hi folks, Today, I solved the leetcode problem "SearchinRotatedArray II", with a time complexity of O(log*n), I solved the first problem also that is "SearchinRotatedArray" earlier but this 2nd version is tough so I saw the solution of it, still I can't visualize the problem completely in my mind but in future for sure. Thanks! #cpp #consistency #streak #datastructure #dsa #codingchallenge #leetcode #consistency #happycoding

👨💻Here we go again 😊 (Time for new Code),What will be logged to the console when you execute this code? What will be logged to the console when you run this code snippet?, Unlock the code to success with our Goo business and get the opportunity to grab the offer,( Comment your answer ) ,click on the link (https://lnkd.in/gFBCFtn6) #innovateandcode #algorithmalchemy #geekygizmos #datadynamos #techtinker #bytebrigade #syntaxsavvy #codechronicles #techtrends #codecraze #digitaldiscovery #techtribe #codecreators

🌳 Day 142 of #365DaysOfCode 🌳 Today's challenges focused on enhancing my skills with binary trees: 1. Binary Tree Inorder Traversal (https://lnkd.in/g8ibiUbR): Strengthened my understanding of this key traversal technique. 2. Flatten Binary Tree to Linked List (https://lnkd.in/gC-Qn7B5): Mastered the process of converting a binary tree into a flattened linked list. - What real-world applications have you encountered where flattening a binary tree to a linked list was particularly useful? Thanks for your support and engagement as I continue this journey! #365DaysOfCode #BinaryTrees #CodingChallenge #DataStructures #TechLearning LeetCode GeeksforGeeks takeUforward

#day80 Hi folks, Today, I solved the leetcode problem "sortVowels", with a time complexity of O(n) and a space complexity of O(n), which is of a medium level. Thanks! #cpp #consistency  #streak #datastructure #dsa #codingchallenge #leetcode #happycoding

Day 25 of #100DaysOfCode 🚀 Today's challenge took me to the peak of problem-solving! ⛰️ I tackled the "Find Peak Element" problem – discovering an element in an unsorted array that's greater than its neighbors, and I did it in O(log n) time complexity. 🤯 💡 How I did it: Local Comparison: The secret lies in analyzing each element's immediate surroundings, not the entire array. Binary Search: Splitting the array in half repeatedly, I honed in on potential peak locations by comparing middle elements with their right neighbors. Convergence: This process narrowed down the options until I pinpointed the peak itself! The efficiency of binary search made this solution both elegant and powerful. 💪 Github: https://lnkd.in/gucBtr5q Follow along as I continue my #codingchallenge! There's always something new to learn. #Algorithms #BinarySearch #TechJourney #LearningNeverStops #SoftwareEngineer

🚀 Day 72 of my 100 Days of Code Challenge! 📚💻 Today was all about, tackling a set of diverse questions of LinkedList. 🌐🔢 #100DaysOfCode #LinkedList #datastructures #algorithms #SoftwareEngineer #ProblemSolving #JavaProgramming