Epifi | Software Engineer | Bengaluru | August 2024

epifi logo
epifi
SDE-1 (Golang Developer)bengaluru1 yearsRejected
September 10, 20240 reads

Summary

I recently interviewed at Epifi for an SDE-1 position and unfortunately, I was rejected after the first technical round. My main challenges were the time taken to solve the DSA problem and my difficulty in explaining the solution's dry run confidently.

Full Experience

I applied for the SDE-1 (Golang developer) position at Epifi by mailing my resume to their HR department, and soon after, I received an interview call.

A little about my background: I completed my B.Tech from a Tier 1 NIT and currently work as an SDE1 at a startup, with 14 months of experience.

Round 1: DSA Problem

In this round, I was presented with the problem Minimum Replacements to Sort the Array. I began by attempting a recursive solution, and during that process, I realized a more optimal approach.

While I did manage to complete the problem, it took me over an hour, which was a significant amount of time. When the interviewer asked me to dry run my solution and present the final array state after the modifications, I found myself struggling to explain it clearly and confidently. This difficulty in articulation ultimately contributed to my rejection in this initial round.

Feedback

I received feedback indicating that I was rejected after the first round primarily due to the excessive time I took to solve the problem and my inability to confidently walk through the dry run of my solution and explain it effectively.

Interview Questions (1)

Q1
Minimum Replacements to Sort the Array
Data Structures & Algorithms

Given a 0-indexed integer array nums, you can replace any element nums[i] with two or more elements that sum to nums[i]. For example, if nums[i] = 7, you can replace it with 2 and 5. The goal is to make nums sorted in non-decreasing order using the minimum number of operations.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

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