Links with tag 'geeksforgeeks'

Longest unique substring

Given a string, find the length of the longest substring without repeating characters. For example, the longest substrings without repeating characters for “ABDEFGABEF” are “BDEFGA” and “DEFGAB”, with length 6. For “BBBB” the longest substring is “B”, with length 1. For “GEEKSFORGEEKS”, there are two longest substrings shown in the below diagrams, with length 7.

Tags: competitive geeksforgeeks programming string substring

thumb_up 2 thumb_down 0 comment 1
Competitive Programming

Top 10 Algorithms and Data Structures for Competitive Programming.

Tags: competitive geeksforgeeks programming

thumb_up 3 thumb_down 0 comment 1