Kadane Algorithm Solves LeetCode 152

#Day550 of #600DaysOfDSA Topics and Learnings: #BinarySearch Problems Re-revised: 170. #Leetcode #1283 : Find the Smallest Divisor Given a Threshold Approach: Used Binary Search to solve this Complexity Analysis: TC: O(log(max)*N) SC: O(1) #600DaysLeetCodeChallenge #600DaysLeetCode #DataStructures #Algorithms #ProblemSolving #DSA #LeetCode #TakeUForward #TUF+ #SoftwareDevelopment #ContinuousLearning #ProfessionalGrowth #Coding

#Day534 of #600DaysOfDSA Topics and Learnings: #MergeSort Problems Re-revised: 154. #LeetCode #493 : Reverse Pairs Approach: Used #MergeSort to solve this Complexity Analysis: TC: O(N * logN) SC: O(N) #600DaysLeetCodeChallenge #600DaysLeetCode #DataStructures #Algorithms #ProblemSolving #DSA #LeetCode #TakeUForward #TUF+ #SoftwareDevelopment #ContinuousLearning #ProfessionalGrowth #Coding

#Day538 of #500DaysOfDSA Topics and Learnings: #BinarySearch Problems Re-revised: 158. #TUF+ : Find square root of a number Approach: Used #BinarySearch to solve this Complexity Analysis: TC: O(logN) SC: O(N) #500DaysLeetCodeChallenge #500DaysLeetCode #DataStructures #Algorithms #ProblemSolving #DSA #LeetCode #TakeUForward #TUF+ #SoftwareDevelopment #ContinuousLearning #ProfessionalGrowth #Coding

#Day533 of #600DaysOfDSA Topics and Learnings: #BitwiseOperation Problems Re-revised: 153. #TUF+ : Find the repeating and missing number Approach: Used #BitwiseOperation to solve this Complexity Analysis: TC: O(N) SC: O(1) #600DaysLeetCodeChallenge #600DaysLeetCode #DataStructures #Algorithms #ProblemSolving #DSA #LeetCode #TakeUForward #TUF+ #SoftwareDevelopment #ContinuousLearning #ProfessionalGrowth #Coding

#Day545 of #600DaysOfDSA Topics and Learnings: #BinarySearch Problems Re-revised: 165. #Leetcode #240 : Search a 2D Matrix II Approach: Used #BinarySearch to solve this Complexity Analysis: TC: O(N + M) SC: O(1) #600DaysLeetCodeChallenge #600DaysLeetCode #DataStructures #Algorithms #ProblemSolving #DSA #LeetCode #TakeUForward #TUF+ #SoftwareDevelopment #ContinuousLearning #ProfessionalGrowth #Coding

#Day537 of #600DaysOfDSA Topics and Learnings: #BinarySearch Problems Re-revised: 157. #TUF+ : Find Nth root of a number Approach: Used #BinarySearch to solve this Complexity Analysis: TC: O(logN) SC: O(1) #600DaysLeetCodeChallenge #600DaysLeetCode #DataStructures #Algorithms #ProblemSolving #DSA #LeetCode #TakeUForward #TUF+ #SoftwareDevelopment #ContinuousLearning #ProfessionalGrowth #Coding

DAY->26 🚀 LeetCode 1002 — Find Common Characters | Frequency Optimization 🔥 Solved this problem using a frequency array approach and achieved 100% runtime (0 ms) ⚡ 🔍 The goal is to find characters that appear in all strings, including duplicates. 💡 Approach: Use a frequency array of size 26 Initialize with a large value (INT_MAX) For each word: Count character frequency Update global frequency using minimum values 🧠 Key Insight: We take the minimum frequency because a character must exist in every string. ⚡ Complexity: Time → O(n × k) Space → O(1) This problem helped me understand how frequency comparison can efficiently find common elements 🚀 #DSA #LeetCode #Cpp #Coding #ProblemSolving #Arrays #LearningJourney

#Day542 of #600DaysOfDSA Topics and Learnings: #BinarySearch Problems Re-revised: 162. #TUF+ : Lower Bound Approach: Used #BinarySearch to solve this Complexity Analysis: TC: O(logN) SC: O(1) #600DaysLeetCodeChallenge #600DaysLeetCode #DataStructures #Algorithms #ProblemSolving #DSA #LeetCode #TakeUForward #TUF+ #SoftwareDevelopment #ContinuousLearning #ProfessionalGrowth #Coding

Solved the Reverse Integer problem without using any built-in functions 💻 Implemented a digit-by-digit reversal approach while carefully handling overflow using boundary checks. This ensures the solution is both safe and efficient. 🔹 Time Complexity: O(log n) 🔹 Space Complexity: O(1) Glad to see it pass all test cases with optimal performance 🚀 Sometimes, sticking to fundamentals is the best way to strengthen problem-solving skills. #Coding #DataStructures #Algorithms #ProblemSolving #CProgramming #LeetCode

#Day543 of #600DaysOfDSA Topics and Learnings: #BinarySearch Problems Re-revised: 163. #TUF+ : Find row with maximum 1's Approach: Used #BinarySearch to solve this Complexity Analysis: TC: O(N * logM) SC: O(1) #600DaysLeetCodeChallenge #600DaysLeetCode #DataStructures #Algorithms #ProblemSolving #DSA #LeetCode #TakeUForward #TUF+ #SoftwareDevelopment #ContinuousLearning #ProfessionalGrowth #Coding