EcomExpress interview experience Real time questions & tips from candidates to crack your interview

Software Developer

EcomExpress
upvote
share-icon
3 rounds | 4 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 2 months
Topics: Core Java, Recursion, Linked List, Stack, Queue, OOPS
Tip
Tip

Tip 1 : Prepare core topics from any language (Java, Python, C++). Like Classes, inbuilt methods, Interfaces, and Abstraction.
Tip 2 : For Ecom express you should have some experience in development ( Web development, Mobile app development, or Machine learning)
Tip 3 : Prepare basic data structure like Linked List, and Array and solve at least 100 questions on that.
Tip 4 : You should prepare any one database language like SQL. 
Tip 5 : Prepare core questions on Databases like ACID properties, CRUD operations, and normalization.

Application process
Where: Referral
Eligibility: Computer Science Background
Resume Tip
Resume tip

Tip 1: Mention the skills on which you have worked.
Tip 2: Mention your good two projects at least, and describe them with two-lines maximum.
Tip 3: Do not mention skills for which you don't have full confidence.
Tip 4 : Make only single page resume.

Interview rounds

01
Round
Easy
Video Call
Duration60 minutes
Interview date1 Apr 2022
Coding problem1

First-round was a technical interview. In this round, they asked about core concepts of java and python-like classes, Interfaces, dictionaries, tuples, and lists. The interviewer was very frank and asked me about 30 to 40 questions. He also gave aptitude questions which were very easy on the topic of time and distance. Asked about my projects and what technology I have used to make them. Asked about SQL questions like ACID properties and also gave me a query to join two tables. The overall interview level was easy.

Easy
10m average time
90% success
0/40
Asked in companies
EcomExpressIndus Valley PartnersMAQ Software

You have given two positive integers N and K. Your task is to print a series of numbers i.e subtract K from N until it becomes 0 or negative then add K until it becomes N. You need to do this task without using any loop.

For Example:
For  N = 5 , K = 2 
Series = [ 5, 3, 1, -1, 1, 3, 5]
Problem approach

This was very easy questions. I just saw the questions and start applying the recursion.
The interviewer was very happy

Try solving now
02
Round
Medium
Video Call
Duration60 minutes
Interview date5 Apr 2022
Coding problem2

This round was a little bit on medium level. The interviewer joined the call and gave me a coding question which was on recursion and of medium level. I was not able to solve the question but he was very cool and gave me another question, that was of the array and of easy level, I solved that question.

After that, He asked about my project and asked how I created the database of the project, and what is the flow of my application. Asked to make a class on parking management tools, I solved that also. If you have some project then it is easy for you to crack this round also.

1. Chocolate Problem

Moderate
15m average time
85% success
0/80
Asked in companies
EcomExpressIBMMicrosoft

Given an array/list of integer numbers 'CHOCOLATES' of size 'N', where each value of the array/list represents the number of chocolates in the packet. There are ‘M’ number of students and the task is to distribute the chocolate to their students. Distribute chocolate in such a way that:

1. Each student gets at least one packet of chocolate.

2. The difference between the maximum number of chocolate in a packet and the minimum number of chocolate in a packet given to the students is minimum.

Example :

Given 'N' : 5 (number of packets) and 'M' : 3 (number of students)

subsequence

And chocolates in each packet is : {8, 11, 7, 15, 2}

All possible way to distribute 5 packets of chocolates among 3 students are -

( 8,15, 7 ) difference of maximum-minimum is ‘15 - 7’ = ‘8’
( 8, 15, 2 ) difference of maximum-minimum is ‘15 - 2’ = ‘13’ 
( 8, 15, 11 ) difference of maximum-minimum is ‘15 - 8’ = ‘7’
( 8, 7, 2 ) difference of maximum-minimum is ‘8 - 2’ = ‘6’
( 8, 7, 11 ) difference of maximum-minimum is ‘11 - 7’ = ‘4’
( 8, 2, 11 ) difference of maximum-minimum is ‘11 - 2’ = ‘9’
( 15, 7, 2 ) difference of maximum-minimum is ‘15 - 2’ = 13’
( 15, 7, 11 ) difference of maximum-minimum is ‘15 - 7’ = ‘8’
( 15, 2, 11 ) difference of maximum-minimum is ‘15 - 2’ = ‘13’
( 7, 2, 11 ) difference of maximum-minimum is ‘11 - 2’ = ‘9’

Hence there are 10 possible ways to distribute ‘5’ packets of chocolate among the ‘3’ students and difference of combination (8, 7, 11) is ‘maximum - minimum’ = ‘11 - 7’ = ‘4’ is minimum in all of the above.
Problem approach

I was not able to solve this problem, as I was not confident about recursion that much. But after the interview I tried after watching the solution then I realize the question was easy.

Try solving now

2. First Repeated Character

Moderate
30m average time
70% success
0/80
Asked in companies
EcomExpressDelhiveryAmazon

You are given a string 'STR' of lowercase English alphabets. You need to find the repeated character present first in the string.

Example:
If the string is: “abccba”, then the first repeated character is ‘c’, but the repeated character that is present first in the string is ‘a’. You need to print ‘a’.
Note:
Keep in mind that you need to print the repeated character that is present first in the string and not the first repeating character.
Problem approach

First, I created an array of length 26 and then stored the frequency of each character of the string. After that, I again start a loop and printed the character which occur more than once, and break the loop.

Try solving now
03
Round
Easy
HR Round
Duration20 minutes
Interview date7 Apr 2022
Coding problem1

This was a very easy round and asked about current salary, current role, and expectation of salary.

1. Basic HR Questions

  • Tell me about yourself
  • Why do you want a change?
  • What was your role in the previous company?
  • What is your current CTC?
Problem approach

Tip 1 : Just be yourself, don't fake anything

Tip 2 : Try to be confident

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
8518 views
0 comments
0 upvotes
Analytics Consultant
3 rounds | 10 problems
Interviewed by ZS
907 views
0 comments
0 upvotes
company logo
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
3320 views
0 comments
0 upvotes
company logo
SDE - 2
4 rounds | 6 problems
Interviewed by Expedia Group
2581 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Software Developer
5 rounds | 14 problems
Interviewed by Microsoft
3931 views
1 comments
0 upvotes
company logo
Software Developer
6 rounds | 12 problems
Interviewed by SAP Labs
2806 views
0 comments
0 upvotes
company logo
Software Developer
3 rounds | 3 problems
Interviewed by Amazon
1134 views
0 comments
0 upvotes