Andrew Healey • 1/2/2019

Leetcode - Episode 2 - Three More Easys

Read Original

The article details the author's approach to solving three LeetCode 'Easy' problems: 'N-Repeated Element in Size 2N Array' using a Counter, 'Univalued Binary Tree' using DFS, and 'Unique Morse Code Words' using a set. It includes Python code snippets, runtime and space complexity analysis, and reflections on alternative solutions and Python language features.

0 comments
#Python #data structures #time complexity
Leetcode - Episode 2 - Three More Easys

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
The Beautiful Web
Jens Oliver Meiert • 2 votes
2
When your coding agent doesn’t understand your project, you’ll get junk
Benjamin Cane • 1 votes
3
LLM Use in the Python Source Code
Miguel Grinberg • 1 votes
4
Wagon’s algorithm in Python
John D. Cook • 1 votes
5
An example conversation with Claude Code
Dumm Zeuch • 1 votes