Spaces:
Sleeping
Sleeping
| lite_metadata: | |
| gradio_version: 3.32.0 | |
| liteobj_version: 0.0.7 | |
| class_string: gradio.interface.Interface | |
| kwargs: | |
| title: Gradio Webapp | |
| description: Given a string s, find the length of the longest substring without | |
| repeating characters | |
| article: null | |
| thumbnail: null | |
| theme: gradio/seafoam | |
| css: null | |
| allow_flagging: never | |
| inputs: | |
| - class_string: gradio.components.Textbox | |
| kwargs: | |
| label: s | |
| outputs: | |
| - class_string: gradio.components.Number | |
| kwargs: | |
| label: output | |
| precision: 0 | |
| fn: | |
| class_string: gradify.gradify_closure | |
| kwargs: | |
| argmaps: | |
| - label: s | |
| postprocessing: null | |
| func_kwargs: {} | |
| source: "def lengthOfLongestSubstring(s):\n seen = {}\n start = 0\n \ | |
| \ max_len = 0\n for end in range(len(s)):\n if s[end] in seen:\n\ | |
| \ start = max(start, seen[s[end]] + 1)\n seen[s[end]] =\ | |
| \ end\n max_len = max(max_len, end - start + 1)\n return max_len\n" | |