Gopal Sharma’s Post

🚀 Day 27 of #100DaysLeetCode 🚀 Today, I tackled the Longest Happy String problem using Python! 🐍 🔍 Problem Overview: A string is called happy if it doesn't contain "aaa", "bbb", or "ccc" as substrings and contains at most the given counts of 'a', 'b', and 'c'. The goal is to construct the longest possible happy string with the given counts of these characters. 🛠 My Solution: • I used a max heap to store the counts of 'a', 'b', and 'c'. • I added the most frequent character to the result unless it violated the "no three consecutive same characters" rule. • If necessary, I inserted a different character from the heap to ensure a valid string. 💻 Key Stats: Runtime: 34 ms (Beats 69.04%) Memory: 16.56 MB (Beats 68.60%) 🔗 Check out my LeetCode profile for more solutions: leetcode.com/u/gopalgpt 📈 This problem helped improve my skills in greedy algorithms and heap data structures! 💡 #LeetCode #Python #100DaysOfCode #DSA #CodingJourney #CodingChallenge #GrowthMindset #GopalSharma

🚀 Day 35 of #100DaysLeetCode 🚀 Today, I solved the Flip Equivalent Binary Trees problem using Python! 🐍 🔍 Problem Overview: For a binary tree T, we can define a flip operation where we choose any node and swap its left and right child subtrees. Two binary trees are flip equivalent if and only if we can make one tree equal to the other after some number of flip operations. The task is to return True if the two trees are flip equivalent, otherwise return False. 🛠 My Solution: • I implemented a recursive approach to check if two trees are flip equivalent. • The function checks two cases for each node: 1. No flip: Compare the left and right subtrees as they are. 2. Flip: Compare the left subtree of one tree with the right subtree of the other, and vice versa. • If both cases return False, the trees are not flip equivalent. 💻 Key Stats: • Runtime: 0 ms (Beats 100%) • Memory: 16.54 MB (Beats 57.29%) 🔗 Check out my LeetCode profile for more solutions: leetcode.com/u/gopalgpt 📈 This problem was a great exercise in recursive tree traversal and handling binary tree equivalence! 🌳 #LeetCode #Python #100DaysOfCode #DSA #CodingJourney #CodingChallenge #GrowthMindset #GopalSharma

🚀 Day 32 of #100DaysLeetCode 🚀 Today, I solved the Split a String Into the Max Number of Unique Substrings problem using Python! 🐍 🔍 Problem Overview: Given a string s, the task is to split it into the maximum number of unique substrings. You must split the string into non-empty substrings such that all the substrings are unique. 🛠 My Solution: • I used a backtracking approach to explore different ways of splitting the string. • A set was used to keep track of unique substrings. By recursively checking various split points, I maximized the number of unique substrings. • This approach efficiently handles all input cases, ensuring the optimal solution is found. 💻 Key Stats: • Runtime: 154 ms (Beats 91.48%) • Memory: 16.46 MB (Beats 85.20%) 🔗 Check out my LeetCode profile for more solutions: leetcode.com/u/gopalgpt 📈 This problem boosted my understanding of backtracking and how to efficiently handle string manipulations! 💡 #LeetCode #Python #100DaysOfCode #DSA #CodingJourney #CodingChallenge #GrowthMindset #GopalSharma

🚀 Just ran a quick test to check my internet speed using Python! 🐍 With the help of the speedtest-cli library, I was able to measure both download and upload speeds, along with ping. This script is super handy for anyone looking to monitor their internet connection directly from their Python environment. 📊 Here's a snapshot of the code and the results: #pip install speedtest-cli import speedtest as st def Speed_Test():   test = st.Speedtest()   down_speed = test.download()   down_speed = round(down_speed / 10**6, 2)   print("Download Speed in Mbps: ", down_speed)   up_speed = test.upload()   up_speed = round(up_speed / 10**6, 2)   print("Upload Speed in Mbps: ", up_speed)   ping = test.results.ping   print("Ping: ", ping) Speed_Test() This is just one of the many ways Python makes tasks like these quick and simple. 😎 #Python #Coding #InternetSpeed #Automation #speedtestcli

🚀code challenge in Python with loop! 🎉 Today, I wrote a simple program to check if a word or number is a palindrome—something that reads the same forward and backward Breakdown: 1.The program runs a loop twice (range(1, 3)) to allow me to check two values. 2.The user enters a value (a) through the input() function. 3.I reverse the entered value using Python slicing (a[::-1]) and store it in b. 4.The program checks if the original value (a) is the same as the reversed value (b). 5.If they match, it prints "Palindrome," otherwise it prints "Not a palindrome." Simple, but fun! 😄 #python #LPU #LovelyProfessionalUniversity #CodingChallenge

