← Paytm questions

Distinct Array Modification and Vowel Longest Common Subsequence

Filed under Paytm

Part 1: Modify an array to make all elements distinct with minimal sum increase, where each replacement must be greater than the previous element. Part 2: Find the longest common subsequence of two…

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 Paytm questions

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