Sliding Window Algorithm - Longest Substring Without Repeating Characters - LeetCode #27

Longest Substring Without Repeating Characters (Sliding Window Technique) #27 LeetCode challenge problem description (PHP, Medium).

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

If you want to solve Longest Substring Without Repeating Characters LeetCode problem yourself go to:

--

#leetcode #php #prgramming

[ahmedabdullajev]

thank you, good algorithm, but why you use [] in max(), when you could do just like this
$maxLength = max($maxLength, strlen($currentString)); //without [], is there difference?