Find Integer Difference Between Equal Arrays

🚀 Day 39/150 of hashtag#150DaysOfDSA 📌 Task: Happy Number Write an algorithm to determine if a number n is happy. A happy number is defined by the following process: Starting with any positive integer, replace the number by the sum of the squares of its digits. Repeat the process until the number equals 1 (where it will stay), or it loops endlessly in a cycle which does not include 1. Return true if n is a happy number, and false if not. #150DaysOfCode #DSA #CPP #Algorithms #CodingJourney #ProblemSolving

🚀 Day 49/150 of hashtag#150DaysOfDSA 📌 Task: Two Sum Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element twice. You can return the answer in any order. #150DaysOfCode #DSA #CPP #Algorithms #CodingJourney #ProblemSolving

🚀 Day 43/150 of hashtag#150DaysOfDSA 📌 Task: Find First and Last Position of Element in Sorted Array Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value. If target is not found in the array, return [-1, -1]. You must write an algorithm with O(log n) runtime complexity. #150DaysOfCode #DSA #CPP #Algorithms #CodingJourney #ProblemSolving

Practiced Stack problems to strengthen my understanding 📘💻 Solved important problems like Next Greater Element, Next Smaller Element, Previous Greater Element, Previous Smaller Element, Next Greater Element in Circular Array, and Valid Parentheses. 🔹 Largest Rectangle in Histogram One of the most important stack-based problems that helped me understand the practical use of monotonic stack for optimizing area calculations. These problems improved my ability to apply stack concepts for efficient problem-solving and optimization. #DSA #Stack #MonotonicStack #LargestRectangleHistogram #ProblemSolving #Algorithms #CPlusPlus #LearningJourney #CodingJourney

🚀 Day 48/150 of hashtag#150DaysOfDSA 📌 Task: Valid Perfect Square Given a positive integer num, return true if num is a perfect square or false otherwise. A perfect square is an integer that is the square of an integer (i.e., the product of an integer with itself). You must not use any built-in library function, such as sqrt. #150DaysOfCode #DSA #CPP #Algorithms #CodingJourney #ProblemSolving

🚀 Day 32/150 of hashtag#150DaysOfDSA 📌 Task: Plus One You are given a large integer represented as an integer array digits, where each digits[i] is the ith digit of the integer. The digits are ordered from most significant to least significant in left-to-right order. The large integer does not contain any leading 0's. Increment the large integer by one and return the resulting array of digits. #150DaysOfCode #DSA #CPP #Algorithms #CodingJourney #LeetCode #ProblemSolving

🚀 Day 56 of #geekstreak60 Challenge Powered by NPCI ✅ Today’s Problem: Remove Spaces from String 🔍 Key Insight: Traverse the string and simply skip all space characters, keeping only valid characters. Can be optimized using an in-place approach for better space efficiency. 💡 What I learned: • Basic string traversal techniques • Writing in-place optimized solutions • Importance of handling input efficiently • Strengthening fundamentals for bigger string problems ⚡ This problem reinforced how mastering simple concepts is key to solving more complex problems efficiently. #geekstreak60 #NPCI #Strings #Algorithms #CodingJourney #Cpp

🚀 Day 46/150 of hashtag#150DaysOfDSA 📌 Task: Set Mismatch You have a set of integers s, which originally contains all the numbers from 1 to n. Unfortunately, due to some error, one of the numbers got duplicated, resulting in one repeated number and one missing number. You are given an integer array nums representing this incorrect set. Find the number that occurs twice and the number that is missing, and return them in the form of an array. #150DaysOfCode #DSA #CPP #Algorithms #CodingJourney #ProblemSolving

🚀 Day 35/150 of hashtag#150DaysOfDSA 📌 Task: Linked List Creation (Advanced DSA) Create a singly linked list by inserting multiple nodes at the end and display the complete list. Each node should store an integer value and a pointer to the next node. #150DaysOfCode #DSA #CPP #Algorithms #CodingJourney #ProblemSolving

🚀 Day 33/150 of hashtag#150DaysOfDSA 📌 Task: Sqrt(x) Given a non-negative integer x, return the square root of x rounded down to the nearest integer. The returned integer should be non-negative as well. You must not use any built-in exponent function or operator. #150DaysOfCode #DSA #CPP #Algorithms #CodingJourney #LeetCode #ProblemSolving