InterviewDB Question

Yahoo Phone Interview: Coding Problems and Format

Question Details

Round 1 - Coding Format: 45-minute phone screen with a shared code editor. Two problems, difficulty easy to medium. Q1: Given a string, find the length of the longest substring without repeating characters. Example: Q2: Given a binary tree, return the level-order traversal as a list of lists. Example: Follow-ups For Q1: what is the time complexity of your sliding window approach? Can you reduce space usage? For Q1: how would you handle Unicode characters vs. ASCII-only? For Q2: how would you do…

Full Details

🔒

Unlock all Yahoo questions

Full insider details, leaked discussions, and candidate experiences.

Get full access — $100 a year, unlimited access

About This Question

This is a reported interview question from a yahoo interview during the phone round.

It covers the following topics: Strings, Sliding Window, Binary Tree, Phone, Coding .