Codeiez’s Post

The beauty of code lies in finding order within chaos. Day 18 of #100DaysOfCode brought clarity with median calculations of sorted arrays in C++. 𝐐𝐮𝐞𝐬𝐭𝐢𝐨𝐧: 𝐌𝐞𝐝𝐢𝐚𝐧 𝐎𝐟 𝐓𝐰𝐨 𝐒𝐨𝐫𝐭𝐞𝐝 𝐀𝐫𝐫𝐚𝐲𝐬 Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted. Example: Input: nums1 = [1,3], nums2 = [2] Output: 2.00000 Explanation: merged array = [1,2,3] and median is 2. #100DaysOfCode #LeetCode #developmentjourney #techcommunity #DataStructures #ProblemSolving #CodeNewbie #CodingChallenge #ProgrammingJourney #LearningToCode #geeksforgeeks #coderarmy #codingninjas #development #Motivation #cpp #array You can see the code I have written to solve this problem in the image attached below, and if you want to access it directly, here is my GitHub link to the code: https://lnkd.in/gi6qHdWd If you have any suggestions regarding the post or the approach to the question, feel free to write them down in the comment section, and let's help each other grow in this journey of coding :)

Day 9/100: Solved Valid Anagram! 🚀 Today, I tackled the "Valid Anagram" problem on LeetCode. If two strings contain the same characters but in a different order, they can be said to be anagrams. The challenge was given two strings s and t, return true if t is an anagram of s, and false otherwise. Excited to keep pushing forward on this coding journey! #LeetCode #CodingJourney #100DaysOfCode #ProblemSolving #LearningEveryDay

📈 Day 35/75 of #75DaysOfCode 📈 Just conquered the "Combination Sum II" problem on LeetCode! Here's how I tackled it: 🔗 Problem Link: https://lnkd.in/e8n3T47C 💡 Problem Description: The task was to find all unique combinations of candidate numbers from an array where the numbers sum to a given target. However, each number in the array could only be used once in a combination. 🛠️ Approach: I implemented a backtracking algorithm in C++ to efficiently explore all possible combinations. By recursively traversing the candidates and updating the target, I ensured that each number was used at most once. This approach helped in generating unique combinations, and I stored them in the result set to avoid duplicates. 🎉 Thrilled to have solved this problem efficiently! Ready for more coding challenges as I continue my #75DaysOfCode journey! #CodingChallenge #Backtracking #LeetCode #CPPProgramming

🚀 Day 84 of #100DaysOfCode 🚀 Today, I tackled an interesting problem: Extra Characters in a String on LeetCode. The challenge was to break a string into one or more non-overlapping substrings that are present in a given dictionary, while minimizing the number of extra characters left over. 📝 Check out the problem here: https://lnkd.in/gr_A6hPd 💻 My solution is on GitHub: https://lnkd.in/g6yhMKqV This problem was a great exercise in string manipulation and dynamic programming! 💡 Happy coding! 💻✨ #StringManipulation #DynamicProgramming #Leetcode #CodingChallenge #100DaysOfCode #Day84 #TechJourney #GeetaTechnicalHub

🚀 Day 31 of My Coding Challenge: Solved "K-diff Pairs in an Array" on LeetCode with the Two-Pointer Approach! 🚀 Today, I tackled the "K-diff Pairs in an Array" problem on LeetCode, exploring a two-pointer technique to find unique pairs where the absolute difference equals a given integer kkk. Sorting the array and maintaining two pointers allowed me to efficiently track pairs without redundancy, storing only unique pairs and keeping performance optimized. ✨ Key Takeaways: 1. The two-pointer approach helped manage both time and space efficiency. 2. Leveraging C++ STL’s set made it easy to handle unique pairs and avoid duplicates. 🔗 Sharing my progress to stay consistent and keep learning! Excited to tackle more challenges on this journey! #LeetCode #CodingChallenge #TwoPointers #DataStructures #DSA #C++ #100DaysOfCode #ProblemSolving #LearningJourney

