Skip to main content

LeetCode 3| Longest Substring Without Repeating Characters | Medium


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.
            // Now add current different r into the set.
            // 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.


Popular posts from this blog

Functional Programming in Scala for Working Class OOP Java Programmers - Part 1

Introduction Have you ever been to a scala conf and told yourself "I have no idea what this guy talks about?" did you look nervously around and see all people smiling saying "yeah that's obvious " only to get you even more nervous? . If so this post is for you, otherwise just skip it, you already know fp in scala ;) This post is optimistic, although I'm going to say functional programming in scala is not easy, our target is to understand it, so bare with me. Let's face the truth functional programmin in scala is difficult if is difficult if you are just another working class programmer coming mainly from java background. If you came from haskell background then hell it's easy. If you come from heavy math background then hell yes it's easy. But if you are a standard working class java backend engineer with previous OOP design background then hell yeah it's difficult. Scala and Design Patterns An interesting point of view on scala, is

Alternatives to Using UUIDs

  Alternatives to Using UUIDs UUIDs are valuable for several reasons: Global Uniqueness : UUIDs are designed to be globally unique across systems, ensuring that no two identifiers collide unintentionally. This property is crucial for distributed systems, databases, and scenarios where data needs to be uniquely identified regardless of location or time. Standardization : UUIDs adhere to well-defined formats (such as UUIDv4) and are widely supported by various programming languages and platforms. This consistency simplifies interoperability and data exchange. High Collision Resistance : The probability of generating duplicate UUIDs is extremely low due to the combination of timestamp, random bits, and other factors. This collision resistance is essential for avoiding data corruption. However, there are situations where UUIDs may not be the optimal choice: Length and Readability : UUIDs are lengthy (typically 36 characters in their canonical form) and may not be human-readable. In URLs,

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