Longest Substring Without Repeating Characters

Approach: 1.We use the sliding window approach. 2.Here the while loop will start when the initial character has been deleted and the initial value has been incremented every time with -> begin = begin + 1. This will increment it to 1 past the initial repeating character. 3. Time complexity: O(1) 4. Space complexity: O(n)

Fixes #(issue_no)

Replace issue_no in the above line, with the issue related to this PR.

Code

let s1 = "abcabcbb"
let s2 = "pwwkew"


var lengthOfLongestSubstring = function(s) {
      let max = 0
      let begin = 0
      let set = new Set()
      
      
      for(let end = 0; end < s.length;end++){
          while(set.has(s[end])){
              set.delete(s[begin])
              begin = begin +1
          }
          set.add(s[end])
          max = Math.max(max,end-begin+1)
          
      }
      return max
      };

//Example 1
     let maxsubstring = lengthOfLongestSubstring(s1)
     console.log(maxsubstring)                           //Expected : 3

//Example 2
     let sub2 = lengthOfLongestSubstring(s2)
     console.log(sub2)                                   //Expected : 3

Screenshot

Checklist:

Please tick all the boxes that are fulfilled by your Pull Request.

• [✔️ ] I have named my files and folder, according to this project's guidelines.
• [✔️ ] My code follows the style guidelines of this project.
• [✔️ ] My Pull Request has a descriptive title. (not a vague title like Solved xyz problem)
• [✔️ ] I have commented on my code, particularly in hard-to-understand areas.
• [✔️ ] My changes do not produce any warnings.
• [✔️ ] My submission will produce the expected results and not any errors.
• [✔️ ] I have added a working sample/screenshot in this pull request.

hello sir, Hope you may like this work. In case of any changes in code kindly contact me, I will love to do so. If possible please merge my pull request. Thankyou

Regards

The logic of this program is simple. In this program, the smaller integer between n1 and n2 is stored in n2. Then the loop is iterated from i = 1 to i <= n2 and in each iteration, the value of i is increased by 1. If both numbers are divisible by i then, that number is stored in variable gcd. This process is repeated in each iteration. When the iteration is finished, GCD will be stored in variable gcd.

I just reprogrammed your fib code in few lines of code cause its time and space efficient.Using function default keyword made it easier to solve and run tha using loops and statements.I think so you agree with my point.