allen digital logo
Allen Digital· Frontend Developer

Allen Digital Machine Coding Round | Frontend Developer | Bangalore

Location
Bangalore
Posted
6 Jul 2023
312 reads

Summary

I recently interviewed with Allen Digital for a Frontend Developer role, completing two machine coding rounds and a culture-fit interview. I successfully solved two DSA problems, 3 Sum and Merge Intervals, during the first machine coding round despite some in-interview confusion regarding the latter's solution.

How it went

I recently had my interview experience with Allen Digital for a Frontend Developer position. The process consisted of three rounds: two machine coding rounds and a final culture-fit/managerial round.

The initial machine coding round focused on Data Structures and Algorithms. I was presented with two specific problems: 3 Sum and Merge Intervals. I implemented the 3 Sum problem using the two-pointers method. Although I hadn't encountered the Merge Intervals problem before, I managed to solve it during the interview.

I faced a slight challenge with the Merge Intervals problem when I tried to trace my solution, especially the 'else' part, on the same document I was coding on, but the interviewer prevented me from doing so. This initially confused me, but the interviewer continued to test my code with various edge cases. Fortunately, my solution proved robust and worked correctly for all test cases. I decided to share this experience since there weren't any existing posts about Allen Digital's interview process.

Questions asked (2)

  1. 01

    3 Sum

    Data Structures & Algorithms · Medium

    Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. Notice that the solution set must not contain duplicate triplets.

    Open the problem
  2. 02

    Merge Intervals

    Data Structures & Algorithms · Medium

    Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input.

    Open the problem

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Allen Digital recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!