โ† Walmart questions

Minimum matching substring length and jumps with max k steps

Filed under Walmart

Find the minimum length of matching substrings between two strings using a hashmap, and find the minimum number of jumps to reach the end with a maximum of k jumps allowed at a time.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Walmart questions

Collected from public candidate posts and coding forums. Updated Nov 2026.