West Region Delivery Team’s Post

🚀 Day 3 of #100DaysOfCode: Enchanted Forest Adventure Game 🌲🎮 Today, I created a text-based adventure game in Python. In this game, players navigate through a mystical forest, making choices at each step to find the hidden treasure. It's a fun way to practice decision-making and control flow in Python! Check out the screen recording of the game in action: https://lnkd.in/egWP-fp9 Fork the code and try it yourself: https://lnkd.in/e6XXZBCa #Python #Coding #DataEngineering #100DaysOfCode #PythonProjects

🚀 90-Day Algorithm Challenge! 🚀 #day12 Excited to announce that I'm starting a 90-day algorithm challenge! Each day, I'll be solving a HackerRank algorithm problem to enhance my problem-solving skills and deepen my understanding of algorithms. 📚 Challenge Details: Duration: 90 days Platform: HackerRank Goal: Sharpen algorithmic thinking and coding skills. 🚨 How to Participate: Follow: Follow me to join the journey! Engage: Like, comment, or share to encourage and connect with fellow learners. Challenge: Feel free to join me! Share your progress, insights, or favorite algorithms using hashtag #90DayAlgorithmChallenge. 📆 Day 12 : https://lnkd.in/dyGBAFXz Description : Given an array of bird sightings where every element represents a bird type id, determine the id of the most frequently sighted type. If more than 1 type has been spotted that maximum amount, return the smallest of their ids. Solution in *JavaScript* Looking forward to the exciting learning journey ahead! Let's tackle these algorithms together! 💻🔥 #90DayChallenge #Algorithms #Coding #Programming #ChallengeAccepted

Dart mixins empower you to add reusable abilities to classes without complex inheritance. Think of it as giving animals unique skills—like making ducks swim and fly—by simply 'mixing' in behaviors. 🦆✨ #Dart #Flutter #CodingTips

✅ #Day28 of #100DaysOfCodingChallenge on #LeetCode Solved: #leetcode 1992. Find All Groups of Farmland Difficulty: Medium Topic: Array, DFS, Matrix 💡Approach:  - An 'ArrayList' is created to store the coordinates of the farmlands.  - 'n' and 'm' store the number of rows and columns of the 'land' 2D array.  - An array 'arr' of size 4 is created to store the coordinates of the farmland. 1. Nested Loops to Traverse the 2D Array 2. Check for Farmland (land[i][j] == 1) 3. find the right and bottom edges of the farmland and marks those cells as '2'. 4. Store Bottom-Right Coordinates in Array. 5. Add Farmland Coordinates to ArrayList. 6. Convert ArrayList to 2D Array and Return. https://lnkd.in/dN5-Re5J #Consistency #100DaysOfCode #ProblemSolving #LearnInPublic

✅ #Day30 of #100DaysOfCodingChallenge on #LeetCode Solved: #leetcode 1992. Find All Groups of Farmland Difficulty: Medium Topic: Array, DFS, Matrix 💡Approach:  - An 'ArrayList' is created to store the coordinates of the farmlands.  - 'n' and 'm' store the number of rows and columns of the 'land' 2D array.  - An array 'arr' of size 4 is created to store the coordinates of the farmland. 1. Nested Loops to Traverse the 2D Array 2. Check for Farmland (land[i][j] == 1) 3. find the right and bottom edges of the farmland and marks those cells as '2'. 4. Store Bottom-Right Coordinates in Array. 5. Add Farmland Coordinates to ArrayList. 6. Convert ArrayList to 2D Array and Return. https://lnkd.in/dVdFMv6A #Consistency #100DaysOfCode #ProblemSolving #LearnInPublic

