Filter interviews by
I applied via Referral and was interviewed before May 2021. There were 2 interview rounds.
Top trending discussions
I applied via Naukri.com and was interviewed before Sep 2019. There were 4 interview rounds.
I applied via Walk-in and was interviewed before Jan 2022. There were 4 interview rounds.
Grammer
Typing test
Essay writing
iOS and Android are two different mobile operating systems with different features and user interfaces.
iOS is exclusive to Apple devices while Android is used by multiple manufacturers
iOS has a more closed system with limited customization options while Android is more open and customizable
iOS has a more consistent user interface across devices while Android can vary depending on the manufacturer
Android has a wider ran...
I am best at managing teams and ensuring efficient workflow.
Strong leadership skills
Effective communication
Ability to delegate tasks
Problem-solving and decision-making
Time management and organization
Motivating and inspiring team members
I would try to negotiate with my manager and see if I can take the leaves on some other dates.
I would first try to talk to my manager and explain the situation
I would try to negotiate and see if I can take the leaves on some other dates
If that is not possible, I would try to make the most of the remaining days and celebrate Diwali with my family and friends
I would also try to take some time off during the weekend to ma
I applied via Company Website and was interviewed before Aug 2023. There were 3 interview rounds.
Negotiation in sales requires active listening, understanding needs, building rapport, and finding win-win solutions.
Listen actively to the client's needs and concerns
Understand the client's priorities and budget constraints
Build rapport and trust with the client to create a positive relationship
Focus on finding win-win solutions that benefit both parties
Be prepared to compromise but also know your bottom line
I applied via Recruitment Consulltant and was interviewed before May 2023. There were 2 interview rounds.
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.
I was interviewed before Jan 2021.
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview Round with questions based on Data structures, OOPS and SQL.
You are provided with a linked list of integers. Your task is to implement a function that deletes a node located at a specified position 'POS'.
The first line co...
Implement a function to delete a node from a linked list at a specified position.
Traverse the linked list to find the node at the specified position.
Update the pointers of the previous and next nodes to skip the node to be deleted.
Handle edge cases such as deleting the head or tail of the linked list.
Ensure to free the memory of the deleted node to avoid memory leaks.
SQL query to find the nth highest salary
Use the ORDER BY clause to sort salaries in descending order
Use the LIMIT and OFFSET clauses to skip the first n-1 highest salaries
Combine the above steps in a single query to find the nth highest salary
OOP is a programming paradigm based on the concept of objects, which can contain data in the form of fields and code in the form of procedures.
OOP focuses on creating objects that interact with each other to solve problems.
Key concepts include encapsulation, inheritance, and polymorphism.
Encapsulation involves bundling data and methods that operate on the data into a single unit.
Inheritance allows classes to inherit at...
Round duration - 60 minutes
Round difficulty - Easy
Was asked me about my favorite technologies, What i liked about Facebook. And asked me to design a cinema ticket reservation web site like the one satyam has.
Given an array containing N
distinct positive integers and a number K
, determine the Kth largest element in the array.
N = 6, K = 3, array = [2, 1, 5, 6, 3, ...
Find the Kth largest element in an array of distinct positive integers.
Sort the array in non-increasing order and return the Kth element.
Handle multiple test cases efficiently.
Ensure all elements in the array are distinct.
Virtual functions are functions in a base class that are overridden in derived classes to achieve runtime polymorphism.
Virtual functions are declared in a base class with the 'virtual' keyword.
They are overridden in derived classes using the 'override' keyword.
They allow a function to be called based on the runtime type of an object.
Virtual functions enable dynamic binding and late binding in C++.
Example: virtual void ...
Design a Cinema Ticket Reservation System
Use a database to store movie information, showtimes, and seat availability
Allow users to search for movies, select showtimes, and choose seats
Implement a payment system for ticket purchases
Send confirmation emails with QR codes for ticket validation
You can find a defective ball among 10 given balls in 2 attempts using a two-pan balance scale.
Divide the 10 balls into two groups of 5 each.
Weigh the two groups on the balance scale.
If one group is heavier, it contains the defective ball. If they are equal, the defective ball is in the remaining 5 balls.
Divide the group of 5 balls with the defective one into two groups of 2 and 3 balls.
Weigh the two groups on the bala...
Round duration - 30 minutes
Round difficulty - Easy
HR round that lasted for about 30 minutes. The interviewer asked me questions to know more about me and a puzzle.
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 was interviewed before Jan 2021.
Round duration - 60 minutes
Round difficulty - Easy
I couldn't find an optimal approach to the first question, so she skipped that question and proceeded to next questions. Remaining questions I have answered satisfactorily.
Given an array/list of positive integers and an integer K, determine if there exists a subset whose sum equals K.
Provide true
if such a subset exists, otherwise r...
Given an array of positive integers and an integer K, determine if there exists a subset whose sum equals K.
Use dynamic programming to solve this problem efficiently
Create a 2D array to store if a subset with a particular sum exists
Iterate through the array and update the 2D array accordingly
Check if the value at the end of the iteration is true for the given K
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...
BFS traversal in a disconnected graph starting from vertex 0.
Implement BFS algorithm to traverse the graph starting from vertex 0.
Use a queue to keep track of visited nodes and their neighbors.
Ensure to print the traversal sequence in the correct order.
Handle disconnected components by checking for unvisited nodes.
Follow the BFS approach of exploring neighbors before moving to the next level.
Round duration - 60 minutes
Round difficulty - Easy
I told that my strength is problem solving and I can always find a way when there is a bottle-neck. Gave some examples of my experiences while doing my assignments.
Given a string STR
consisting of words separated by spaces, your task is to replace all spaces between words with the characters "@40".
The first line contains an integ...
Replace spaces in a string with '@40'.
Iterate through each character in the string
Replace spaces with '@40'
Return the modified string
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 2 Sep 2015
Polymorphism is the ability of an object to take on many forms. Constructors and destructors are special methods in classes.
Polymorphism allows objects to be treated as instances of their own class or as instances of their parent class.
Constructors are used to initialize objects when they are created. Destructors are used to clean up after an object when it is destroyed.
Classes are templates for creating objects. They ...
Encapsulation is the process of hiding implementation details and exposing only the necessary information to the user.
Encapsulation is achieved through access modifiers like public, private, and protected.
It helps in achieving data abstraction and information hiding.
Encapsulation provides better control over the data and prevents unauthorized access.
Example: A class with private variables and public methods to access t...
Remove duplicates in linked lists
Traverse the linked list and keep track of visited nodes using a hash table
If a node is already visited, remove it from the linked list
Time complexity: O(n), Space complexity: O(n)
Mergesort is a divide-and-conquer algorithm that sorts an array by dividing it into two halves, sorting each half, and merging them.
Divide the array into two halves
Sort each half recursively
Merge the two sorted halves
Repeat until the entire array is sorted
Example: ['apple', 'banana', 'cherry', 'date'] -> ['apple', 'banana', 'cherry', 'date'] -> ['apple', 'banana'], ['cherry', 'date'] -> ['apple'], ['banana'], ['cherry'...
Reverse a given string
Create an empty string
Iterate through the original string in reverse order
Append each character to the empty string
Return the reversed string
Reverse words in a string
Split the string into an array of words
Reverse the array
Join the array into a string
Check if a string is palindrome or not
Reverse the string and compare with original
Compare characters from start and end of string
Ignore spaces and punctuation marks while comparing
I am a software engineer with experience in developing web applications and a passion for problem-solving.
Experienced in developing web applications using technologies such as HTML, CSS, JavaScript, and React
Proficient in programming languages such as Java and Python
Skilled in problem-solving and troubleshooting
Strong communication and collaboration skills
Passionate about staying up-to-date with the latest technologies
GATE is not my preferred choice as I am more interested in software development than research.
I am more interested in practical application of software development than theoretical research
I believe my skills and interests align better with software engineering roles
I have researched and found that software engineering roles do not require a GATE qualification
I prefer open-source technologies and have more experience with them.
I have more experience with open-source technologies like Linux and Python.
I believe in the benefits of open-source software for collaboration and innovation.
I am not opposed to using MS technologies if they are the best fit for the project.
However, I prefer to work with technologies that align with my values and experience.
Diebold offers challenging work and opportunities for growth in the software engineering field.
Diebold has a strong reputation in the industry
The company offers a diverse range of projects and technologies to work on
There are opportunities for career growth and development
The work is challenging and rewarding
Diebold values innovation and creativity in its employees
Software is the future and ECE has a strong foundation in programming and problem-solving.
ECE curriculum includes programming courses
Software development is a growing industry
Programming skills are transferable across fields
Interest in software development and problem-solving
Opportunities to work on software projects during ECE studies
based on 2 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