5d ago · 8 min read · for example: arr1 = [1, 3, 2, 1, 4, 5] arr2 = [3, 2, 2, 1, 1] answer = [3, 2, 1] simple enough right? and if you've done even a little bit of DSA prep your brain immediately goes - HashSet. put all e
Join discussion
Mar 16 · 4 min read · Sliding Window Technique When solving array or string problems in competitive programming, we often deal with subarrays or substrings. A naive solution usually checks every possible subarray, which le
Join discussion
