GVM Technologies’ Post

Hi Devs, I want to become a good developer, I believe that by joining the #100DaysofCode challenge will help me in the long run. I would also like to ask for assistance and guidance from those with experience. #100daysofcode #devcommunity #codenewbie

"Just completed my 100th question on LeetCode! 🎉 Proud of this milestone and grateful for the consistency and dedication it took to get here. Excited to keep pushing my limits and continue this journey. Onwards to the next challenge! 💪 #CodingJourney #LeetCode #ProblemSolving #Consistency #100Questions"

🎉 Completed my first 100 problems on LeetCode! 🚀 While it might not seem like a huge milestone, it marks a significant step toward my goals. Over the last month, I've dedicated time to problem-solving to sharpen my skills. Although my true passion lies in development, I’ve realized the importance of strong problem-solving abilities in becoming a well-rounded developer. I’m excited to continue this journey and see where it leads! 💻🔥 #LeetCode #ProblemSolving #FirstStep #DeveloperJourney #ContinuousLearning

🚀 Day 2of #100DaysOfCode! 🚀 💻 Problem 2 : Check if Array is Sorted and Rotated... Let's code! 💻 Solution: We will first initialize an variable 'count' to count the no of pairs which satisfies (nums[i-1]>nums[i]) condition and return true if the count is less than or equal to 1. Feel free to follow along, offer suggestions, or join me in this challenge. Let’s inspire each other and make great strides together! 😊 #CodeNewbie #CodingChallenge #LearningJourney #DeveloperLife #TechCommunity #100DaysOfCode

🚀 Day 24 of #100DaysOfCode!🚀 Tackled LeetCode problem "Number Complement" today. 🧩 It's amazing to see how breaking down problems into smaller parts can lead to elegant solutions. Onward and upward! 💪 #CodingJourney #LeetCode #ProblemSolving

🚀 Day 26 of my LeetCode streak! 🚀 Today, I tackled some intriguing stack-related questions. Excited to continue pushing my boundaries and solving new challenges! #LeetCode #CodingJourney #100DaysOfCode #ProblemSolving #Consistency #Stack

"🎉 Exciting News! 🚀 I'm thrilled to share that I've recently completed a remarkable 100-day streak on LeetCode, honing my problem-solving skills and expanding my technical repertoire. 💡💻 , my hard-earned badge! 🏅 Let's keep pushing boundaries and embracing challenges together. #LeetCode #ProblemSolving #TechnicalSkills #CodingJourney"

Codeforces Debut: A Thrilling Ascent in Div. 4, Contest #937 I'm excited to recount my exhilarating journey through my first ever Codeforces contest, Div. 4, Contest #937! Problem A (Stair, Peak, or Neither?): simple implementation based problem.do as said. Problem B (Upscaling): a pattern based problem. I used two strings based approach to get the desired pattern. Problem C (Clock Conversion): simple implementation based problem easier than B. a do as said kind of problem . Problem D (Product of Binary Decimals):It was among the problems which could not solve during the contest but after the contest I came up with a solution (mentioned below) 1.Binary Checking Function: A function was created to verify if a number was strictly composed of 0s and 1s (binary format). if found yes then simply returned yes and went for next iteration if not then ..went for other checks 2.Precomputed Results: The solution leveraged precomputed results for specific binary combinations (e.g., 101x101, 111x101, 101x111). A match indicated a "YES" answer and halted further processing. 3.Iterative Division: When no precomputed matches were found, the number was iteratively divided by 10 and 11 until the remainder became non 0.   4.Binary Re-check:After the division, was done again checked if the number was in binary form or not. 5. Final Result: If the number passed all checks and was of binary form, it was marked "YES." Otherwise, it was marked "NO." It was an amazing experience .I got a rating of 391 from being unrated . #Codeforces #ContestExperience #NewbieJourney #ProblemSolving #CodingCommunity TLE Eliminators

Greetings, connections💓! I participated in CodeForces (Div. 2) Contest. I was able to solve Three Problems only. I found problem statements quite hard to understand, anyway Lets discuss the Solutions. 𝐏𝐫𝐨𝐛𝐥𝐞𝐦 𝐀 To divide all numbers into two different arrays following the pattern (max, min, second max, second min, etc.), first, sort the input array in ascending order. Then, alternate elements between the two arrays: add the largest remaining element to the first array and the smallest remaining element to the second array, and continue this process until all elements are distributed. Finally, calculate the sum of the absolute differences between corresponding elements of the two arrays. 𝐒𝐨𝐥𝐮𝐭𝐢𝐨𝐧 -> https://lnkd.in/g6yznBci 𝐏𝐫𝐨𝐛𝐥𝐞𝐦 𝐁 To minimize the oneness of a binary string, we defined the counts of subsequences with only zeroes and those with at least one one. By choosing a string with all zeroes except for one one at the end, we balanced these counts effectively. This configuration ensures the smallest possible oneness. Thus, the optimal string consists of all zeroes followed by a single one. 𝐒𝐨𝐥𝐮𝐭𝐢𝐨𝐧 -> https://lnkd.in/ghAFkQai 𝐏𝐫𝐨𝐛𝐥𝐞𝐦 𝐂 To determine if Alice can win, we check the positions of "1"s in the binary string. If a "1" is at the beginning, end, or adjacent to another "1," it indicates that Alice can secure a true outcome. This is because these configurations allow Alice to influence the final evaluation in her favor. If none of these conditions are met, Bob can manipulate the operators to ensure the result is false. 𝐒𝐨𝐥𝐮𝐭𝐢𝐨𝐧 -> https://lnkd.in/gVsRgmQz Will try to do better next time. Overall a great contest Indeed. This is all from my side 🤝 Follow : Mohit Budhlakoti #leetcode #weeklycontest #problemoftheday #contest #rank #biweeklycontest #codeforces #div2 #coding

Something very special to me happened lately, and I want to share it with you. I’ve just hit Expert rank on CodeForces It’s been an incredible journey of challenges, growth, and a lot of late nights solving problems for the pure joy of it. What started as a hobby has become a true passion. Each round, each problem, and each new topic has pushed me further than I ever expected. Excited for what’s next on this journey! #Codeforces #ExpertRank #ProblemSolving #CompetitiveProgramming