Filter interviews by
I applied via Indeed and was interviewed before Jul 2023. There was 1 interview round.
Bubble Sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order.
Compare each pair of adjacent elements in the array and swap them if they are in the wrong order
Repeat this process until no more swaps are needed, indicating that the array is sorted
Time complexity of O(n^2) in the worst case scenario
Example: ['banana', 'apple', 'c...
Function to search for a value in a binary search tree
Start at the root node
Compare the value to the current node's value
If the value is less, move to the left child node; if greater, move to the right child node
Repeat until the value is found or the node is null
Linear search compares each element in a list sequentially, while binary search divides the list in half at each step.
Linear search has a time complexity of O(n), while binary search has a time complexity of O(log n).
Linear search is suitable for small lists, while binary search is more efficient for larger sorted lists.
Example: Linear search - searching for a name in an unsorted phone book. Binary search - searching f
Use a loop to check for prime numbers from 1 to n
Iterate from 1 to n and check if each number is prime
A prime number is only divisible by 1 and itself
Start checking divisibility from 2 up to the square root of the number
Top trending discussions
I applied via Company Website and was interviewed before Aug 2020. There were 4 interview rounds.
I applied via Recruitment Consulltant and was interviewed before Jun 2021. There was 1 interview round.
BigInteger is used for mathematical operations involving very large integers in Java.
BigInteger is used when the range of values supported by primitive data types like int and long is not sufficient.
It is commonly used in cryptography and security applications.
It provides methods for arithmetic, bitwise, and logical operations on large integers.
Example: calculating factorial of a large number, generating large prime nu
Merge Sort Algo code in java
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
Time complexity: O(n log n)
I applied via Naukri.com and was interviewed in Aug 2020. There was 1 interview round.
I applied via Walk-in and was interviewed in Aug 2020. There were 4 interview rounds.
I applied via Naukri.com and was interviewed before Jan 2021. There were 3 interview rounds.
I applied via Recruitment Consulltant and was interviewed before Feb 2021. There were 3 interview rounds.
1.It covers all aptitude topics, and English sentences
2.Essay writing
3.Coding
To debug a particular program without affecting others, use breakpoints and step through the code.
Set a breakpoint in the program you want to debug
Step through the code using a debugger to identify the issue
Use logging statements to track the flow of the program
Check the call stack to see which functions are being called
Use conditional breakpoints to stop the program at specific points
based on 1 interview
Interview experience
based on 3 reviews
Rating in categories
Software Developer
6
salaries
| ₹2.3 L/yr - ₹5 L/yr |
TCS
Accenture
Wipro
Cognizant