|
Problem in the code
|
3
|
December 27, 2022
|
|
Test case are not running correct in some steps
|
3
|
July 23, 2021
|
|
Maximum length character | window sliding
|
3
|
July 10, 2021
|
|
Interview question window sliding
|
3
|
May 5, 2021
|
|
MAXIMUM LENGTH UNIQUE CHARACTER SUBSTRING
|
2
|
February 24, 2021
|
|
Stacks using 2 queqes
|
3
|
February 17, 2021
|
|
Hackerank data sruvtures
|
2
|
February 12, 2021
|
|
Hackerank-data structures
|
3
|
February 12, 2021
|
|
Hacker rank AND xor OR
|
8
|
February 10, 2021
|
|
Wrong answer- max length unique substring
|
3
|
January 28, 2021
|
|
Not able to understand visited array
|
3
|
January 20, 2021
|
|
Maximum length Unique character substring(sliding window)
|
2
|
January 13, 2021
|
|
Time complexity of brute force approach
|
5
|
November 10, 2020
|
|
Problem with the solution from the video
|
7
|
November 2, 2020
|
|
Maximum length unique char substring
|
5
|
October 19, 2020
|
|
About the time complexity of the brute force approach
|
2
|
September 4, 2020
|
|
Please answer this
|
2
|
August 23, 2020
|
|
What is the meaning
|
3
|
August 14, 2020
|
|
Howwe are updating the last occurrence because it is always -1 how it is changing it is equated to visited array which have all element as -1
|
1
|
August 1, 2020
|
|
Why visited[a[0]] not giving error
|
4
|
July 29, 2020
|
|
Maximum length unique char substring problem
|
3
|
July 15, 2020
|
|
Giving wrong output for the original case
|
4
|
July 4, 2020
|
|
Maximum unique character substring
|
3
|
July 4, 2020
|
|
Use of i-current_len>lastocc
|
3
|
June 29, 2020
|
|
Maximum unique string
|
5
|
June 26, 2020
|
|
Plz check this code
|
6
|
June 21, 2020
|
|
Maximum length unique character Substring sliding window
|
2
|
June 17, 2020
|
|
Getting wrong answer
|
2
|
May 31, 2020
|
|
Can i improve complexity or it is fine
|
2
|
May 7, 2020
|
|
Brute force solution
|
3
|
April 12, 2020
|
