EroNkan Software Developer Intern Interview Questions and Answers

3 question of basic and 3 mcq

Strings,Sort 0 1 2,invert binary tree

Q1. Project Basics and Technical skills
Add your answer
Q2. Your Daily routine
Ans. 
My daily routine involves coding, debugging, attending meetings, and learning new technologies.
• Start the day by checking emails and prioritizing tasks

• Code and debug new features or fix existing issues

• Attend team meetings to discuss progress and roadblocks

• Spend time learning new technologies or improving coding skills

• Collaborate with team members on projects
Answered by AI
Add your answer

Q1. It was based on dynamic programming
Add your answer

2 questions on Hackerearth leetcode medium to hard level

Q1. 2 Technical Interview First round they asked 2 easy questions one of map and other of stack second round they asked LRU Cache and Kadane's algorithm
Add your answer

Round duration - 24 hours
Round difficulty - Medium

Q1. Assignment
There is an event and different types of prizes available at the event. How to send them to the end user or what will the required fields and links. There were some functionalities that were to b...read more
Ans. 
Tip 1 : Think more from a scalability perspective. What if there are different types of prizes available at the event. Then How will these prizes get dispatched from the inventory? Take an eg. of Car. If there is a car in an event, then how will the CAR dispatched from the showroom and will deliver to the winner?
Tip 2 : How will you design the database so that new features get added without much modifying the existing ...read more
Answered by CodingNinjas
Add your answer

Round duration - 120 Minutes
Round difficulty - Medium

It was a Data Structures and Algorithm Round and Discussion on My assignment round to check my Problem Solving Skills.
And the Interviewer was very friendly to me. I first introduced myself to the interviewer and what did I have done in past as a Software Engineer and Why I want to work in Grofers.
 

Q1. Top View Of The Tree
You are given a Binary Tree of integers. You are supposed to return the top view of the given binary tree. The Top view of the binary tree is the set of nodes that are visible when we ...read more
Ans. Using Pre-Order Traversal
As we know that all three traversals, i.e. pre-order, in-order and post-order, visit the tree node at once. We can use any of them. Here we are going to use pre-order traversal for the explanation. So while traversing in the pre-order traversal, we will keep track of horizontal distance of the node which is going to be visited from the root node, and we also keep track of the vertical level of ...read more
Answered by CodingNinjas
View 2 more amswers
Q2. Maximum Possible Time
Given an array/list ‘ARR’ having 4 integer digits only. The task is to return the maximum 24 hour time that can be formed using the digits from the array.
Note:
The minimum time in...read more
Ans. Maximum Possible Time
Approach:
• The basic idea is that we will iterate over all the permutations of the 4 digits and check whether we are able to form a valid 24 Hr format time. If so we will then also find the maximum possible time.
• Here we will use the ‘NEXT_PERMUTATION’ method to find all the permutations.
 
Algorithm:
• There are two conditions for valid 24 Hr format time:
  • The first two digits i.e the hour should be le...read more
Answered by CodingNinjas
Add your answer
Q3. Technical Questions
Then we have a small discussion on my projects and Past internship experience. He asks some questions related to my projects and what difficulty I faced while doing my project and How di...read more
Add your answer

Round duration - 180 Minutes
Round difficulty - Easy

There were 3 coding questions.
1 easy
1 medium
1 hard

Q1. Flip Bit to Win
Ninjas are often known for their stealth execution and accuracy to get the job done right. While honing their art of moving through dense forests stealthily, they need the maximum number of...read more
Ans. Brute Force Approach
Approach: The idea is to count a number of ones on both sides of each zero. The required index is the index of zero having a maximum number of ones around it. Following variables are used in implementation:
 
Steps:
1. First, count the total number of zeros and ones present in the binary representation of the number ‘N’.
   • If the total number of zeros is 0 then the longest consecutive number of ones pre...read more
Answered by CodingNinjas
View 1 more amswer
Q2. PostFix To Prefix
Ninja has been given a Postfix expression and he needs your help in converting it to Prefix expression.
Postfix expression is an expression where the operator appears in the expression ...read more
Ans. Greedy Approach
Here, to convert from postfix to prefix, we can simply use stack data structure. We will be following two conditions as follow:
• If we encounter an operand, then we will push it into the stack
• If we encounter an operator, then we can pop 2 elements from the stack, create a new string in prefix format and push it back to the stack
This process should repeat till the end of prefix expression.
 
Algorithm:
&n...read more
Answered by CodingNinjas
Add your answer
Q3. Saving Money
Ninja likes to travel a lot, but at the same time, he wants to save as much money as possible. There are ‘N’ Stations connected by ‘M’ Trains. Each train that he boards starts from station ‘A’...read more
Ans. Dynamic Programming
We can see that for a node, we are finding the ticket price from that node to the destination multiple times, in order to avoid repeated calculations, we store the result in our ‘dp’ matrix.
 
Algorithm:
1. Create a 2D matrix ‘dp’ with K+2 rows and N columns, where dp[i][j] will represent the cheapest price to reach station ‘j’ with maximum ‘i’ stops.
2. Initialise ‘dp’ with an infinite value(INT_MAX).
3. Upd...read more
Answered by CodingNinjas
View 2 more amswers

Round duration - 45 Minutes
Round difficulty - Medium

2 coding questions were asked
2 medium questions

Q1. Dice Throws
You are given D dice, each having F faces numbered 1 to F, both inclusive. The task is to find the possible number of ways to roll the dice together such that the sum of face-up numbers equal t...read more
Ans. Brute force
1. The idea is to use recursion to reduce the big problem into several small subproblems.
2. We will call a helper function that returns us the number of combinations that sum upto S and store it in a variable say answer.
3. The algorithm for the helper function will be as follows: 
   
   Int helper(D, F, S):
   A. If D as well as S becomes 0, return 1.
   B. If D becomes 0 or S becomes negative, return 0.
   C. Initialise a count v...read more
Answered by CodingNinjas
View 3 more amswers
Q2. Safe Nodes In The Graph
Ninja has been given a matrix/list 'EDGES' denoting 'E' edges of a directed graph having ‘N’ nodes. Ninja starts walking from some node (say ‘START’) in the graph al...read more
Ans. Iterative
The idea behind this approach is we try to find if there is a cycle from the node we start. If we are able to find it, then we will mark that node and remove it, and if we cannot reach it, then after some number of steps, we'll stop.
 
A node will be ultimately safe if all of its outgoing edges to nodes are safe.
We start with the nodes with zero outgoing edges, which are already safe.
We can consider any nod...read more
Answered by CodingNinjas
View 1 more amswer

Round duration - 60 Minutes
Round difficulty - Easy

1 coding question was asked and resume related and 1 Javascript related question.

Q1. Network Delay Time
You have been given a network of ‘N’ nodes from 1 to ‘N’ and ‘M’ edges. For each edge, you are given three values (ui, vi, wi) where “ui” and “vi” denote the nodes and “wi” denotes an in...read more
Ans. Dijkstra's Algorithm based approach.
The basic idea of this approach is to find the shortest path from the source node (‘K’) to each node in the network. We will use Dijkstra’s Algorithm to achieve this task. We will use priority_queue based implementation for this problem.
 
You can refer here for a more detailed explanation of Dijkstra’s Algorithm -
Dijkstra Sparse

 
Now, consider the following steps:
1. Create an ad...read more
Answered by CodingNinjas
Add your answer