Today, I tackled Problem No. 185: Minimum Fountains in my DSA challenge. 🌿 Problem Overview:   The task was to determine the minimum number of fountains needed to cover a one-dimensional garden of length 'N'. Each fountain can water a certain range defined by an array that specifies how far each fountain can reach. Approach:   To solve this problem, I followed these steps:   1. **Coverage Calculation**: For each fountain at position 'i', I calculated the range it can cover using the formula:     - Start of coverage = max(0, i - ARR[i])     - End of coverage = min(N, i + ARR[i])   2. **Greedy Selection**: I employed a greedy approach to activate the minimum number of fountains. I iterated through the garden, always selecting the fountain that extends the coverage as far as possible. 3. **Result Compilation**: The total count of fountains activated was maintained and printed for each test case. Key Takeaways:   1. A greedy strategy is effective in minimizing the number of fountains needed while ensuring complete coverage of the garden.   2. This problem reinforces the importance of understanding range-based coverage and its application in real-world scenarios, such as optimizing resources. Personal Reflection:   Working through this problem enhanced my problem-solving skills and understanding of greedy algorithms. I'm excited to apply these concepts in future challenges! #DataStructures #Algorithms #GreedyAlgorithm #Coverage #DSAChallenge

Just tackled another exciting coding challenge! 🐦 Successfully determined the most frequently sighted bird type from a list of sightings, ensuring to pick the smallest ID in case of a tie. It’s always rewarding to dive deep into algorithms and come out with clean, efficient solutions. Ready for the next challenge! 💻🚀 HackerRank #codingjourney #softwaredevelopment . . . . . . . . . #Coding #Algorithm #Programming #ProblemSolving #Python #TechInnovation #DeveloperLife #WomenInTech #DataStructures #TechSkills #AI #MachineLearning #BigData #DataScience #CloudComputing #Blockchain #Cybersecurity #FullStackDeveloper #TechTrends #Innovate #DigitalTransformation #PythonProgramming #JavaScript #SoftwareEngineer #STEM #TechLeaders #WomenWhoCode #CodeChallenge #TechCareer #FutureOfWork

✨ LeetCode Daily Challenge: 1671. Minimum Removals to Make a Mountain Array 🎯 I just completed a LeetCode Daily Challenge and created a step-by-step animated video explaining the problem and solution using Manim! 📊✨ In this video, I cover: ✅ The problem: Minimum Removals to Make a Mountain Array ✅ How to use Dynamic Programming (LIS and LDS arrays) ✅ The logic behind removing elements to form a valid mountain array 🔗 Watch the video on YouTube: ▶️ https://lnkd.in/eSzXeysm 📂 Check out the full solution on GitHub: 🔗 https://lnkd.in/eypPy-2b #LeetCode #DynamicProgramming #Python #Manim #CodingChallenge #DailyChallenge #Visualization #YouTube #GitHub #ProblemSolving #LinkedInLearning

Excited to see our Plotly Dashboard featured on the official Plotly page! 🚀 Big thanks to my awesome friends Mahmoud Salah, Manar Ramadan, Lina Nour, and Mohamed Elsayed for their invaluable contributions to our Plotly Dashboard! 🙌 Special shoutout to Adam Schroeder, Plotly's community manager, for the continuous support! Couldn't have done it without you all! Check it out and explore the data visualization magic ✨ #Plotly #Gratitude #Dash🚀

Run RAG Locally with llama.cpp 🚀 Here is a short tutorial about running basic RAG locally using llama.cpp by Mark Hneedham. 🎯 The llama.cpp started as a project to support inference of Meta's LLaMA model with pure C/C++. The project currently supports the core LLMs such as LLAMA 2/3, Mistral 7B, BERT, etc. 📽️: https://lnkd.in/g-QUxPnh ⭐️ 𝑱𝒐𝒊𝒏 𝒎𝒚 𝑫𝒂𝒕𝒂 𝑺𝒄𝒊𝒆𝒏𝒄𝒆 𝑪𝒉𝒂𝒏𝒏𝒆𝒍 👉🏼 https://lnkd.in/g_GdP-pf #llm #rag #datascience #python