CtCI-6th-Edition-Python

CtCI-6th-Edition-Python copied to clipboard

I believe this also works with O(n), but is shorter and more understandable.

mitramir55

check each char and replace spaces with %20 Time Complexity = o(n)

akinyolci

I added a solution for bidirectional search. This type of search is explained in chapter 04 but it's not mentioned in the solutions. I think is a good variation of...

fscheu

feature(C02_P04): added solution - lr_partition

chienhsiang-hung

feat(chapter_01): Upgrade to Python 3.12, refactor, and enhance security

1

This commit brings several improvements to your code in Chapter 1: 1. **Python 3.12 Upgrade & Modernization**: * I updated all Python files in `chapter_01` to be compatible with Python...

awake416

Fix AttributeError in dequeue_cat and dequeue_dog methods

1

The dequeue_cat and dequeue_dog methods throw an error if the dequeued node is the first node, since it attempts to call the next_node attribute in None

miguelvc6

Space efficient solution O(1)

1

Add a more space efficient solution and add proper testing. The solution is O(n) time and O(1) space.

davi-maciel