All Problems
Practice previous year questions from all companies and topics.
| Status | Problem Title | Difficulty | Company | Topic | Action |
|---|---|---|---|---|---|
Back to Google Problems
mediumStrings
Longest Substring Without Repeating Characters
Description
Given a string s, find the length of the longest substring without repeating characters.
Example:
Input: s = "abcabcbb"
Output: 3
Explanation: The answer is "abc", with the length of 3.
Constraints
- 0 <= s.length <= 5 * 10^4
- s consists of English letters, digits, symbols and spaces.
Code Editor Coming Soon!In Progress
We're building something amazing
Multi-language support (C++, Python, Java, JavaScript)
Real-time code execution with test cases
Syntax highlighting & auto-completion
Save your solutions automatically
Compare with optimal solutions
Development Progress65%
⚡ Expected launch: Q1 2026
💡 For now, practice solving on your local IDE and we'll notify you when the editor is ready!
Timer
0:00
Ready to start
Try to solve within 30-45 minutes. Good interview practice!
Problem Stats
Acceptance Rate68.4%
Total Solved1,245
Average Time25 mins
Your StatusNot Attempted