Zepto Software Developer Intern Interview Questions and Answers

Easy to medium level of leet code

Q1. 1. Fibonacci series with recursion and without recursion 2. String Palindrome 3. Count all repeated numbers from the array
Ans. 
Answering questions related to Fibonacci series, string palindrome, and counting repeated numbers in an array.
• For Fibonacci series with recursion, write a function that calls itself to calculate the next number in the series.

• For Fibonacci series without recursion, use a loop to calculate the series.

• For string palindrome, compare characters from start and end of the string.

• To count all repeated numbers from the array, u
Answered by AI
View 2 more answers

Q1. 1.Given an array(0-based indexing), you have to find the max sum of i*A[i] where A[i] is the element at index i in the array. The only operation allowed is to rotate(clock-wise or counter clock-wise) the ...read more
Ans. 
Rotate array to find max sum of i*A[i]
• Rotate array to bring maximum element to front

• Calculate sum of i*A[i] for each rotation

• Keep track of maximum sum found
Answered by AI
Add your answer

Q1. 1.Oops concepts 2.Oops code 2.About Java Spring 3. Array stack questions 4.Project discussion
Add your answer

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

Round duration - 90 mintues
Round difficulty - Easy

Nice environment everything went good.

Q1. 
Sum of LCM Problem Statement
Given an integer 'N', calculate and print the sum of the least common multiples (LCM) for each integer from 1 to N with N.
The sum is represented as:
LCM(1, N) + LCM(2, N) + ....read more
Ans. Brute force approach
 
Using the mathematical formula, A*B = LCM(A,B) * GCD(A,B) where ‘A’ and ‘B’ are the two integers, and GCD(A,B) denotes the Greatest common divisor of ‘A’ and ‘B’.
For example, suppose 
 
A = 20 and B = 30
Factors of A = {1,2,4,5,10,20}
Factors of B = {1,2,3,5,6,10,15,30}
 
The greatest common factor is 10, hence GCD(20,30) = 10.
 
So LCM(A,B) = A*B / GCD(A,B)
 
All we need to fin...read more
Answered Anonymously
Add your answer
Q2. 
Vertical Order Traversal Problem Statement
Given a binary tree, return the vertical order traversal of the values of the nodes in the tree.
In a vertical order traversal, for each node at position (X, Y)...read more
Ans. Iterative Approach
Our very basic intuition is that while traversing the given binary tree, we need to keep a track of the horizontal distance of all the nodes of the given binary tree with respect to the root node.
 
We initially pass the horizontal distance as 0 for root. For the left subtree, we pass the ‘HD’ as the Horizontal distance of root minus 1. For the right subtree, we pass the ‘HD’ as Horizontal Distance...read more
Answered Anonymously
Add your answer

Round duration - 90 minutes
Round difficulty - Hard

It was a tough round focus on the key concepts

Q1. 
Stack with getMin Operation
Create a stack data structure that supports not only the usual push and pop operations but also getMin(), which retrieves the minimum element, all in O(1) time complexity witho...read more
Ans. Optimal Solution
• You need to make two separate stacks for solving the problem.
• The first stack would have the actual number and the second stack would contain the minimum number present in the current stack.
• Now, when we need to push a number in the stack, we first need to check if the stack is empty or not. If the stack is empty, we simply push the integer in both the stacks. Otherwise, we push the integer in the first s...read more
Answered Anonymously
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 Problem Statement
You are given a task to help ninjas maximize their practice area in a dense forest represented by a sequence of trees (1s) and empty places (0s) in the binary representat...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 Anonymously
Add your answer
Q2. 
Postfix to Prefix Conversion Problem
Ninja has been given a Postfix expression and requires assistance in converting it to a Prefix expression.
A Postfix expression is formatted such that the operator fo...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 Anonymously
Add your answer
Q3. 
Saving Money Problem Statement
Ninja is adventurous and loves traveling while being mindful of his expenses. Given a set of 'N' stations connected by 'M' trains, each train starting from station 'A' and r...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 Anonymously
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

2 coding questions were asked
2 medium questions

Q1. 
Dice Throws Problem Statement
You are given D dice, each having F faces numbered from 1 to F. The task is to determine the number of possible ways to roll all the dice such that the sum of the face-up num...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 Anonymously
Add your answer
Q2. 
Safe Nodes in the Graph
You are provided with a matrix/list called 'EDGES' representing 'E' edges of a directed graph with 'N' nodes. Starting from a node 'START', a character named Ninja walks along a di...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 Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

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

Q1. 
Network Delay Time Problem Statement
Given a network of nodes numbered from 1 to 'N', and 'M' edges. Each edge is represented by three values (u, v, w) where 'u' and 'v' are nodes, and 'w' is an integer r...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 Anonymously
Add your answer