Implement a BrowserSession for a single-tab browser. APIs: - BrowserSession(string homepage): Initialize with homepage; current page starts at homepage. - void visit(string url): Navigate to url from the current page and clear any forward history. - string back(int steps): Move up to steps back in history; if fewer pages exist, move as far as possible. Return the current url after the move. - string forward(int steps): Move up to steps forward in history; if fewer pages exist, move as far as possible. Return the current url after the move. Bonus: - bool haveVisited(string url): Return whether the session has ever visited url at least once since construction, regardless of whether it is currently in back/forward history. Requirements: - Target O( 1) amortized time per operation and O(n) space for n total visits. - Define how to handle edge cases (e.g., steps <= 0, visiting the same url consecutively, empty forward history). - Describe and justify your data structure choices (e.g., two stacks, doubly linked list + cursor, dynamic array + index) and their trade-offs in time/space.

This question evaluates understanding of data structures, stateful API behavior, amortized time complexity, set membership tracking, and edge-case handling for implementing browser-like history navigation in the coding & algorithms domain.

How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

What difficulty level is this interview question?

This is a Medium difficulty Coding & Algorithms question, commonly asked during Technical Screen rounds at Chime.

What role is this question designed for?

This question is commonly asked for Software Engineer candidates at Chime during technical interviews.

Implement single-tab browser history navigation

Q: Implement single-tab browser history navigation

This question evaluates understanding of data structures, stateful API behavior, amortized time complexity, set membership tracking, and edge-case handling for implementing browser-like history navigation in the coding & algorithms domain.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Q: What difficulty level is this interview question?

This is a Medium difficulty Coding & Algorithms question, commonly asked during Technical Screen rounds at Chime.

Q: What role is this question designed for?

This question is commonly asked for Software Engineer candidates at Chime during technical interviews.

Implement a BrowserSession for a single-tab browser.

APIs:

BrowserSession(string homepage): Initialize with homepage; current page starts at homepage.
void visit(string url): Navigate to url from the current page and clear any forward history.
string back(int steps): Move up to steps back in history; if fewer pages exist, move as far as possible. Return the current url after the move.
string forward(int steps): Move up to steps forward in history; if fewer pages exist, move as far as possible. Return the current url after the move.

Bonus:

bool haveVisited(string url): Return whether the session has ever visited url at least once since construction, regardless of whether it is currently in back/forward history.

Requirements:

Target O(

amortized time per operation and O(n) space for n total visits.

Define how to handle edge cases (e.g., steps <= 0, visiting the same url consecutively, empty forward history).
Describe and justify your data structure choices (e.g., two stacks, doubly linked list + cursor, dynamic array + index) and their trade-offs in time/space.

Implement a BrowserSession for a single-tab browser.

APIs:

BrowserSession(string homepage): Initialize with homepage; current page starts at homepage.
void visit(string url): Navigate to url from the current page and clear any forward history.
string back(int steps): Move up to steps back in history; if fewer pages exist, move as far as possible. Return the current url after the move.
string forward(int steps): Move up to steps forward in history; if fewer pages exist, move as far as possible. Return the current url after the move.

Bonus:

bool haveVisited(string url): Return whether the session has ever visited url at least once since construction, regardless of whether it is currently in back/forward history.

Requirements:

Target O(

amortized time per operation and O(n) space for n total visits.

Define how to handle edge cases (e.g., steps <= 0, visiting the same url consecutively, empty forward history).
Describe and justify your data structure choices (e.g., two stacks, doubly linked list + cursor, dynamic array + index) and their trade-offs in time/space.

Implement single-tab browser history navigation

Quick Overview

Comments (0)

Implement single-tab browser history navigation

Quick Overview

Comments (0)