Skip to main content

LeetCode 3| Longest Substring Without Repeating Characters | Medium

Problem

Given a string s, find the length of the longest substring without repeating characters.

ie. weqwjfd --> 4  (because wjfd is 4 chars)

Problem Analysis

  1. String/Array
  2. Find elastic string within substring
  3. Though they asked to find the substring in examples they gave, they had the length of the largest substring
  4. So, we need to return the length

Thinking about solution

  1. We have a string we are going to need to scan it
  2. Largest --> elastic find the boundaries of the string
  3. Elastic + Array/String --> Sliding-Window == TwoPointers
  4. But Sliding-Window

class Solution {
    public int lengthOfLongestSubstring(String s) {
        int l = 0;
        int result = 0;
        Set<Character> set = new HashSet<>();
        // We start with right pointer from 0, both left and right are at 0!.
        for (int r = 0; r < s.length(); r++) {
            // As long as we have duplicates move left first. Trick! at first 0,0 no duplicates!
            while (set.contains(s.charAt(r))) {
                set.remove(s.charAt(l)); // Note we remove what left points to! until we remove all duplicates with left.
                l++;
            }
            // Now add current different r into the set.
            set.add(s.charAt(r));
            // Trick! Note that when r = l = 0 then s is also empty and we would put in result 0 - 0 + 1 !
            result = Math.max(result, r - l + 1);
        }
        return result;
    }
}

The big question
  1. The big question in this solution is when to extend the right pointer and when to extend the left
  2. We basically always want to extend the right pointer
    1. But if we are in a situation where we cannot extend the right pointer, we wont
    2. i.e., if such a situation is that the character pointed by right pointer is already in the current string, we examine
    3. We can know this by using a set
  3. Our set will hold each character currently encountered by right
  4. If right see that it's currently encountered char is not already in set then do not move right pointer to right
  5. If our current right char is already in set, the left should move to the right
    1. Until when left moves to the right? Until right not already in set
    2. But the left will start moving to the right only when we face a situation where right sees that it already has a char in the set.

Comments

Popular posts from this blog

Dev OnCall Patterns

Introduction Being On-Call is not easy. So does writing software. Being On-Call is not just a magic solution, anyone who has been On-Call can tell you that, it's a stressful, you could be woken up at the middle of the night, and be undress stress, there are way's to mitigate that. White having software developers as On-Calls has its benefits, in order to preserve the benefits you should take special measurements in order to mitigate the stress and lack of sleep missing work-life balance that comes along with it. Many software developers can tell you that even if they were not being contacted the thought of being available 24/7 had its toll on them. But on the contrary a software developer who is an On-Call's gains many insights into troubleshooting, responsibility and deeper understanding of the code that he and his peers wrote. Being an On-Call all has become a natural part of software development. Please note I do not call software development software engineering b

SQL Window functions (OVER, PARTITION_BY, ...)

Introduction When you run an SQL Query you select rows, but what if you want to have a summary per multiple rows, for example you want to get the top basketball for each country, in this case we don't only group by country, but we want also to get the top player for each of the country.  This means we want to group by country and then select the first player.  In standard SQL we do this with joining with same table, but we could also use partition by and windowing functions. For each row the window function is computed across the rows that fall into the same partition as the current row.  Window functions are permitted only in the  SELECT  list and the  ORDER BY  clause of the query They are forbidden elsewhere, such as in  GROUP BY ,  HAVING  and  WHERE  clauses. This is because they logically execute after the processing of those clauses Over, Partition By So in order to do a window we need this input: - How do we want to group the data which windows do we want to have? so  def c

Ry's Git Tutorial BOOK Review

Ry's Git Tutorial BOOK Review There are many good books about git but  Ry's Git Tutorial stands out as an amazing git tutorial book  I will describe below why: http://amzn.to/2pwEuFJ I want to stress out although I'm going to list below what this books talks about that is not the reason you should read this book.   The reason you should read this book is that it's crystal clear about git! it's just an amazing book, it's fun to read, and I truly get to understand git. It very clear, Ry's manages to bring us closer to git by making things really clear. Ry's makes an outstanding effort to bring us from knowing nothing about git to being an expert. The book starts with the real basics like Initializing the repository on an example website, staging files, exploring the repository. Then he moves on to  undoing changes  and he scans various ways you can undo your changes: viewing old revisions, tagging release, undo commit stages etc. Branches