Day 61 of #100daysofcode Today I solved a medium level question on LeetCode named "Verify Preorder Serialization of a Binary Tree" Question:- Given a string of comma-separated values preorder, return true if it is a correct preorder traversal serialization of a binary tree. It is guaranteed that each comma-separated value in the string must be either an integer or a character '#' representing null pointer. You may assume that the input format is always valid. For example, it could never contain two consecutive commas, such as "1,,3". Note: You are not allowed to reconstruct the tree.   Example 1: Input: preorder = "9,3,4,#,#,1,#,#,2,#,6,#,#" Output: true Explanation:- The provided C++ code validates if a given preorder traversal string of a binary tree is a valid serialization. It appends a comma to the string for easier parsing and uses a slot-counting mechanism, starting with one slot. As it iterates over the string, it decreases the slot count for each node (`ans--`). If a node is not null (`#`), it adds two slots (`ans += 2`). If slots become negative during iteration, the serialization is invalid. The traversal is valid if, after processing all nodes, the slot count is zero (`ans == 0`). This ensures proper node-to-slot correspondence. . #100DaysOfCode #LeetCode #developmentjourney #techcommunity #DataStructures #ProblemSolving #CodeNewbie #CodingChallenge #ProgrammingJourney #LearningToCode #geeksforgeeks #coderarmy #codingninjas #development #Motivation #DSA #cpp #trees #binarytree #preordertraversal #verifypreorderserializationofabinarytree #string #POTD Happy Coding!

Day 53 of #100daysofcode Today I solved a easy level question on LeetCode named "Length of Last Word" Question:- Given a string s consisting of words and spaces, return the length of the last word in the string. A word is a maximal  substring consisting of non-space characters only. Example 1: Input: s = "Hello World" Output: 5 Explanation: This C++ code defines a method `lengthOfLastWord` that calculates the length of the last word in a given string `s`. The method initializes two variables, `a` and `b`, to 0. It then iterates backward through the string using a `for` loop. If it encounters a space after finding the last word (indicated by `a` being 1), it breaks the loop. If the character is not a space, it sets `a` to 1 (indicating a word has been found) and increments `b`, which counts the characters of the last word. Finally, it returns `b`, the length of the last word. #100DaysOfCode #LeetCode #developmentjourney #techcommunity #DataStructures #ProblemSolving #CodeNewbie #CodingChallenge #ProgrammingJourney #LearningToCode #geeksforgeeks #coderarmy #codingninjas #development #Motivation #DSA #cpp #string #twopointers #lengthoflastword Happy Coding!

🚀 Day [43] of #100DaysOfCode Challenge Hey LinkedIn folks! 👋 Today's Question: 8. String to Integer (atoi) LANGUAGE :- C++ 🚀 Making progress and embracing the coding journey. 🌟 Excited about what's unfolding. May your code be bug-free and your algorithms swift, fellow adventurers! 🌌💻 Any better approach share me guys :) Exciting times ahead! 💻 #100DaysOfCode #CodeUpdate #Programmingjourney #codewithme #code #codingjourney #problemsolving

🌟 Day 63 of 100 Days of Code! 🌟 Today, I worked on two medium-level backtracking problems from LeetCode’s 100 Most Liked Questions Study Plan. Here's what I solved: 1️⃣ Letter Combinations of a Phone Number (17): This problem challenges you to generate all possible letter combinations for a given phone number using backtracking. It took some thought, but the recursive solution came through! 2️⃣ Generate Parentheses (22): Another engaging backtracking problem that required generating all valid combinations of parentheses. It was tough but a lot of fun! "In coding, the hardest problems often teach the most valuable lessons." #LeetCode #Backtracking #ProblemSolving #CodingJourney #100DaysOfCode

Day 59 of #100daysofcode Today I solved a medium level question on LeetCode named "Minimum Time Difference" Question:- Given a list of 24-hour clock time points in "HH:MM" format, return the minimum minutes difference between any two time-points in the list.   Example 1: Input: timePoints = ["23:59","00:00"] Output: 1 Explanation:- The provided C++ function `findMinDifference` finds the minimum difference in minutes between any two time points in a list of time strings. It converts each time string to minutes since midnight, stores these values in a vector `v`, and sorts it. It then iterates through the sorted vector to find the minimum difference between consecutive times. Additionally, it checks the difference between the first and last times across midnight (1440 minutes in a day). The smallest difference found is stored in `a`, which is returned at the end. This ensures the function accounts for both consecutive and cross-midnight time differences. #100DaysOfCode #LeetCode #developmentjourney #techcommunity #DataStructures #ProblemSolving #CodeNewbie #CodingChallenge #ProgrammingJourney #LearningToCode #geeksforgeeks #coderarmy #codingninjas #development #Motivation #DSA #cpp #sorting #vector #minimumtimedifference Happy Coding!