Blank’s Post

On 26 October 2024, IEEEXtreme 18.0 begins at 00:00:00 UTC and ends at 23:59 UTC! Get set to code, unleash your creativity, and dive into an exhilarating 24-hour global coding challenge! The anticipation is mounting as we gear up to unveil all enigmas. Time to embark on another journey through the realms of algorithms and logic. 🚀 May your logic be as sharp as your ambition! 🌟 hashtag #IEEE hashtag #IEEEXtreme18.0 hashtag #CodingExcellence hashtag #CodingChallenge hashtag #IEEEXtreme hashtag #Code24Xtremexp hashtag #2Code4Xtreme

On 26 October 2024, IEEEXtreme 18.0 begins at 00:00:00 UTC and ends at 23:59 UTC! Get set to code, unleash your creativity, and dive into an exhilarating 24-hour global coding challenge! The anticipation is mounting as we gear up to unveil all enigmas. Time to embark on another journey through the realms of algorithms and logic. 🚀 May your logic be as sharp as your ambition! 🌟 #IEEE #IEEEXtreme18.0 #CodingExcellence #CodingChallenge #IEEEXtreme #Code24Xtremexp #2Code4Xtreme

👀 Coding Fun Fact! An empty script is a valid file in many languages—it runs perfectly, does absolutely nothing, and exits with a success code!  Sometimes, silence truly speaks volumes in code. 💻✨ #TechTrivia #ProgrammingFacts #CodeLife

🚀 Day 54 of #100DaysOfCode Challenge 🚀 Today was all about string manipulation and conversions! 🧵💻 1️⃣ String to Integer (atoi): Solved this problem efficiently, converting strings to integers like a pro! 🚀 2️⃣ Integer to Roman: Mastered the art of converting integers to Roman numerals flawlessly! 🏛️➡️📜 Keep coding, keep conquering! 💪 #CodeLife #ProgrammingJourney #CodeChallenge

I’m thrilled to share my latest coding accomplishment 💻✨! I’ve successfully tackled another challenging problem on LeetCode: Problem #551- Student Attendance Record I. In this problem, The code uses straightforward iterative approach to solve the problem. It involves iterating through the given string s and maintaining counters for two conditions: The number of 'A's (absent days) in the string. The maximum number of consecutive 'L's (late days) in the string. Time Complexity: O(n) Space Complexity: O(1)

Hello LinkedIn fam!!, this post is about my day-10/100 days of coding challenge and today I had solved the following problems- Problem 01-https://lnkd.in/dCijtaZE Solution-https://lnkd.in/dN_SjWk6 Description-We are given a linked list, we have to reverse the nodes of the list k at a time, and return the modified list. Intuition- I solve it using stack , because the task of reverse can easily be executed with the help of stack. I'll start iterating over my linkedlist and append each element to the stack but as the size of the stack reaches to k we will pop elements one by one and store it in a new linkedlist and at last, we return that linkedlist. Problem 02-https://lnkd.in/dfxSKqze Solution- https://lnkd.in/dcnjbgHY Description- Two people are playing a game with a string s 𝑠, consisting of lowercase latin letters. On a player's turn, he should choose two consecutive equal letters in the string and delete them. If first player wins output "No" else "Yes" Intuition- I'll start pushing the list elements into the stack and whenever the ith element becomes equals to the top of the stack, then I simply remove/pop it. I also maintain a variable called count, in which whenever simply ith element becomes equals to the top of the stack.And at last if the count is even we can say , player one loose ("No") and player 2 win ("Yes"). #100dayscoding,#coding,#challenge,#consistency,#discipline,#dsa,#cp

Check out my latest video where I walk through the structure and organization of my project’s source code, highlighting key files and folders for efficient coding! #coding #softwaredevelopment #tech #mern #react

Hello LinkedIn fam!!, this post is about my day-09/100 days of coding challenge and today I had solved a interesting problem known as valid-parentheses. Problem-https://lnkd.in/d8aad-nr Solution-https:https://lnkd.in/dcRZbWKA Description- In this problem we are given a sequence of brackets and we have to decide whether it is valid or not. Valid Conditions- 1. Open brackets must be closed by the same type of brackets. 2. Open brackets must be closed in the correct order. 3. Every close bracket has a corresponding open bracket of the same type. Intuition- We solve it through the stack, first of all we iterate over the string and if its character is an open bracket then we push it into our stack, if it's a closed bracket we check if the top element of the stack is an open bracket of the same type, if yes we simply delete the top element (that is the open bracket of same type), else we simply push it into the stack. And after iterating over the complete string, our stack remain empty then we return True else False. #100dayscodingchallenge,#coding,#cp,#dsa,#leetcode,#datastructure,#stack,#linkedlist,#implementation,#discipline,#consistency

I’m thrilled to share my latest coding accomplishment 💻✨! I’ve successfully tackled another challenging problem on LeetCode: Problem #389 - Find the Difference. In this problem, The approach used in this problem leverages the properties of the ASCII values of characters. The ASCII values of characters can be summed, and the difference between two sums will give the ASCII value of the missing or extra character. This is because the sum of all common characters will cancel out, leaving only the value of the extra character. Time Complexity: O(n) Space Complexity: O(1)

✨ Remember back in school when teachers would say, "Your handwriting is terrible! Use a lined notebook and a ruler, and write neatly!" ✏️📏 Fast forward to today, and now it's the compiler saying, "Your code is a mess! Use SOLID principles, design patterns, and coding standards!" 💻📐 Funny how some things never change—just upgraded from rulers and lined paper to clean code principles and best practices. 💡🔧 #Progress #CodingLife #TechThrowback #CleanCode