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.

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

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 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.

I am happy to share that my first #hacktoberfest pr got accepted in #hacktoberfest2023 So happy right now because I was really afraid to start in the beginning and I successfully overcame that fear of my pr not being accepted. Thanks everyone for spectating my journey. #coding #codingcommunity #depths #hacktoberfest #opensource #pullrequest #merged #treeplant #dsa #programming #cpp #java #python #ruby #react #javascript

Hello Everyone, I participated in 𝐋𝐞𝐞𝐭𝐂𝐨𝐝𝐞 𝐁𝐢𝐰𝐞𝐞𝐤𝐥𝐲 𝐂𝐨𝐧𝐭𝐞𝐬𝐭 𝟭𝟮𝟳 and successfully solved 𝟯/𝟰 𝐩𝐫𝐨𝐛𝐥𝐞𝐦𝐬, securing a 𝐠𝐥𝐨𝐛𝐚𝐥 𝐫𝐚𝐧𝐤 𝐨𝐟 𝟯𝟵𝟲/𝟮𝟳𝟬𝟬𝟵 participants. This is my first time achieving a rank under 500! 😊 𝗣𝗿𝗼𝗯𝗹𝗲𝗺 𝟭: Check the subarray when you get a Subarray OR greater than or equal to 'k'. Calculate the length and keep the minimum length as the final answer. 𝗣𝗿𝗼𝗯𝗹𝗲𝗺 𝟮: - Define pointsD[i] as the gain points of Danielchandg from index 0 to i - and pointsB[i] as the gain points of Bob from index i+1 to n-1.  - Traverse the pointsD array and find where pointsD[i] is greater than pointsB[i+1], then return the level accordingly. 𝗣𝗿𝗼𝗯𝗹𝗲𝗺 𝟯: - Visualize numbers in binary.  - Pre-calculate the set bits (ones) until index 'i' and bit number 'bitNo' as prefBits[i][bitNo]. -Check if a length 'm' is possible such that the OR of all elements is greater than or equal to 'k'. Use a sliding window approach for this.  - Also, consider binary search for lengths from 1 to n. 𝗣𝗿𝗼𝗯𝗹𝗲𝗺 𝟰: Encountered TLE. Will try to solve it again later. I'm excited about these challenges and looking forward to more contests! #leetcode #CodingContest #ProgrammingSkills #Algorithm #CodingJourney

Day 17 of #100DaysOfCode: 🚀Successfully tackled the Aggressive Cows problem on Coding Ninjas! 🐮 Providing you with a snippet of the code; DM me for the full version. Tomorrow, diving into sorting algorithms! Stay tuned for more updates and coding adventures! 💻🚀 #codingprogress #day17 Snippet of the code:

Let's talk about  LeetCode Biweekly Contest 114 and Weekly Contest 364. Biweekly Contest 114 Question 1: We can just take the simple set, and check that if the length of the set becomes k, then return n-i. Submission: https://lnkd.in/g472NF-S Question 2: For this, I might overthink, but I first found out that if freq is 1 then return -1, else if we got odd then we can remove 3, for values like 10 and, 4 we can first remove 4, then freq/3. Submission: https://lnkd.in/gaVmvFam Question 3: It is kind of easy, just do cnt++ when you got And as totalAnd. Submission: https://lnkd.in/gxwkqxQV Question 4: For this, we can calculate the child's sums, and when we get a child's values as divisible by k, we can do cnt+=1, and return 0 from there. Submission: https://lnkd.in/gGafVTW7 Weekly Contest 365 Question 1 - For this, We can use prefixMax and suffixMax, and then iterate through the loop and get the maximum result. Submission Code - https://lnkd.in/gp6FGh9Q Question 2 - It is the same as Question 1. Submission Code - https://lnkd.in/gp6FGh9Q Question 3 - It is somewhat of a sliding window question, we can get the target/sum as our ans, and then we will find the window of the sum as a target. Submission Code - https://lnkd.in/g-cWu9My Question 4 - We can use topo sort to get the nodes, that are not a part of the cycle, then we can simply use DFS to get the length of the nodes, that are part of a cycle, and then we can get the total path for the non-cyclic nodes. Submission Code - https://lnkd.in/gRizTehc Connect 🤝 : Prateek Goel #leetcode #contest #globralRank #weekly #gfg #rank #linkedIn #learning #biweekly #ranks #coding