i
Box8
Filter interviews by
I applied via campus placement at Malviya National Institute of Technology (NIT), Jaipur and was interviewed in Apr 2024. There was 1 interview round.
3 coding questions, 1.5 hr
Top trending discussions
I was interviewed in Jan 2021.
Round duration - 90 minutes
Round difficulty - Hard
Timing was 11 am. Platform was quite well.
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...
Approach: We can start the traversal of the paths from the rat’s starting position, i.e. (0,0) keeping track of the visited cells during the traversal. We will recursively go through all the paths possible until the last index of the grid (destination) is reached, and add the path information using which the rat successfully reached the end.
Algorithm is as follows:
You are given an NxM matrix consisting of '0's and '1's. A '1' signifies that the cell is accessible, whereas a '0' indicates that the cell is blocked. Your task is to compute ...
Maintain a visited array and try to explore all the possibilities with the help of backtracking.
Tip 1 : Practice data structure based questions.
Tip 2 : OOPS is very important.
Tip 3 : Prepare OS and DBMS for mcq.:
Tip 1 : Have some projects on resume.
Tip 2 : Keep it short.
posted on 21 Jul 2024
Models in Laravel are used to interact with the database and represent data.
Models in Laravel are used to perform database operations such as retrieving, inserting, updating, and deleting data.
Models help in organizing and structuring the data in the application.
Models in Laravel follow the MVC (Model-View-Controller) pattern.
Example: Creating a User model in Laravel to interact with the users table in the database.
SQL joins are used to combine rows from two or more tables based on a related column between them.
Types of joins include INNER JOIN, LEFT JOIN, RIGHT JOIN, and FULL JOIN.
INNER JOIN returns rows when there is at least one match in both tables.
LEFT JOIN returns all rows from the left table and the matched rows from the right table.
RIGHT JOIN returns all rows from the right table and the matched rows from the left table.
F...
Coding question based on Linked List Arrays
Software development lifecycle is a process of planning, designing, developing, testing, deploying, and maintaining software.
It involves various stages such as planning, analysis, design, implementation, testing, deployment, and maintenance.
Each stage has its own set of activities and deliverables.
It helps in ensuring that the software is developed efficiently and meets the requirements of the stakeholders.
It also help...
App security is crucial for deployment in Play Store. Follow best practices to ensure secure deployment.
Use HTTPS for all network communication
Implement secure authentication and authorization mechanisms
Regularly update and patch the app to fix security vulnerabilities
Use code obfuscation and encryption to protect against reverse engineering
Conduct regular security audits and penetration testing
Follow Google Play Store
I applied via Naukri.com and was interviewed in May 2022. There were 3 interview rounds.
Math Reasoning, Probability, Graph and pie charts, Indices, Trignometry, Geometry
Verbal communication and english speaking, grammer,
I was interviewed in Dec 2020.
Round duration - 90 minutes
Round difficulty - Easy
Given a directed graph, you need to determine whether or not the graph contains a cycle.
Your function should return true
if there is at least one cycle in the graph; ...
I used DFS from every unvisited node. There is a cycle in a graph only if there is a back edge present in the graph.
To find the back edge to any of its ancestor keep a visited array and if there is a back edge to any visited node then there is a loop and return true.
Given a permutation of ‘N’ integers, rearrange them to generate the lexicographically next greater permutation. A sequence is a permutation if it contains all integers f...
Traverse from right and find the first item that is not following the descending order.
Swap the found character with closest greater (or smallest greater) element on right side of it.
After swapping, sort the string after the position of character found.
Round duration - 60 minutes
Round difficulty - Easy
Given a binary tree with N
nodes, determine whether the tree is a Binary Search Tree (BST). If it is a BST, return true
; otherwise, return false
.
A binary search tree (BST)...
I gave him two three approaches.
Brute force
using utility class
using in-order traversal:
Tip 1 : Prepare Data Structures
Tip 2 : Solve atleast 300-400 problems
Tip 3 : Prepare computer science subjects for solving MCQ's
Tip 1 : Projects around oops would be great
Tip 2 : Be confident about everything you write
posted on 5 Apr 2024
I applied via Recruitment Consulltant and was interviewed before Apr 2023. There were 2 interview rounds.
I applied via campus placement at Bhagwan Parshuram Institute of Technology, Delhi and was interviewed in Jun 2022. There were 3 interview rounds.
Hard difficulty level DSA test, main emphasis on trees and graphs
I was interviewed in Nov 2020.
Round duration - 90 minutes
Round difficulty - Medium
The test was scheduled at 2:30 PM, IST. The test was conducted online, due to the ongoing pandemic situation. Webcam was required to be switched on during the complete duration of the test. I had solved 2/2 coding questions with all test cases successfully passing. Out of the 10 MCQ questions, I had done 6. Around 90 students sat for the online coding round, 19 were shortlisted for the interview. Those who had solved both coding questions were called for interview.
Prateek is a kindergarten teacher with a mission to distribute candies to students based on their performance. Each student must get at least one candy, and if two s...
Ninja Yuki wants to purchase ninja blades at the Spring Fair in his village. Initially, he has 0 blades, and his goal is to buy 'N' blades. The merchant...
Round duration - 60 minutes
Round difficulty - Medium
This was a pure DSA based round. Two questions were asked in this round. The interviewer was quite good, and helped in between.
Given a string A
consisting of lowercase English letters, determine the first non-repeating character at each point in the stream of characters.
Given a 2-dimensional boolean matrix mat
of size N x M, your task is to modify the matrix such that if any element is 1, set its entire row and column to 1. Specifi...
Round duration - 75 minutes
Round difficulty - Medium
This round was also again focused on DSA. Two interviewers were present. This round was very extensive and everything was asked in depth as well as they asked to write the codes as well for all the questions. I was also asked to explain my projects, they were based on ML. Many aspects of OOPs, POP, memory allocation was asked as well.
Given an array ARR
of size N
, determine the maximum sum of i * ARR[i]
possible through any number of rotations. Both left and right rotations are allowed, and can...
Given an arbitrary binary tree consisting of 'N' nodes numbered from 1 to 'N'. Each node is associated with a positive integer value. Your task is to ca...
Tip 1 : Primary skill to be developed is problem solving, i.e proficient in data structures and algorithms.
Tip 2 : After this, practice competitive programming, start giving contests, this will make you faster.
Tip 3 : Then take any technology, e.g., machine learning, web development etc., make few but good projects using these technologies.
Tip 1 : Make it short, 1-2 pages max. Only mention those projects that you know the best.
Tip 2 : While mentioning projects, do mention numbers in them, like what was the accuracy(in case of ML projects).
based on 1 interview
Interview experience
Operations Manager
134
salaries
| ₹2.8 L/yr - ₹9 L/yr |
Store Manager
72
salaries
| ₹1.5 L/yr - ₹4.2 L/yr |
Senior Operations Manager
53
salaries
| ₹3.6 L/yr - ₹9.2 L/yr |
Junior Operations Manager
27
salaries
| ₹2 L/yr - ₹4.5 L/yr |
Business Analyst
22
salaries
| ₹7 L/yr - ₹17 L/yr |
Faasos Food Services
InnerChef
EAT.
Swiggy