← Informatica questions

Coding test with subarray and substring problems

Filed under Informatica

Solve four algorithmic problems: 1) Maximum subarray sum (Kadane's), 2) Count substrings divisible by 11, 3) Find subset with minimum elements summing to K, 4) Maximum non-continuous sum (House…

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

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