Canva’s Post

"Rust requires a lot of practice, which may lead you to lose friends; but hey you will definitely have Rust's compiler as your new friend!" A Blog by: Sandipsinh Rathod https://lnkd.in/duvEnYCY

Hey everyone!! I'm excited to kick off my 50-day LeetCode challenge today with a deep dive into problem-solving! Problem 2/50: Generate Parentheses (Question 22) Approach: By using the backtracking algorithm, I efficiently generated all combinations of well-formed parentheses. This approach involves recursively building the parentheses string, ensuring each step maintains the validity of the string.

🚀 Day 53 Challenge: Symmetric Tree 🚀 Hey there! On the fifty-third day of my coding journey, I tackled the problem "Symmetric Tree" (Problem 101). 💡 Challenge Overview: The task in Problem 101 is to determine whether a binary tree is symmetric. A binary tree is symmetric if the left subtree is a mirror reflection of the right subtree. The challenge here is to efficiently determine whether the given binary tree is symmetric.

Project 7: Ceaser Cipher 🔒 #100daysofpython #Python #Programming #DataScience #MachineLearning #WebDevelopment #PythonProgramming #PythonCommunity #PythonTips #PythonProjects #DataAnalysis #AI #DeepLearning #CodeSnippet #OpenSource #TechInnovation #PythonForBeginners #CodingChallenge #PythonJobs #DeveloperCommunity #TechNews #PythonCode #CodeSnippet #CodingInPython #ProgrammingBeginner #SimpleCode #LearnPython #CodeExample #PythonBeginner #CodingJourney

Day 29th challenge completed!!! Today I learned about the some basics of string. Strings are represented as an array (or sequence) of characters, where each character corresponds to a specific index within the array. This allows for efficient manipulation and retrieval of individual characters within the string.#coder's Corner #29/100days challenge

Hello Everyone 👋 Today is my Day 2️⃣1️⃣ of my #100daysofcodingchallenge👨💻 to learn python zero 0️⃣ to mastery 🏆level In this day I was completed my Snake game🎮 project project link : https://lnkd.in/gmH63MaD following steps to complete this snake 🐍game 🕹project 💻 ✔ Create a game background ✔Create a snake body ✔Move the snake ✔Control the movement snake 📌Detect collision with food 📌Create a score board💰 📌Detect collision with wall 📌Detect collision with own tail 📌Extend tail collision Then using OOPs concepts for clean and understandable code I use "Inheritance" concepts in this game, So I was create two more classes - scoreboard, food ✔Detect collision with food I import "turtle package" as super class 🕷 for food class(sub class)🕸 . Using "turtle🐢 package" I can create a shape of food, food size, color of food and after eat the food it again generate food in random place in game area. Using this random process I was import "random package". Using this random package I set random x axis and random y axis to the food class, those random x and random y those are implemented in "goto(random x, random y)" function and food is change place after snake🐍 eat. ✔Create a score board💰 After snake ate food then show the score of snake ate food count this process was created using a "scoreboard" class. Same as "food" class, I import the "turtle" package to create a scoreboard. Turtle package is a superclass🕷 and scoreboard is a subclass🕸using turtle I created a "scoreboard" class and choose it's color, alignment area, font type and its size also can create using the turtle package's write() function then using goto( ) function score was fixed top of the play screen area when snake eat food then the score was updated. ✔ Detect collision with own tail In the game when snake was collision with wall and also its own tail then this game was over. ✔ Detect collision with wall Initially I was programmed when the snake is hits wall then the game is over. In snake class when the snake head was touch the wall then game was over. It make by the size of game screen was used, In case of the snake head was touch the end of screen(wall) this game was over. I use xcor() and ycor() function with screen height as y and width as x. If snake head exceed the wall then the game was over. If its over I used scoreboard class and apply write() function to make "game over" title to show whem the game completed ✔Extend tail collision After snake was ate food then increase its tail. so I use "snake" class to increase size of tail when the food was ate. so I create a add_segment() and extend() function in snake class. Finally I was done the last things that was detect collision with own tail using "python tuple" method. when the snake head was met with it's own tail then game was over after that the screen was show Game over. ‼ 🏆 link🔗 to play 🕹 my game 👇 game link🔗 : https://lnkd.in/gmH63MaD

🚀 Day 49 Challenge: Create Target Array in the Given Order 🚀 Hey there! On the forty-ninth day of my coding journey, I tackled the problem "Create Target Array in the Given Order" (Problem 1389). 💡 Challenge Overview: The task in Problem 1389 is to create a target array given an array of integers and an array of indices. The target array is constructed by inserting the elements of the input array at the specified indices. The challenge here is to efficiently create the target array according to the given order of indices.

Day 1 of #100DaysOfCode 💻✨ I’m excited to kick off my coding journey by tackling some intriguing problems on Codeforces: -Solved a problem on GCD and LCM using the Euclidean algorithm. -Tackled another challenge to compute the sum of numbers divisible by X in a specified range. Additionally, I’ve started MIT's 6.006 Introduction to Algorithms, Spring 2020 course, aiming to sharpen my problem-solving skills and deepen my understanding of algorithms. Check out the formula I used for the divisibility problem! 👇

Kicking off this summer by solving 50 Leetcode problems (15 easy, 30 medium, and 5 hard problems) in one month. It's good to be back after a busy last semester! Could definitely use a bigger ratio of hard problems, but I'm happy with this little milestone as a warmup for the rest of the summer. I had a lot of fun coming up with solutions, trying to optimize them, and most importantly, developing more intuition about using the right approaches for each problem. It's really important to know how to look at each problem from different angles, reach one or more correct solutions, and then recognize the most efficient solution. This is a reminder that the biggest contest you have is no one but yourself. As long as you're trying to be better than yesterday, then you're on the right path 😊.

🌟 Day 20 of #100DaysOfCode Challenge 🚀 ✔ Total problems solved :1 ✅1539. Kth Missing Positive Number 🔗problem link : https://lnkd.in/g8CiyHdq #CodeProgress #LearningToCode  #ProgrammingAdventure #100daysofcodingchallenge  #consistency #dsachallenge