SOLUTIONS
LEETCODE.

Medium difficulty analysis and solutions.

Problem Difficulty Complexity Date
0003 Longest Substring Without Repeating Characters Medium T: O(n) / S: O(1) Mar 2026
0005 Longest Palindromic Substring Medium T: O(n^2) / S: O(n) Mar 2026
0006 Zigzag Conversion Medium T: O(n) / S: O(1) Jan 2026
0007 Reverse Integer Medium T: O(log x) / S: O(1) Mar 2026
0008 String to Integer (atoi) Medium T: O(n) / S: O(1) Jan 2026
0056 Merge Intervals Medium T: O(n log n) / S: O(n) Mar 2026
0840 Magic Squares In Grid Medium T: O(R * C) / S: O(1) Mar 2026
1292 Maximum Side Length of a Square Medium T: O(m * n) / S: O(m * n) Mar 2026
1382 Balance a Binary Search Tree Medium T: O(n) / S: O(n) Mar 2026
1653 Minimum Deletions to Make String Balanced Medium T: O(n) / S: O(1) Mar 2026
1877 Minimize Maximum Pair Sum in Array Medium T: O(n log n) / S: O(1) Mar 2026
1895 Largest Magic Square Medium T: O(m * n * min(m, n)) / S: O(m * n) Mar 2026