2d ago · 2 min read · Given two strings str1 and str2, return the shortest string that has both str1 and str2 as subsequences. If there are multiple valid strings, return any of them. A string s is a subsequence of string
Join discussion
2d ago · 6 min read · Introduction When solving array or string problems in Data Structures and Algorithms, you often need to examine contiguous parts — subarrays or substrings. A beginner solution uses nested loops to che
Join discussion
3d ago · 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
