Filter interviews by
I applied via LinkedIn and was interviewed in Jul 2022. There were 3 interview rounds.
Sudu codes all languages array string if else for loop
Factorial program using class syntax explained with examples.
Factorial is the product of all positive integers up to a given number.
Class syntax is used to define a blueprint for creating objects.
Example: class Factorial { def fact(n): return 1 if n == 0 else n * fact(n-1) }
Example: f = Factorial(); print(f.fact(5)) # Output: 120
Function syntax is the structure and format of a function in a programming language.
Function name followed by parentheses and parameters
Code block enclosed in curly braces
Return statement to output a value
Example: function add(a, b) { return a + b; }
Example: function greet(name) { console.log('Hello, ' + name + '!'); }
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.
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.
I appeared for an interview in Oct 2020.
Round duration - 90 minutes
Round difficulty - Easy
There were two section Aptitude and Coding.
Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' days. You can perform up to two buy-and-sell ...
The task is to determine the maximum profit that can be achieved by performing up to two buy-and-sell transactions on a given set of stock prices.
Iterate through the array of stock prices and calculate the maximum profit that can be achieved by buying and selling at different points.
Keep track of the maximum profit after the first transaction and the maximum profit overall by considering different combinations of buy a...
Round duration - 60 minutes
Round difficulty - Easy
This was the first technical interview.
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Find pairs of elements in an array that sum up to a given value, sorted in a specific order.
Iterate through the array and for each element, check if the complement (S - current element) exists in a hash set.
Keep track of pairs in a hash set to avoid duplicates.
Sort the pairs based on the criteria mentioned in the question.
Return the sorted list of pairs.
Tip 1 : Prepare theory subjects well
Tip 2 : Start doing some development and learn a framework from 2nd year
Tip 1: Mention projects with technologies
Tip 2: Make important words in bold
posted on 19 Sep 2024
I applied via Company Website and was interviewed in Aug 2024. There were 2 interview rounds.
Very basic aptitude questions along with few coding questions
I applied via LinkedIn and was interviewed in Nov 2021. There were 4 interview rounds.
I appeared for an interview in May 2025, where I was asked the following questions.
I am proficient in several programming languages, each suited for different tasks and projects.
JavaScript: Used for web development, creating interactive front-end applications.
Python: Great for data analysis, machine learning, and scripting tasks.
Java: Commonly used for building enterprise-level applications and Android development.
C#: Utilized for developing Windows applications and game development with Unity.
SQL: E...
based on 1 interview experience
Difficulty level
Duration
Software Developer
396
salaries
| ₹2.2 L/yr - ₹7.6 L/yr |
Software Engineer
142
salaries
| ₹3.2 L/yr - ₹8.7 L/yr |
QA Engineer
131
salaries
| ₹2.2 L/yr - ₹9.5 L/yr |
Senior Software Developer
56
salaries
| ₹7.5 L/yr - ₹22.9 L/yr |
Quality Assurance Engineer
40
salaries
| ₹3.2 L/yr - ₹10.7 L/yr |
Tekwissen
Softenger
XcelServ Solutions
Capital Numbers Infotech