Day 80 of #100daysofchallenge Todays Topic was Reverse String. Master the Art of String Reversal: A Python Solution for LeetCode Are you conquering LeetCode challenges and looking to tackle string manipulation problems? Look no further! This post dives into the classic "Reverse String" problem and presents a clean, efficient Python solution using a two-pointer approach. Problem Statement: Given a string s, write a function to reverse the characters in place (without creating a new string). Approach: This solution utilizes a two-pointer technique to swap elements from the beginning and end of the string iteratively. We leverage the fact that only half of the string needs to be swapped to achieve the reversed order. Explanation: - We define a reverseString function that takes a list of characters (s) as input. - We calculate the length of the string (n) and use it for the loop condition. - The loop iterates up to half of the string length (n // 2). This ensures we swap corresponding elements from both sides. - Within the loop, we perform a swap using destructuring assignment. This efficiently switches the characters at indices i and n-1-i. Key Points: - This solution modifies the original string in-place, saving memory compared to creating a new string. - The time complexity is O(n), as we iterate through half of the string elements. - The space complexity is O(1), as we only use constant extra space for variables. #leetcode #bytexl #paruluniversity sai mahidar

#Day75Challenge 🚀 🤖 Python code to execute the problem of stop watch 🕰 This code does the following: 👉It imports the time module, which provides functions to work with time. The stopwatch function: 1.Waits for the user to press Enter to start the stopwatch. 2.Records the start time when Enter is pressed. 3.Prompts the user to press Enter again to stop the stopwatch. 4.Records the end time when Enter is pressed again. 5.Calculates the elapsed time by subtracting the start time from the end time. 6.Prints the elapsed time. 7.When you run this script, it will start the stopwatch when you press Enter, and it will stop and display the elapsed time when you press Enter again. #pythoncode #stopwatch #algorithm

🚀 Day 12 of #100DaysLeetCode 🚀 Today, I worked on the Check If Array Pairs Are Divisible by k problem using Python! 🐍 Here's what I tackled: 🔍 Problem Overview: The task was to divide an array of integers arr (with even length n) into exactly n / 2 pairs such that the sum of each pair is divisible by k. The challenge was to return true if this division is possible, otherwise false. 🛠 My Solution: I implemented a remainder counting approach: • Counted the remainder of each element when divided by k. • Ensured that elements divisible by k had an even count to form pairs. • For the other remainders, I matched remainder i with k - i to form valid pairs that sum to a multiple of k. 💻 Key Stats: Runtime: 453 ms (Beats 96.08%) Memory Usage: 30.31 MB (Beats 73.50%) 🔗 Check out my LeetCode profile for more solutions: leetcode.com/u/gopalgpt 📈 This problem was a great exercise in using mathematical properties to optimize pair checks efficiently! 💡 #LeetCode #Python #100DaysOfCode #DSA #DataStructures #CodingJourney #CodingChallenge #GrowthMindset #GopalSharma

🚀 Day 4 of #100DaysLeetCode 🚀 Today, I tackled a String Segmentation problem using Python! 🐍 Here’s what I worked on: 🔍 Problem Overview: You are given a 0-indexed string s and a dictionary of words. The task is to break s into one or more non-overlapping substrings such that each substring is present in the dictionary. However, some extra characters in s may not be part of any substring. 🛠 My Solution: I used Dynamic Programming (DP) to track valid substrings. The DP array keeps track of the minimum number of unrecognized characters while splitting s into valid words. I iterated through the string and checked if each substring exists in the dictionary, updating the DP array accordingly. 💻 Key Stats: Runtime: 174 ms (Beats 88.79%) Memory Usage: 16.62 MB (Beats 63.57%) 🔗 Check out my LeetCode profile for more solutions: leetcode.com/u/gopalgpt 📈 This problem was a good exercise in DP and string manipulation, helping me sharpen my problem-solving skills! Keep pushing forward! 💡 #LeetCode #Python #DSA #DynamicProgramming #100DaysOfCode #CodingJourney #CodingChallenge #GrowthMindset #GopalSharma

Today, I’m diving into Python functions, a crucial aspect of writing efficient and reusable code. There are four main types of functions in Python that every programmer should understand: Built-in Functions: These come with Python and are ready to use, like print(), len(), and input(). print("Hello, World!") User-defined Functions: Created by you to perform specific tasks, making your code modular and easier to manage. def greet(name): return f"Hello, {name}!" Anonymous Functions (Lambda Functions): These are small, one-liner functions that don’t require a name. Often used for quick operations. square = lambda x: x * x Recursive Functions: A function that calls itself, useful for solving problems like calculating factorials or implementing algorithms. def factorial(n): if n == 1: return 1 else: return n * factorial(n-1) Why Functions Matter: Functions help make your code organized, avoid repetition, and are essential for large projects. #Day19 #Python #PythonFunctions #CodeEfficiently #ProgrammingTips #FullStackDevelopment #LambdaFunctions #RecursiveProgramming #ModularCode #LinkedInCreators #TechEducation