LeetCode Contest 466 – Q2 Minimum Operations to Transform String Solved in contest! Compared both strings → tracked mismatches → calculated ops based on differences Great mix of string traversal & greedy logic! #LeetCode #Contest #PythonDSA #DSA #DailyPractice

LeetCode 1283 – Find the Smallest Divisor Given a Threshold Find the smallest divisor so that sum of [num/div]≤threshold Used binary search on divisor range[1…max(nums)] For each mid, compute sum If sum-threshold:increase divisor Else:shrink search space #LeetCode #PythonDSA

LeetCode 1614 – Maximum Nesting Depth of Parentheses Solved: Find max depth of nested parentheses Traverse string, increment on '(',decrement on ')' Track maximum depth reached O(n) time, O(1)space Simple yet useful stack-like logic! #LeetCode #100DaysOfCode #PythonDSA #Strings

LeetCode 8 – String to Integer (atoi) Solved: Convert string to 32-bit signed integer Steps: Ignore leading spaces Handle sign + / - Build number till non-digit Clamp to integer range Classic string parsing problem! #LeetCode #100DaysOfCode #PythonDSA #Strings #DSA

LeetCode 796 – Rotate String Solved: Check if one string is rotation of another Trick: s2 must be a substring of s1 + s1 Simple check with in operator O(n²) worst-case, O(1) extra space Neat and elegant string trick! #LeetCode #100DaysOfCode #PythonDSA #Strings #DSA

LeetCode 540 – Single Element in a Sorted Array Find element that appears once in sorted array Binary search with index parity logic Pairs start at even index before single element Shift search space based on mid’s pairing O(log n) time, O(1) space #BinarySearch #DSA #PythonDSA