Filter interviews by
I applied via Recruitment Consulltant and was interviewed in Oct 2024. There was 1 interview round.
Seeking new challenges and growth opportunities.
Looking for a new challenge to further develop my skills and experience
Seeking opportunities for career advancement and growth
Wanting to work in a more collaborative and supportive team environment
Shrinkage refers to the reduction in workforce productivity due to factors like breaks, meetings, training, etc.
Shrinkage can include time spent on breaks, meetings, training, and other non-productive activities
It is important for workforce management to account for shrinkage when planning schedules
Examples of shrinkage include lunch breaks, team meetings, and bathroom breaks
No, being a gold digger implies seeking wealth from others, not relevant to a team lead role.
Being a gold digger means seeking wealth or material gain from others
As a team lead, your role is to guide and support your team, not exploit them for personal gain
Focus on building a strong team and achieving team goals, rather than personal enrichment
DHCP stands for Dynamic Host Configuration Protocol, it is a network management protocol used to assign IP addresses automatically to devices on a network.
DHCP server assigns IP addresses to devices on a network
It also provides other network configuration information like subnet mask, default gateway, DNS server
DHCP lease duration determines how long an IP address is valid for a device
DHCP uses a client-server model wh...
The OSI model is a conceptual framework that standardizes the functions of a telecommunication or computing system into seven layers.
The OSI model stands for Open Systems Interconnection model.
It helps in understanding how data is transferred from one computer to another over a network.
Each layer in the OSI model has specific functions and communicates with the adjacent layers.
Examples of layers include physical layer,...
I applied via Referral and was interviewed in Jun 2024. There were 2 interview rounds.
Multiple Choice Basic
Transaction Solution International India interview questions for popular designations
I applied via Referral and was interviewed in Oct 2021. There were 2 interview rounds.
I applied via Company Website and was interviewed before Dec 2021. There were 2 interview rounds.
I applied via Referral and was interviewed before May 2021. There were 2 interview rounds.
Top trending discussions
I was interviewed before May 2016.
I was interviewed before Jan 2021.
Round duration - 90 minutes
Round difficulty - Medium
It was conducted in Hacker rank which consisted of 10 aptitude questions that included C, C++, Java MCQ. 2 programming questions were also given.
Given an N x M
matrix filled with integers, determine the minimum sum obtainable from a path that starts at a specified cell (x, y)
and ends at the top left corner of t...
The problem involves finding the minimum sum path from a specified cell to the top left corner of a matrix.
Start from the specified cell and calculate the minimum sum path to reach the top left corner using dynamic programming.
Consider the three possible moves: down, right, and down-right diagonal.
Keep track of the minimum sum at each cell and update it based on the minimum of the three possible moves.
Finally, the mini...
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 backtracking to generate all possible combinations of balanced parentheses.
Keep track of the number of open and close parentheses used in each combination.
Recursively generate combinations by adding open parentheses if there are remaining, and closing parentheses if the number of open parentheses is greater than the number of clo...
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions based on data structures, oops and networking.
Create a program that counts and prints the total number of specific character types from user input. Specifically, you need to count lowercase English alphabets, numeric digi...
Create a program to count lowercase alphabets, digits, and white spaces from user input until '$' is encountered.
Read characters from input stream until '$' is encountered
Count lowercase alphabets, digits, and white spaces separately
Print the counts of each character type as three integers separated by spaces
Given an unsorted array containing 'N' integers, you are required to find 'K' largest elements from the array and return them in non-decreasing order.
The fir...
Find K largest elements in an unsorted array and return them in non-decreasing order.
Sort the array in non-decreasing order.
Return the last K elements of the sorted array.
To check internet connection on a system, you can use various methods like pinging a website or checking network status.
Use ping command to check connectivity to a website (e.g. ping www.google.com)
Check network status using network settings or command line tools
Try accessing a website or online service to verify internet connection
When you type a URL in a web browser, the browser sends a request to the server hosting the website, which then responds with the necessary files to display the webpage.
Browser checks cache for DNS resolution
If not found, browser sends a DNS query to resolve the domain name to an IP address
Browser establishes a TCP connection with the server
Browser sends an HTTP request to the server for the webpage
Server processes the...
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions based on data structures, oops and networking.
Ninja is learning about sorting algorithms, specifically those that do not rely on comparisons. Can you help Ninja implement the counting sort algorithm?
Implement counting sort algorithm to sort an array of integers without comparisons.
Count the frequency of each element in the input array.
Calculate the prefix sum of frequencies to determine the position of each element in the sorted array.
Place each element in its correct position based on the prefix sum.
Time complexity of counting sort is O(n+k), where n is the number of elements and k is the range of input.
Example: ...
The Fibonacci series has applications in various fields such as mathematics, computer science, art, and nature.
Used in algorithms for optimization problems and dynamic programming.
Found in nature, such as the arrangement of leaves on a stem, the branching of trees, and the spiral shapes of shells.
Applied in financial markets for predicting stock prices and analyzing market trends.
Utilized in art and design for creating
Round duration - 30 minutes
Round difficulty - Easy
HR round where the interviewer asked questions to know more about me.
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.
based on 7 interviews
Interview experience
based on 102 reviews
Rating in categories
Senior Executive
86
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
48
salaries
| ₹0 L/yr - ₹0 L/yr |
Executive
42
salaries
| ₹0 L/yr - ₹0 L/yr |
Manager
22
salaries
| ₹0 L/yr - ₹0 L/yr |
Operations Manager
11
salaries
| ₹0 L/yr - ₹0 L/yr |
FIS
Fiserv
PayPal
Worldline