Filter interviews by
I applied via Job Portal and was interviewed in Oct 2024. There was 1 interview round.
OOPS is Object-Oriented Programming, Inheritance is the ability of a class to inherit properties and behavior from another class, Static Binding is resolved at compile time, Dynamic Binding is resolved at runtime.
OOPS stands for Object-Oriented Programming, which is a programming paradigm based on the concept of objects.
Inheritance is a feature in OOP that allows a class to inherit properties and behavior from another ...
Top trending discussions
I applied via Company Website and was interviewed in Mar 2024. There was 1 interview round.
Two questions on array sort the given array and find how many times a element occur
I was interviewed in May 2024.
API Scenarios, Java DSA questions,
I applied via LinkedIn and was interviewed before Oct 2022. There were 4 interview rounds.
Automation, Backend Automation, API Test Automation.
Java, OOPS concepts. Interfaces, Inheritance
I applied via Naukri.com and was interviewed before Jul 2023. There were 3 interview rounds.
Medium level aptitude test
Hard level coding test
Preferred location is Seattle, WA
Seattle, WA offers a great tech industry
Beautiful scenery and outdoor activities in the Pacific Northwest
Close proximity to mountains and water for outdoor enthusiasts
I applied via LinkedIn and was interviewed in Apr 2023. There were 3 interview rounds.
Swap two numbers without using a third integer
Use XOR operation to swap two numbers without using a third integer
Example: a = 5, b = 7. a = a XOR b, b = a XOR b, a = a XOR b
After swapping: a = 7, b = 5
Jenkins setup involves configuring jobs and updating reports for the team.
Install Jenkins on a server or local machine
Create a new job by selecting 'New Item' and choosing the job type
Configure the job by setting up build triggers, source code management, build steps, and post-build actions
Add plugins for reporting tools like JUnit or HTML Publisher to generate reports
Update the report by viewing the job's build histor...
Reverse an integer by converting it to a string and then reversing the string
Convert the integer to a string
Reverse the string
Convert the reversed string back to an integer
I applied via HackerEarth and was interviewed in Apr 2022. There were 4 interview rounds.
Online coding round which was based on dynamic programming and hashing
Coding round based on data structure and algorithm like binary search ,hashing and string
Approach for designing an automation framework
Identify the scope and requirements of the framework
Choose a suitable programming language and tools
Design the framework architecture and modules
Implement the framework and write test scripts
Integrate the framework with CI/CD pipeline
Continuously maintain and update the framework
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 1 interview
Interview experience
Assistant Manager
196
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
183
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
178
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Manager
131
salaries
| ₹0 L/yr - ₹0 L/yr |
Manager
98
salaries
| ₹0 L/yr - ₹0 L/yr |
Razorpay
Paytm
Mobikwik
PhonePe