Coding Problems Blog Pricing

Loading...

Helping engineers land their dream jobs at top tech companies through real-world interview prep and 1-on-1 mentorship.

Twitter GitHub LinkedIn

Platform

Blog
Coach Interview AI
Mock Interview AI
DS and Coding
Pricing

Resources

Coding Problems
System Design
About

Contact

Support
Sales
Billing
Press / Marketing

Legal

Privacy Policy
Terms of Service
Refund Policy

© 2026 DevMentor. All rights reserved.

Built with Next.js, Prisma, and Clerk.

Loading...

Longest Substring Without Repeating Characters — Coding Practice | DevMentor

For the best coding experience, use a desktop browser.

Medium

String

Longest Substring Without Repeating Characters

Given a string s, return the length of the longest substring without repeating characters.

Examples

Input: s = "abcabcbb"

Output: 3

Sample Test Cases

Case 1 Input: "abcabcbb"

Expected: 3

Case 2 Input: "bbbbb"

Expected: 1

Loading editor...

Case 1 Input: "abcabcbb"

Expected: 3

Case 2 Input: "bbbbb"

Expected: 1