Getting My Streak Back | Coding Everyday (Day 18)

🚀 Day 18 of my coding-every-day challenge is here! I'm on a mission to hit 1,000 subscribers, and today was packed with fun and challenging projects.

I'm back on the grind!

In this video, I walk you through my solutions for:

"Number of Ways to Arrive at Destination" (Hard): I explain how I used Dijkstra's Algorithm to find the shortest path in a graph and count the number of ways to reach the destination in the minimum time. We'll cover the priority queue implementation and how to handle the modulo operation for large numbers. This is a great problem for understanding graph algorithms and dynamic programming concepts.

"Count Days Without Meetings" (Medium): I break down a clever approach to solving this meeting scheduling problem. We'll sort the meetings, track the latest meeting end time, and efficiently calculate the free days. This problem is a good test of your ability to work with intervals and optimize for time complexity.

I'll show you the Python code, explain my thought process step-by-step, and discuss the time complexity of each solution. Whether you're a beginner learning data structures and algorithms or a seasoned coder preparing for interviews, there's something here for you!

Chapters:
0:00 Intro
0:03 Leetcode

Leetcode Daily:    / @leetcodedaily-ama  
Everyday Freelancer:    / @everydayfreelancer  

Hire Me on Fiverr: https://www.fiverr.com/amamazing
Support my work: https://www.buymeaboba.com/
GitHub: https://github.com/AMAMazing
LeetCode: https://leetcode.com/u/AMAMazing/

👍 Like and Subscribe for daily coding challenges!

#LeetCode #Python #CodingChallenge #DailyCoding #CodingEveryday