LeetCode
Question
#3 Longest Substring Without Repeating Characters
Question Details
LeetCode #3: Longest Substring Without Repeating Characters. Difficulty: Medium. Topics: Hash Table, String, Sliding Window. Asked at Cognizant in the last 6 months.
Original Source
This is a frequency-tagged signal. The full problem statement lives on the original source.
View original →About This Question
This is a reported interview question from a cognizant interview for a swe role during the coding round.
It covers the following topics: Hash Table, Sliding Window, Strings .
Difficulty rating: Medium
Topics
More Cognizant Interview Questions
GeeksforGeeks
Cognizant Digital Nurture 4.0 .Net Fse
GeeksforGeeks
Cognizant Digital Nurture 4.0 Interview Experience
GeeksforGeeks
Cognizant Interview Experience for GenC Pro Cybersecurity 2025 (On-Campus)
GeeksforGeeks
Cognizant Interview Experience for Genc Next Role (On-Campus)
GeeksforGeeks
Cognizant GenC Next Interview Experience | Selected | 2024-25