Yahoo India Web Search

Sign In

Search results

  1. leetcode.com › problems › longest-substring-withoutLongest Substring Without Repeating Characters - LeetCode

    Longest Substring Without Repeating Characters - Given a string s, find the length of the longest substring without repeating characters. Example 1: Input: s = "abcabcbb" Output: 3 Explanation: The answer is "abc", with the length of 3.

  2. www.geeksforgeeks.org › length-of-the-longestLength of the longest substring without repeating characters

    Apr 15, 2024 · Given a string str, find the length of the longest substring without repeating characters. Example: Example 1: Input: “ABCDEFGABEF”. Output: 7. Explanation: The longest substring without repeating characters are “ABCDEFG”, “BCDEFGA”, and “CDEFGAB” with lengths of 7. Example 2: Input: “GEEKSFORGEEKS”. Output: 7.

  3. www.geeksforgeeks.org › print-longest-substringPrint Longest substring without repeating characters ...

    Oct 4, 2023 · Print Longest substring without repeating characters. Last Updated : 04 Oct, 2023. Given a string, print the longest substring without repeating characters. For example, the longest substrings without repeating characters for “ABDEFGABEF” are “BDEFGA” and “DEFGAB”, with length 6.

  4. www.baeldung.com › java-longest-substring-withoutFind the Longest Substring Without Repeating Characters

    Jan 8, 2024 · In this tutorial, compare ways to find the longest substring of unique letters using Java. For example, the longest substring of unique letters in “CODINGISAWESOME” is “NGISAWE”. 2. Brute Force Approach. Let’s start with a naive approach.

  5. www.codingbroz.com › longest-substring-withoutLongest Substring Without Repeating Characters - Leetcode ...

    Longest Substring Without Repeating Characters. Table of Contents. Problem. Given a string s, find the length of the longest substring without repeating characters. Example 1 : Input: s = "abcabcbb" Output: 3. Explanation: The answer is "abc", with the length of 3. Example 2 : Input: s = "bbbbb" Output: 1.

  6. stackoverflow.com › questions › 9734474Find longest substring without repeating characters

    Mar 16, 2012 · Given a string S of length N find longest substring without repeating characters. Example: Input: "stackoverflow" Output: "stackoverfl" If there are two such candidates, return first from left...

  7. www.javatpoint.com › length-of-the-longestLength of the longest substring without repeating characters ...

    Explanation: The longest substring without repeating characters is "issi," with a length of 4. Approach: Using Sliding Window in O(n3) time. The Sliding Window approach, used to find the longest substring without repeated characters in O(n^3) time, involves moving a window through the text to check for substrings. Algorithm:

  1. Searches related to longest substring without repeating characters

    longest substring without repeating characters leetcode
    longest substring without repeating characters solution
    max consecutive ones iii
    median of two sorted arrays
    longest palindromic substring
    longest subarray with sum k
    minimum window substring
    zigzag conversion leetcode solution
    reverse integer leetcode solution
    minimum size subarray sum
  2. People also search for