Workspace

Problem workspace

3 day streakD

Simplify Unix Path

MediumStacksExpressions & parsing

The challenge

Return the canonical form of an absolute Unix path.

Path starts with /. Empty segments and . are ignored; .. removes one directory if possible. Other names, including ..., are literal.

Example

/a/./b/../../c/ → /c.

Use the walkthrough below to inspect the input and each state change.

See Simplify Unix Path, step by step

Inspect each push, pop, and recorded answer. Entries such as 2: 5 mean index: value.

Zero-based input · top labeled explicitlyLIFO
Input and stack stateCurrent input index: -1. Main stack bottom to top: []. Auxiliary stack · bottom → top: []. Read the input in order. The stack keeps only the state needed to resolve the next item.0a1.2b3..4..5c67Main stack · bottom → top ↑emptyAuxiliary · bottom → top ↑empty
Current input index
—
Main stack size
0
Step 01 / 10

Start with an empty stack

Read the input in order. The stack keeps only the state needed to resolve the next item.

Answer so far

Not recorded yet
Main stack · bottom → top
Empty
Auxiliary stack · bottom → top
Empty
View exact input and state

Input: ["","a",".","b","..","..","c",""]

Main stack: []. Auxiliary stack · bottom → top: [].

Put it into code

Read slash-separated names and keep the current directory chain.

Indices are zero-based. C++ uses C++17 or later.

def solve(segments):
    # segments = absolute_path.split('/')
    stack = []
    for name in segments:
        if name == '..':
            if stack: stack.pop()
        elif name and name != '.':
            stack.append(name)
    return '/' + '/'.join(stack)

A good place to start

Explore a pattern

A little guidance

Start with a pattern, read through a problem, and mark it solved when the idea clicks. Save anything you want to revisit.

New tutorials are added one at a time. Your bookmarks and solved checkmarks stay in this browser.

Explore the roadmap