Filter interviews by
I applied via Naukri.com and was interviewed in Oct 2024. There was 1 interview round.
Implement programs to check array equality, find duplicates, and perform binary search algorithm in Java.
To check if two arrays are equal, compare each element in both arrays.
To find duplicates in an array, use a HashSet to store unique elements and identify duplicates.
For binary search algorithm implementation, ensure the array is sorted and recursively divide the array to find the target element.
Hashing algorithm is a method used to convert data into a fixed-size string of bytes.
Hashing algorithms are used to map data of arbitrary size to fixed-size values.
They are commonly used in data structures like hash tables for fast data retrieval.
Examples of hashing algorithms include MD5, SHA-1, and SHA-256.
I appeared for an interview in Jul 2019.
I applied via Campus Placement and was interviewed before Jun 2020. There were 4 interview rounds.
I appeared for an interview before Sep 2020.
Round duration - 50 minutes
Round difficulty - Medium
Yes consist of two code and questions MCQ of ds ,algo,Linz,shell,English and DBMS
Test happens with your webcam access.
Calculate the Nth term in the Fibonacci sequence using the formula: F(n) = F(n-1) + F(n-2)
where F(1) = F(2) = 1
.
Given a number N, determine the Nth Fibonacci number.
Calculate the Nth Fibonacci number using the given formula and constraints.
Implement a function to calculate the Nth Fibonacci number using the formula F(n) = F(n-1) + F(n-2) with base cases F(1) = F(2) = 1.
Use dynamic programming or recursion to efficiently compute the Fibonacci number for large N values.
Ensure the input N is within the constraints 1 <= N <= 10000.
Example: For N = 5, the output should be 5 as th
Round duration - 40 minutes
Round difficulty - Hard
Late night around at 8 pm
Environmental is positive.
Interviewer made me feel positive
Ninja is tasked with implementing a priority queue using the Heap data structure. Since Ninja is busy with tournament preparations, your help is requested to complete this ta...
Implement a priority queue using Heap data structure with functions like push, pop, getMaxElement, and isEmpty.
Implement push() function to insert element into the priority queue.
Implement pop() function to delete the largest element from the queue.
Implement getMaxElement() function to return the largest element.
Implement isEmpty() function to check if the queue is empty.
Round duration - 10 Minutes
Round difficulty - Easy
Morning time
Positive environment
Nice interviewer
Tip 1 : practice on subject in which you are strong enough and unbeatable
Tip 2 : Always go through previous interview experiences on internet
Tip 3 : follow continuety
Tip 1 : mention only you strong topics ,don't include anything you don't know about
Tip 2 : always make your resume one pager
I applied via Approached by Company and was interviewed before Jun 2021. There were 2 interview rounds.
Frameworks provide structure and pre-built components for software development, but can also limit flexibility and require learning curve.
Advantage: Provides structure and pre-built components for faster development
Advantage: Can improve code quality and maintainability
Disadvantage: Can limit flexibility and customization
Disadvantage: Requires learning curve and potential dependency issues
Example: ReactJS provides a fr...
Oops stands for Object-Oriented Programming. It is a programming paradigm that uses objects to represent real-world entities.
Advantages: code reusability, modularity, encapsulation, inheritance, polymorphism
Disadvantages: complexity, steep learning curve, performance overhead
Example: creating a class 'Car' with properties like 'make', 'model', and 'year', and methods like 'start_engine' and 'stop_engine'
I applied via Naukri.com and was interviewed before Oct 2019. There was 1 interview round.
I applied via Company Website and was interviewed before Jul 2021. There were 2 interview rounds.
Data Structure related questions
A generic swap function swaps two values of any data type.
The function should take two parameters of any data type.
Use a temporary variable to store the value of one parameter.
Assign the value of the second parameter to the first parameter.
Assign the value of the temporary variable to the second parameter.
Search for an element in a rotated sorted linked list.
Find the pivot point where the list is rotated.
Divide the list into two sublists based on the pivot point.
Perform binary search on the appropriate sublist.
Handle edge cases such as empty list and list with only one element.
Search an element in a rotated sorted array
Find the pivot point where the array is rotated
Divide the array into two sub-arrays based on pivot point
Perform binary search on the appropriate sub-array
Repeat until element is found or sub-array size is 1
Find 5 missing numbers in an array of size 95 containing numbers in range 1 to 100.
Create a boolean array of size 100 and mark the present numbers
Iterate through the boolean array and find the missing numbers
Alternatively, use a HashSet to store the present numbers and find the missing ones
Given a Sudoku board, find possible numbers for an empty cell.
Iterate through empty cells and check possible numbers using row, column, and box constraints.
Use a set to keep track of possible numbers for each empty cell.
Return the set of possible numbers for the given empty cell.
Find integer average of 4 unsigned integers without typecasting
Add all the integers and divide by 4
Use bit shifting to divide by 4
Handle overflow by using long long data type
Use unsigned int data type for input
Code to identify 32 bit or 64 bit architecture of a processor
Check if the operating system is 32 bit or 64 bit
If OS is 32 bit, processor is 32 bit
If OS is 64 bit, check if processor supports 64 bit architecture
Use CPUID instruction to check if processor supports 64 bit architecture
Convert binary number to base 64 integer
Divide the binary number into groups of 6 bits
Convert each group of 6 bits to decimal
Map the decimal value to the corresponding base 64 character
Concatenate the base 64 characters to form the final integer
based on 1 interview
Interview experience
Software Engineer
526
salaries
| ₹5 L/yr - ₹18 L/yr |
Senior Software Engineer
297
salaries
| ₹8.2 L/yr - ₹28 L/yr |
Financial Analyst
290
salaries
| ₹3.5 L/yr - ₹8 L/yr |
Associate Software Engineer
258
salaries
| ₹4 L/yr - ₹10 L/yr |
Quality Assurance Analyst
229
salaries
| ₹3.5 L/yr - ₹12.9 L/yr |
Oracle
Amdocs
Automatic Data Processing (ADP)
24/7 Customer