Skip to content
Related Articles

Related Articles

Dunzo Interview – Senior Software Engineer

View Discussion
Improve Article
Save Article
Like Article
  • Difficulty Level : Medium
  • Last Updated : 17 Sep, 2018

Round 1: Hacker Rank

    1. Given an array, arr, we want it to make it unique by incrementing any duplicate elements in arr such that the sum of arr unique’s elements is minimal. In other words, if two or more elements in arr are not unique, we must increase the value of the duplicate element(s) to some other number(s) such that arr consists of unique elements that sum to a number that is as small as possible. e.g – if arr = [3, 2, 1, 2, 7], then arr unique = [3, 2, 1, 4, 7] and its elements sum to a minimal value of 3 + 2 + 1 + 4 + 7 = 17
    2. Total no of increments required on each digit of an element of an array to make it equal to another array. e.g – A total of 5 increments will be needed to convert arr1 = [134, 245] into arr2 = [254, 345].

Round 2:

  1. Project discussion.
  2. Maximum of all subarrays of size k.

Round 3:

  1. Project discussion.
  2. For a given integer N. Write all unique solutions for a^3+b^3 = c^3 + d^3, where a, b, c, d lie between [1, N].

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!