Amazon | OA intern | distinct subarrays having at most k odd elements
Anonymous User
3087

Amazon Online assesment SDE internship.

First problem: https://leetcode.com/problems/first-unique-character-in-a-string/
Second problem: Given an array of integers, determine the number of distinct subarrays that can be formed having at most a given number of odd elements. (number of distinct subarrays having at most k odd elements).

Comments (6)