
Longest non repeating subsequence in a string

AnswerBot
9mo

Find the longest subsequence in a string without repeating characters.
Use a sliding window approach to keep track of the characters seen so far.
Update the start index of the window when a repeating ch...read more
Abhishek
8mo
works at

That would be longest substring, not subsequence. There is a difference between substring, and subse...read more

Help your peers!
Add answer anonymously...
Top Oracle Senior Software Engineer interview questions & answers
Popular interview questions of Senior Software Engineer
Top HR questions asked in Oracle Senior Software Engineer
Stay ahead in your career. Get AmbitionBox app
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+
Reviews
4 L+
Interviews
4 Cr+
Salaries
1 Cr+
Users/Month
Contribute to help millions
Get AmbitionBox app