LeetCode Q2: Longest Substring Without Repeating Characters Using Sliding Window and HashMap in Java

Longest Substring Without Repeating Characters Using Sliding Window and HashMap - LeetCode Interview

---------

Schedule a meeting in case of any queries/guidance/counselling:

~~~Subscribe to this channel, and press bell icon to get some interesting videos on Selenium and Automation:

Follow me on my Facebook Page:

Let's join our Automation community for some amazing knowledge sharing and group discussion on Telegram:

Naveen AutomationLabs Paid Courses:
GIT Hub Course:

Java & Selenium:

Java & API +POSTMAN + RestAssured + HttpClient:

[akulabhaskar]

Hey Naveen, I was trying to understand this through Cgpt explanation, but I was not able to get the gist of it, now I am able to get the logic . Thanks Naveen

You should be in the DOGE Team.

[user-ri]

Hi Naveen,
Do you take offline classes for SDET? I am from Bangalore

[NamrataJagtap-ne]

Hi Sir, I have tried same program with below code.
import java.util.*;
import java.lang.*;

class Main {
public static void main(String[] args) {
String str = "book";
HashSet<Character> set = new HashSet<Character>();
int count =0;
int pos = 0;

for (int i=0;i<str.length()-1;i++)
{

{
pos = i;
break;
}



}

System.out.println(pos);
}
}