Another coding problem successfully solved!
Today’s challenge was LeetCode – Zigzag Conversion, a great problem for practicing string manipulation, arrays, loops, and direction-based traversal in JavaScript. The problem gives us a string and a…
#Tech
Posts
Today’s coding challenge was LeetCode – Longest Palindromic Substring.
The goal is simple but interesting: given a string s, find the longest substring that reads the same forward and backward. For example: Input: "babad" Output: "bab" or "aba" 💡 Approach: Expand Around…
Today’s coding practice focused on a classic LeetCode problem: Longest Substring Without Repeating Characters.
The goal is simple but requires a smart approach: given a string, find the length of the longest substring that contains no repeated characters. For example: "abcabcbb" → 3 ("abc") "bbbbb" → 1 ("b") …
