🚀Day 31 of #100DaysOfCode.Today's Problem: Isomorphic Strings.• Task: Given two strings s and t, determine if characters in s can be uniquely replaced to get t. • Approach: ASCII-based hashing with two maps , Check mapping consistency from both sides. #DSA #Cpp

🚀Day 30 of #100DaysOfCode.Today's Problem: Longest Common Prefix.• Approach: Sort the array, Compare first and last strings only, Count matching characters from the start.• Time Complexity: O(N log N + M)., N = number of strings, M = length of shortest string. #DSA #cpp

🚀Day 29 of #100DaysOfCode.Today's Problem: Largest Odd Number in a String .• Task: Given a numeric string, extract the largest odd-valued substring from the left. No leading zeros in output!.• Concepts used: String manipulation, Reverse traversal . #CodingChallenge #DSA #cpp

🚀Day 28 of #100DaysofCode.Today’s problem was "Valid Anagram". • Key Learning: Sorting can simplify string comparison problems, especially when character frequency and order don’t matter. • Time Complexity: O(n log n) due to sorting. #Coding #DSA #cpp #100DaysChallenge

🚀Day 27 of #100DaysOfCode.Today's Problem: Sort Colors (LeetCode 75).• Task: Sort an array with elements {0,1,2} in-place.• Approach: Dutch National Flag Algorithm.• Time Complexity: O(n), Space: O(1).• Logic: 0 → front, 1 → middle, 2 → end. #LeetCode #DSA #Cpp

🚀Day 26 of #100DaysOfCode.Today's Problem: Sum of Highest and Lowest Frequency.• Task: Count frequencies and return sum of most & least frequent elements.• Approach: Use fixed-size array as a hash map , Track maxFreq and minFreq in one pass. #DSA #Cpp #CodingChallenge

🚀Day 25 of #100DaysOfCode.Today's Problem: Second Highest Occurring Element.• Approach: Used map for frequency count.• Logic: Count frequencies , Track max and second max frequency , Return smallest element with 2nd max freq. • Time Complexity is O(n). #DSA #Cpp #HashMap

🚀Day 24 of #100DaysOfCode.Today Problem is : Highest Occurring Element in an Array.• Approach: Frequency hashing using a vector.• Goal: Return the element with the highest frequency (smallest if tie).• Used: Hashing + Linear Scan. #DSA #Hashing #CodingChallenge #Cpp

🚀Day 23 of #100DaysOfCode. Today's Problem: GCD (Greatest Common Divisor) , LCM (Lowest Common Multiple).• Platform: @takeUforward_.• Concepts: Basic Math, Divisibility.• GCD – Found common divisor by iteration.• LCM – Found lowest multiple divisible by both. #DSA #Cpp

🚀Day 22 of #100DaysOfCode.Today question is LeetCode:39 Combination Sum .• Find all unique combinations that sum to a target using elements multiple times.• All valid combinations in any order. #LeetCode #CodingChallenge #Cpp #DSA

🚀Day 21 of #100DaysOfCode Today question is LeetCode #9: Palindrome Number.• Concept: Integer Manipulation.• Reversed half of the number to avoid overflow and unnecessary work. • Time Complexity is O(log₁₀(n)). #LeetCode #Coding #CPP #100DaysChallenge #ProblemSolving

🚀 Day 20 of #100DaysOfCode.Today question is LeetCode #2: Add Two Numbers.• Linked Lists + Carry Handling.• Learned to handle digit-wise addition with carry using a dummy node technique. • Output: A new linked list representing the sum in reverse order. #LeetCode #Coding #cpp

🚀Day 19 of #100DaysOfCode.Today’s question is : LeetCode #540 - Single Element in a Sorted Array.• Find the one element that appears only once in a sorted array where all others appear twice. • Used XOR to solve it in O(n) time . #LeetCode #CodingChallenge #CPP

🚀 Day 18 of #100DaysOfCode .Today problem is Leetcode #13: Roman to Integer .• Used a hashmap and greedy approach to handle subtraction rules like. • If a smaller value precedes a larger one → subtract, else → add. • Time Complexity is O(n). #CodingChallenge #LeetCode #cpp

🚀Day 17 of #100DayOfCode - Leetcode #26: Remove Duplicates from Sorted Array .Today’s problem was all about in-place array manipulation. • Used the two-pointer technique.• Time Complexity is O(n). #100DaysOfCode #LeetCode #cpp #Algorithms

🚀Day 16 of #100DaysOfCode - LeetCode #962: Maximum Width Ramp .Today's challenge was all about finding the widest ramp in an array. • Stack + reverse traversal.• Learned how to optimize search using decreasing stacks. #LeetCode #CodingChallenge #cpp #DataStructures

🚀 Day 15 of #100DaysOfCode.Today problem is Leetcode #11: Container With Most Water.• Used two-pointer approach (O(n)).• Optimized to always move the shorter wall inward. #Leetcode #CPP #CodingChallenge #DevLife

🔥 Day 14 of #100DaysOfCode.Today problem is Find First and last position of element in sorted array Leetcode #34: Find First and Last Position of Element in Sorted Array.• Used binary search (O(log n)) to locate first & last indices efficiently. #Leetcode #CodingChallenge #CPP

🚀 Day 13 of #100DaysOfCode.Today question is LeetCode #121 – Best Time to Buy and Sell Stock. • Learned how to track the minimum price so far and calculate max profit in a single pass using a greedy approach. • Time Complexity: O(n) . #CodingChallenge #LeetCode #cpp #Coding

🚀 Day 12 of #100DaysOfCode.Today’s challenge: LeetCode 2149 - Rearrange Array Elements by Sign.Order of elements with the same sign is preserved. • Used two pointers to place positives at even and negatives at odd indices. • Time complexity is O(n). #Coding #LeetCode #cpp