Andrew Healey • 1/12/2019

Leetcode - Episode 12 - Starting Early (3 x E)

Read Original

The article details the author's efficient Python solutions to three LeetCode string problems: 'Verifying an Alien Dictionary', 'Reverse Only Letters', and 'Backspace String Compare'. It explains the thought process behind achieving high runtime percentiles, discusses space and time complexity, and provides the code for each solution.

0 comments
#Python #algorithm #String
Leetcode - Episode 12 - Starting Early (3 x E)

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