Ed Donner’s Post

Setbacks may have you feeling defeated, fired up, or a little bit of both. But how do you choose the best path forward from there? In this episode of Compiler, two technologists share their experiences facing workplace challenges—one with perseverance, and the other with creative problem solving. https://red.ht/42vlauV

🚀 Excited to share my latest article on Medium: "Top Interview 13/150 (238. Product of Array Except Self)"! 🎯 In this piece, I dive deep into five different approaches to solving the Product of Array Except Self problem in Go, comparing their pros, cons, and performance based on detailed benchmarks. Whether you're optimizing for speed, simplicity, or scalability, you'll find insights to help you tackle similar challenges in your projects. Check it out and let's discuss how we can solve complex problems with efficient code! 💻 #GoLang #Coding #LeetCode #Medium

Have you ever been part of an interview that includes Fizz Buzz questions? Fizz Buzz is a classic coding challenge that helps test your understanding of loops and conditionals. Here's how it works: Write a program that prints the numbers from 1 to 100. But for multiples of three, print "Fizz" instead of the number, and for the multiples of five, print "Buzz". For numbers which are multiples of both three and five, print "FizzBuzz". #interviewtips #FizzBuzzChallenge #CodingPractice

🚀 Day 2 of My 45-Day DSA Challenge: Conquering Greedy Algorithms! 🚀 Hello, Connections! 👋 Today is Day 2 of my 45-day Data Structures and Algorithms (DSA) challenge, and I had a blast diving into greedy algorithms and solving more two-pointers problems based on arrays. Here's a quick rundown of the five LeetCode problems I tackled today: Majority Element: Finds the element that appears more than half the time in an array. Rotate Array: Rotates an array to the right by a given number of steps. Best Time to Buy and Sell Stock: Maximizes profit from buying and selling stock once. Best Time to Buy and Sell Stock II: Maximizes profit from multiple buy-sell transactions. Jump Game: Determines if you can reach the last index of an array by jumping. Fun fact: Did you know that the greedy algorithm got its name because it always makes the "greedy" choice, aiming for immediate benefit? It’s like grabbing the biggest cookie from the jar without thinking twice! 🍪💡 Feeling accomplished with today's progress and eager to see what tomorrow brings. The support from the coding community keeps me inspired, and I look forward to continuing this exciting journey together! Let's keep pushing our limits and growing as coders. 🚀💻 #DSAChallenge #CodeEveryDay #LevelUpYourSkills #TechCommunity #LearningJourney #CodeTogether #LeetCode #AlgorithmMastery #ProblemSolving #TechGoals #JobHunt #CareerGrowth #TechSkills

🎯 Always Looking for the "Good Enough" Answer? The Greedy Algorithm Might Be Your New Best Friend! 🚀 Software engineers, we all strive for optimal solutions. But sometimes, "good enough" is good enough, especially when deadlines loom. Enter the Greedy Algorithm – the master of finding locally optimal solutions, even if they aren't always globally perfect! 💼💡 Let's explore the fascinating world of Greedy Algorithms: 🏃♂️ The "Quick Wins" Approach: How Greedy Algorithms prioritize immediate benefits, even if the long-term outcome might not be ideal. (It's not about laziness, it's about efficiency!) 💨💼 🤔 Making (Mostly) Wise Choices: Understanding the trade-offs between greedy solutions and globally optimal ones. (Sometimes, "good enough" is truly good enough!) 🤝💭 🌍 Real-world applications that surprise you! (From finding the shortest path to making change – Greedy Algorithms are everywhere!) 🗺️💰 🚧 When the shortcut backfires: Unmasking the potential pitfalls of Greedy Algorithms and when a different approach might be better. (Sometimes, slow and steady wins the race!) ⚠️🐢 Get ready to expand your algorithmic toolbox and discover how "good enough" can be a powerful strategy! P.S. What are some surprising applications of Greedy Algorithms YOU've encountered? Share your "good enough" stories (and code snippets!) in the comments! 💬📝 #algorithms #greedy #coding #softwareengineering #efficiency #problemsolving 🛠️🔍

Tech Trivia Monday (TTM) Officially Starts Today!! 🎉 I'm going to be sharing interesting and lesser-known facts about technology, development, or project management that we use or say everyday without actually knowing or ever wondering the origins (not me though 😌) The First Computer Bug: The term "bug" in the context of computer programming originated in 1947 when computer scientist Grace Hopper found an actual moth causing a malfunction in the Harvard Mark II computer. She taped the moth into the computer's logbook with the annotation "First actual case of bug being found. #ComputerHistory #ProgrammingTrivia #TechOrigins #GraceHopper #BugFixing #TechHistory #ComputerScience #ProgrammingAnecdote #HistoricalTech #GraceHopperLegacy #SoftwareBug #InnovationHistory #HarvardMarkII #TechPioneers #ProgrammingHumor

Day 38: Expanding the Tapestry of Mastery with Subsequences! 🌟 On this illustrious 38th day of my odyssey through algorithmic realms, I venture further into the intricate tapestry of string manipulation, emboldened by newfound insights and fortified by past conquests. With every character appended to the strings, I weave intricate subsequence patterns, enriching the fabric of my code with depth and complexity. As I traverse this labyrinth of challenges, I embrace the artistry of crafting elegant solutions, each line of code a testament to my unwavering dedication to algorithmic excellence. #AlgorithmicMastery #Subsequences #CodingOdyssey 🌿🚀💡

Hello Folks, 4/4 problems solved in today's contest in 34 minutes 👨💻 with a WA on 3rd problem which eventually costed me on leaderboard 😓. Here I am sharing quick editorials for all the problems: Problem A => Just find maximum in every column in first traversal, and then in second traversal just assign the values accordingly by checking if mat[i][j] equals -1 or not. Problem C => Just store the frequency of every character in a frequency array. Now sort the word vector according to word's lengths. Now iterate through every word length and check greedily whether it's possible to make that length's palindrome from frequency array or not. Problem B and D => First convert given nums vector into {1,0,-1} format with the help of conditions mentioned in problem. Now Problem reduces down to standard pattern-matching algorithms, I used Z-function to solve it. You can read more about Z-function from CP-algorithms website also. This journey has been both challenging and rewarding, pushing me to constantly learn, adapt, and improve my problem-solving skills. I'm excited to continue honing my craft and tackling even more complex problems ahead. Still a long way to go ahead further.💪 #LeetCode #CodingJourney #ProblemSolving #AchievementUnlocked #CodingCommunity #NeverStopLearning

Hey guys, Today I faced a fascinating challenge: sorting an array in ascending order and ensuring no numbers were repeated. After some serious brainstorming and coding, I'm thrilled to announce that I've cracked it! 🚀 This problem required me to apply the skills I've been learning in class, like understanding arrays and sorting algorithms. It was a bit of a brain workout, but the feeling of success at the end made it all worthwhile! 💪 Here's a simplified rundown of what I did: Sorted the array so the numbers went from smallest to largest. Removed any duplicate numbers to clean up the list.

Are you on any interesting deep dives? So many days of X? An associate on LinkedIn would announce so many days of a topic, then prodigiously deep dive while sharing his exploits and becoming expert. He inspires me. As technologists CONTINUOUS AGGRESSIVE LEARNING isn’t an option, but duty. My latest dive is in Clean Craftsmanship (code) from the Robert C. Martin series of books. What’s your latest deep dive?