Leetcode - Episode 8 - Breaking Out Some Mediums (3x M, 1x E)
Read OriginalThe article details the author's solutions to three LeetCode problems: designing a URL shortener with encoding, inserting a node into a Binary Search Tree, and calculating the minimum additions to make parentheses valid. It includes Python code, discusses design trade-offs, and analyzes time and space complexity for each problem.
Comments
No comments yet
Be the first to share your thoughts!
Browser Extension
Get instant access to AllDevBlogs from your browser
Top of the Week
1
Quoting Thariq Shihipar
Simon Willison
•
2 votes
2
Using Browser Apis In React Practical Guide
Jivbcoop
•
2 votes
3
Top picks — 2026 January
Paweł Grzybek
•
1 votes
4
In Praise of –dry-run
Henrik Warne
•
1 votes
5
Deep Learning is Powerful Because It Makes Hard Things Easy - Reflections 10 Years On
Ferenc Huszár
•
1 votes
6
Vibe coding your first iOS app
William Denniss
•
1 votes
7
AGI, ASI, A*I – Do we have all we need to get there?
John D. Cook
•
1 votes
8
Dew Drop – January 15, 2026 (#4583)
Alvin Ashcraft
•
1 votes