Filter interviews by
I appeared for an interview before Apr 2023.
I developed a demo Chat application usign Dagger, Room, and MVVM pattern
Paging in Android is a technique used to load and display large data sets efficiently by loading data in chunks.
Paging library handles loading data in chunks from a data source, typically a database or network.
It uses a PagedListAdapter to display data in a RecyclerView, loading more data as the user scrolls.
Paging library also supports placeholders for loading and error states, improving user experience.
Paging library...
Top trending discussions
I appeared for an interview before Mar 2021.
Round duration - 30 minutes
Round difficulty - Medium
This was a MCQ round. 30 ques in 30 mins consisting of difficult quantitative aptitude questions were to be solved.
Round duration - 60 minutes
Round difficulty - Medium
In this test round, 2 coding questions were given. Either write the code or pseudo code
Given an integer N
, find all possible placements of N
queens on an N x N
chessboard such that no two queens threaten each other.
A queen can attack another queen if they ar...
The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard without threatening each other.
Use backtracking algorithm to explore all possible configurations.
Keep track of rows, columns, and diagonals to ensure queens do not threaten each other.
Generate all valid configurations and print them out.
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
Sort an array of 0s, 1s, and 2s in linear time complexity.
Use three pointers to keep track of 0s, 1s, and 2s while traversing the array.
Swap elements based on the values encountered to sort the array in-place.
Time complexity should be O(N) and space complexity should be O(1).
Round duration - 60 minutes
Round difficulty - Easy
This was a technical round with questions on DSA.
You are given a string of length N
. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...
Reverse words in a string while handling leading, trailing, and multiple spaces.
Split the input string by spaces to get individual words
Reverse the order of the words
Join the reversed words with a single space in between
You are provided with the head of a linked list containing integers. Your task is to determine if the linked list is circular.
Detect if a given linked list is circular by checking if it forms a closed loop.
Traverse the linked list using two pointers, one moving at double the speed of the other.
If the two pointers meet at any point, the linked list is circular.
If the faster pointer reaches the end of the list (NULL), the linked list is not circular.
Round duration - 30 minutes
Round difficulty - Easy
HR round with typical behavioral problems.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I appeared for an interview before Feb 2021.
Round duration - 60 minutes
Round difficulty - Easy
It comprised of general aptitude questions and two coding questions. It was an offline test.
Given an integer N
, find all possible placements of N
queens on an N x N
chessboard such that no two queens threaten each other.
A queen can attack another queen if they ar...
The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard where no two queens threaten each other.
Use backtracking algorithm to explore all possible configurations.
Keep track of rows, columns, and diagonals to ensure queens do not attack each other.
Generate and print valid configurations where queens are placed safely.
Consider constraints and time limit for efficient solution.
Exam...
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
Sort an integer array containing only 0s, 1s, and 2s in linear time complexity.
Use three pointers to keep track of the positions of 0s, 1s, and 2s in the array.
Iterate through the array and swap elements based on the values encountered.
Achieve sorting in a single scan over the array without using any extra space.
Round duration - 60 minutes
Round difficulty - Easy
After having a technical discussion about my CV. He gave me two questions to code.
Ninja has to determine all the distinct substrings of size two that can be formed from a given string 'STR' comprising only lowercase alphabetic characters. These su...
Find all unique contiguous substrings of size two from a given string.
Iterate through the string and extract substrings of size two
Use a set to store unique substrings
Return the set as an array of strings
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next
points back to a previous node in the ...
Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.
Traverse the linked list using two pointers, one moving one step at a time and the other moving two steps at a time.
If the two pointers meet at any point, there is a cycle in the linked list.
If one of the pointers reaches the end of the list (null), there is no cycle.
Round duration - 30 minutes
Round difficulty - Easy
This was supposed to be the HR round but out of surprise the interviewer started by giving me a question to code.
After I approached this question with the right solution he just asked about my family. After that he said to wait. After half an hour the results were announced. A total of three students were hired and I was amongst one of them.
Given an integer N
representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.
Generate all possible combinations of balanced parentheses for a given number of pairs.
Use recursion to generate all possible combinations of balanced parentheses.
Keep track of the number of open and close parentheses used in each combination.
Return the valid combinations as an array of strings.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I applied via Campus Placement and was interviewed in Mar 2024. There were 2 interview rounds.
Aptitude and coding of 2 hours
I appeared for an interview before Jul 2023.
Build a sample app server using express.js
Install express.js using npm
Create a new express app
Set up routes and middleware
Start the server to listen on a specific port
I use JDBC (Java Database Connectivity) to establish connection with the database in my project.
Use JDBC API to connect to the database
Load the JDBC driver
Create a connection object
Create a statement object
Execute SQL queries
Multer is a middleware for handling multipart/form-data, used for file uploads in Node.js.
Install multer package using npm: npm install multer
Require multer in your Node.js file: const multer = require('multer')
Set up multer middleware with desired options: const upload = multer({ dest: 'uploads/' })
Use the upload middleware in your route handler to process file uploads
I applied via Campus Placement and was interviewed in Apr 2023. There were 4 interview rounds.
It was an 1hr interview session
Count the occurrence of each element in an array of strings
Iterate through the array and use a hashmap to store the count of each element
If element already exists in the hashmap, increment its count by 1
Return the hashmap with element counts
I appeared for an interview in Jul 2024.
2 Graph question of leetcode
I applied via Campus Placement and was interviewed in Nov 2024. There were 2 interview rounds.
Easy 1 hr test and can be completed easily
I applied via Campus Placement
Coding test was really good it was easier to tackle the problem and writting code for it.
Developed a web-based project management tool for tracking tasks and deadlines.
Used React.js for front-end development
Implemented RESTful APIs using Node.js and Express
Utilized MongoDB for database storage
Incorporated authentication and authorization features for user security
I applied via Campus Placement and was interviewed before Sep 2023. There were 3 interview rounds.
Basic aptitude questions
3 basic questions they asked
Pointer and SQL related questions
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Center Manager
8
salaries
| ₹5 L/yr - ₹11 L/yr |
Executive Accountant
6
salaries
| ₹3.6 L/yr - ₹3.8 L/yr |
Technical Support Engineer
5
salaries
| ₹2.6 L/yr - ₹3.2 L/yr |
Maintenance Manager
5
salaries
| ₹2.7 L/yr - ₹4.2 L/yr |
Motion Graphics Designer and Video Editor
4
salaries
| ₹3.1 L/yr - ₹4.2 L/yr |
AstraZeneca
NIIT
Edubridge Learning
MagicBricks