Filter interviews by
I applied via Campus Placement and was interviewed in Aug 2022. There were 3 interview rounds.
They ask coding and apptitude MCQs
Code to print palindrome numbers from 1 to 100
Loop through numbers 1 to 100
Convert each number to string and check if it's equal to its reverse
If yes, print the number
Top trending discussions
posted on 12 Jun 2024
I applied via Referral and was interviewed in May 2024. There was 1 interview round.
My hobby is playing guitar and I have managed to learn and play various songs over the years.
I have been playing guitar for 5 years
I have learned to play both acoustic and electric guitar
I can play songs by artists like Ed Sheeran, John Mayer, and Taylor Swift
Basic questions were there
posted on 17 May 2021
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.
posted on 10 Nov 2015
I appeared for an interview before Oct 2020.
Round duration - 40 minutes
Round difficulty - Medium
Asked about time complexity of algorithm, puzzles, DBMS, cutting edge technologies etc. What are indexes?
Given an array of integers ARR
of size N, consisting of 0s and 1s, you need to select a sub-array and flip its bits. Your task is to return the maximum count of 1s that can b...
Given an array of 0s and 1s, find the maximum count of 1s by flipping a sub-array at most once.
Iterate through the array and keep track of the maximum count of 1s obtained by flipping a sub-array.
Consider flipping a sub-array from index i to j and calculate the count of 1s in the resulting array.
Return the maximum count of 1s obtained by flipping a sub-array at most once.
Round duration - 20 minutes
Round difficulty - Medium
Asked 1 standard algorithm
You are provided with a 2-dimensional matrix having N
rows and M
columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...
Count the number of islands in a 2D matrix of 1s and 0s.
Iterate through the matrix and perform depth-first search (DFS) to find connected 1s.
Mark visited cells to avoid redundant traversal.
Increment island count whenever a new island is encountered.
Tip 1 : prepare for competitive programming
Tip 2 : know about standard algorithm
Tip 3 : must be good with dbms
Tip 1 : must have projects, which you can explain to them
Tip 2 : have things on resume, that you are totally certain about.
posted on 3 Mar 2024
Abstraction is the concept of hiding complex details and showing only the essential features of an object or system.
Abstraction allows us to focus on what an object does instead of how it does it
It helps in reducing complexity and improving efficiency
Examples include abstract classes and interfaces in object-oriented programming
Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity.
Normalization involves breaking down data into smaller, more manageable tables
It helps in reducing data redundancy by eliminating duplicate data
Normalization ensures data integrity by enforcing relationships between tables
There are different levels of normalization such as 1NF, 2NF, 3NF, and BCNF
Normalization is a process used to organize a database in a way that reduces redundancy and dependency.
Normalization helps in reducing data redundancy by breaking up tables into smaller ones.
There are different normal forms like 1NF, 2NF, 3NF, BCNF, and 4NF.
Normalization ensures data integrity and reduces anomalies in the database.
Example: Breaking up a table with customer details into separate tables for customer info
SQL is a relational database management system, while NoSQL is a non-relational database management system.
SQL uses structured query language for querying data, while NoSQL databases use different query languages like MongoDB's query language.
SQL databases are table-based, with a predefined schema, while NoSQL databases are document-based, key-value pairs, graph databases, or wide-column stores.
SQL databases are good f...
based on 1 interview
Interview experience
based on 4 reviews
Rating in categories
Software Developer
419
salaries
| ₹2 L/yr - ₹9 L/yr |
Software Engineer
147
salaries
| ₹1.9 L/yr - ₹9 L/yr |
QA Engineer
125
salaries
| ₹2.2 L/yr - ₹10 L/yr |
Senior Software Developer
55
salaries
| ₹6.8 L/yr - ₹22.8 L/yr |
Senior Software Engineer
38
salaries
| ₹6.3 L/yr - ₹21.7 L/yr |
Tekwissen
Softenger
XcelServ Solutions
Damco Solutions