Eshopbox Ecommerce HR Specialist 2 Interview Questions and Answers for Freshers

BE Assignment containing how to make a simple backend task

A Google Form-based Aptitude Test with Basic Questions

Q1. Asked Basic Time Complexity and DSA Questions like Time Complexity Of quick sort use of stack Data Structure etc
Add your answer

It was the final round asked to do a medium-level coding Question to convert a number such as 244 to word i.e Two Hundred and Forty four

Q1. Why do you want to join Eazydiner?
Add your answer
Q2. Tell me the name of 5 restaurant chains.
Ans. 
Popular restaurant chains include McDonald's, Starbucks, Subway, Taco Bell, and Chick-fil-A.
• McDonald's

• Starbucks

• Subway

• Taco Bell

• Chick-fil-A
Answered by AI
Add your answer

Aptitude test was simple.

Q1. Asked 2 questions from recursion.
Add your answer

Q1. Simple HR round.
Add your answer

Question from Array,DP

Q1. Resume based only
Add your answer
Q2. Data structure and algorithms
Add your answer
Q3. Object oriented programmings
Add your answer

Q1. Behavioural questions
Add your answer

50 questions in 12 minutes mostly test your arthimetic, logical knowledge.

3 coding questions in 90 mins, 1st one is from arrays an easy question, 2nd one is related to stacks and queues relatively harder and last one is hard which i am also unable to attempt. I cracked the first two questions and my solutions passed all the test cases.

Q1. Difference between sorting algorithms
Ans. 
Sorting algorithms are methods used to arrange elements in a specific order.
• Different sorting algorithms include bubble sort, selection sort, insertion sort, merge sort, quick sort, and heap sort.

• Some algorithms are more efficient than others depending on the size of the data set and the initial order of the elements.

• For example, quick sort is generally faster than bubble sort for large data sets.
Answered by AI
View 1 more answer
Q2. BFS and DFS in trees and imlementing them
Ans. 
BFS and DFS are traversal algorithms used in trees. BFS explores level by level, while DFS explores depth first.
• BFS (Breadth-First Search) visits nodes level by level, using a queue. Example: traversing a binary tree level by level.

• DFS (Depth-First Search) explores as far as possible along each branch before backtracking. Example: in-order traversal of a binary tree.
Answered by AI
Add your answer
Q3. Sql questions and database questions
Add your answer

Q1. Tell me about yourself
Add your answer
Q2. Explain the college life
Add your answer

Q1. Basic resume based questions
Add your answer
Q2. Explain your internship experience
Add your answer

Q1. Basic resume based questions
Add your answer

NEED TO QUALIFY IN THIS TEST

NEED TO QUALIFY THIS TEST ALSO

Q1. SOME DSA AND ROLE BASED QUATIONS.
Add your answer