Filter interviews by
I appeared for an interview in Jan 2025.
3 coding test range from easy to hard.
Joins are used in databases to combine rows from two or more tables based on a related column between them.
Joins are used to retrieve data from multiple tables based on a related column.
Common 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 ta...
JavaScript is a scripting language used for web development, while Node.js is a runtime environment that allows JavaScript to run on the server side.
JavaScript is a client-side scripting language used for creating interactive web pages.
Node.js is a runtime environment that allows JavaScript to run on the server side.
Node.js uses the V8 JavaScript engine from Google Chrome to execute code.
Node.js provides a set of built...
Developed an e-commerce website project
Used MySQL database to store product information, customer details, and orders
Implemented user authentication and authorization for secure login and access control
Designed a user-friendly interface for browsing products, adding items to cart, and checking out
Included features like search functionality, product categories, and payment gateway integration
I applied via Campus Placement and was interviewed in Jun 2024. There were 5 interview rounds.
There were 3 questions:
1. Given a string check if it is possible to rearrange the elements of the string to form a palindrome. [Check GFG for the question]
2. Given an integer n, print n rows of following pattern.
Example :
n = 7
* * * * * * *
* *
* * * * *
* * * *
* * * * *
* *
* * * * * * *
3. Cut the sticks [Check hacker rank for the question desc.]
Total duration 90 mins.
I was directly shortlisted for PI. Hence did not sit for this round but I am aware that there were 2 DSA questions in 40 mins. One was pattern and other was is Anagram question on leetcode valid anagram question.
I am a passionate software developer with experience in Java, Python, and web development.
Experienced in Java and Python programming languages
Proficient in web development technologies like HTML, CSS, and JavaScript
Completed multiple projects showcasing my skills
I prefer working in a team as it allows for collaboration, diverse perspectives, and shared responsibilities.
Collaboration with team members leads to better problem-solving and innovation
Diverse perspectives can lead to more creative solutions
Shared responsibilities help distribute workload and prevent burnout
Developed a web application for tracking personal fitness goals and progress
Used HTML, CSS, and JavaScript for front-end development
Implemented a RESTful API using Node.js and Express for back-end functionality
Utilized MongoDB for database management
Incorporated chart.js for visualizing progress data
I applied via Campus Placement and was interviewed in Aug 2024. There were 2 interview rounds.
It was a DSA round which consisted of three questions.
1)longest substring without repeating characters
2)largest subarray with sum 0
3)String based question
The largest area of a histogram is the maximum area that can be enclosed by a rectangle within the histogram bars.
Calculate the largest area of a histogram by finding the maximum area of rectangles that can be formed within the histogram bars.
This can be done by iterating through each bar and calculating the area of rectangles that can be formed with that bar as the height.
Keep track of the maximum area found so far an...
Find the string with minimum length in an array of strings.
Iterate through the array and keep track of the minimum length string
Return the string with the minimum length
Top trending discussions
posted on 16 Sep 2021
I appeared for an interview in Dec 2020.
Round duration - 40 minutes
Round difficulty - Medium
Round started with introduce yourself then they provide me link and tell me to share my screen then gave me a problem statement and asked me give approach and solve the question
and after i coded that question then he asked me write one sql query for finding second highest salary, then started asking technical question on DBMS, OS , Data Structure and after that some question based on my project and technologies which i mentioned in my resume.
Given an array Arr
consisting of N integers, your task is to find the equilibrium index of the array.
An index is considered as an equilibrium index if the sum of elem...
Find the equilibrium index of an array where sum of elements on left equals sum on right.
Iterate through array to calculate prefix and suffix sums
Compare prefix and suffix sums to find equilibrium index
Return -1 if no equilibrium index is found
Round duration - 30 minutes
Round difficulty - Medium
This time interviewer asked tell me about yourself and then cross questions on my projects. I answered all the questions and he seems satisfied. Then he asked me to share screen and provide me a problem statement and after reading i came to know that it is spiral matrix problem so i started coding and then he asked me 2 to 3 puzzles.
You are given a N x M
matrix of integers. Your task is to return the spiral path of the matrix elements.
The first line contains an integer 'T' which denotes the nu...
The task is to return the spiral path of elements in a given matrix.
Iterate through the matrix in a spiral path by adjusting the boundaries of rows and columns.
Keep track of the direction of traversal (right, down, left, up) to form the spiral path.
Handle edge cases like when the matrix is a single row or column.
Implement a function that takes the matrix dimensions and elements as input and returns the spiral path.
Round duration - 30 minutes
Round difficulty - Medium
This rounded started with one more coding question after that one puzzle like you have 10 balls and 5 lines you have to arrange ball in the lines in a manner that each line have 4 balls. After that they asked Hr questions like, Why MAQ , what is different in MAQ then other top MNCs , Why we should hire you etc.
Mr. X plans to explore Ninja Land, which consists of N
cities numbered from 1 to N
and M
bidirectional roads connecting these cities. Mr. X needs to select a city as ...
The task is to determine the minimum time required to visit all cities and roads in Ninja Land.
Create a graph representation of the cities and roads.
Use a traversal algorithm to find the minimum time to visit all cities and roads.
Return -1 if it is impossible to visit all roads.
Consider the constraints provided in the problem statement.
Implement the function to calculate the minimum travel time.
Tip 1 : Practice coding questions from geeksforgeeks it will help you.
Tip 2 : Learn concepts so well like OS, DBMS, Sql Query.
Tip 3 : Prepare your resume so well, highlight projects, achievements and skills
Tip 1 : Should have some good projects in your resume and mention if you have done coding in any platform
Tip 2 : Have knowledge about technologies related to ML or Data Analytics or Azure.
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 applied via Naukri.com and was interviewed in Oct 2020. There was 1 interview round.
I applied via Naukri.com and was interviewed before Sep 2020. There were 3 interview rounds.
based on 3 interviews
1 Interview rounds
Associate Software Engineer
203
salaries
| ₹5.5 L/yr - ₹19.6 L/yr |
Junior Associate
82
salaries
| ₹3 L/yr - ₹10 L/yr |
Software Engineer
79
salaries
| ₹3.4 L/yr - ₹16 L/yr |
Junior Associate Software Engineer
73
salaries
| ₹3.7 L/yr - ₹12.1 L/yr |
Software Developer
45
salaries
| ₹4 L/yr - ₹16.6 L/yr |
Tekwissen
Softenger
XcelServ Solutions
Damco Solutions