#dsaUnmoderated tag#dsaHottekraze in # dsa • 2 days ago • 2 min readDSA Series Day 11: Longest Repeating Character Replacement in Java, Python and RustHi everyone, I hope you all are doing good. Day 11 of my DSA series is Longest Repeating Character Replacement. Yesterday we met the sliding window, and today we push the same idea one step further. The problem You get a string of uppercase letters and a number k. You can change at most k characters, and you need the length of the longest…tekraze in # dsa • 3 days ago • 2 min readDSA Series Day 10: Longest Substring Without Repeating Characters in Java, Python and RustHi everyone, I hope you all are doing good. Day 10 of my DSA series is Longest Substring Without Repeating Characters. This is where the two pointers from the last few days grow into a new pattern called the sliding window. The problem You get a string and need the length of the longest continuous substring with no repeated characters. It is…tekraze in # dsa • 4 days ago • 2 min readDSA Series Day 9: Container With Most Water in Java, Python and RustHi everyone, I hope you all are doing good. Day 9 of my DSA series is Container With Most Water. The last few days used two pointers on sorted arrays, but here the array is not sorted at all and the pattern still works. The problem Each value in the array is a wall. Pick two walls, and the water they hold is the shorter wall times the…tekraze in # dsa • 5 days ago • 2 min readDSA Series Day 8: 3Sum in Java, Python and RustHi everyone, I hope you all are doing good. Day 8 of my DSA series is 3Sum, one of the most asked interview questions. The nice part is that it is really yesterday's Two Sum II wrapped in a loop, plus one extra skill: skipping duplicates. The problem You get an integer array. Return every unique triplet from three different positions that…tekraze in # dsa • 6 days ago • 2 min readDSA Series Day 7: Two Sum II (Sorted Array) in Java, Python and RustHi everyone, I hope you all are doing good. Day 7 of my DSA series is Two Sum II. It is the same question as Day 1, with one small twist: the array is already sorted. That one detail lets us drop the hash map and use two pointers instead. The problem You get a sorted array and a target. Find two different positions whose values add up to the…tekraze in # dsa • 7 days ago • 2 min readDSA Series Day 6: Valid Palindrome in Java, Python and RustHi everyone, I hope you all are doing good. Day 6 of my DSA series is Valid Palindrome. After five days of hash maps and sets, this one brings in the two pointer pattern, which needs no extra memory at all. The problem You get a string. Lowercase it, drop everything that is not a letter or digit, and check if it reads the same forward and…