SOLUCIONES
LEETCODE.
Soluciones de dificultad Medio, con complejidad temporal y espacial.
| Problema | Dificultad | Complejidad | Fecha |
|---|---|---|---|
| 0003 Longest Substring Without Repeating Characters | Medio | T: O(n) / S: O(1) | mar 2026 |
| 0005 Longest Palindromic Substring | Medio | T: O(n^2) / S: O(n) | mar 2026 |
| 0006 Zigzag Conversion | Medio | T: O(n) / S: O(1) | ene 2026 |
| 0007 Reverse Integer | Medio | T: O(log x) / S: O(1) | mar 2026 |
| 0008 String to Integer (atoi) | Medio | T: O(n) / S: O(1) | ene 2026 |
| 0056 Merge Intervals | Medio | T: O(n log n) / S: O(n) | mar 2026 |
| 0840 Magic Squares In Grid | Medio | T: O(R * C) / S: O(1) | mar 2026 |
| 1292 Maximum Side Length of a Square | Medio | T: O(m * n) / S: O(m * n) | mar 2026 |
| 1382 Balance a Binary Search Tree | Medio | T: O(n) / S: O(n) | mar 2026 |
| 1653 Minimum Deletions to Make String Balanced | Medio | T: O(n) / S: O(1) | mar 2026 |
| 1877 Minimize Maximum Pair Sum in Array | Medio | T: O(n log n) / S: O(1) | mar 2026 |
| 1895 Largest Magic Square | Medio | T: O(m * n * min(m, n)) / S: O(m * n) | mar 2026 |