Longest substring without repeating character solution | leetcode - 3 | harishnote

preview_player
Показать описание
Solution to Longest substring without repeating character leetcode problem number 3.
Рекомендации по теме
Комментарии
Автор

cnt [s [ j ] ]
cnt[ ] asks for an index (int) inside the square bracket, but s [ j ] gives a char. But still how it is ????

aurichand