Filter interviews by
Clear (1)
I was interviewed in Feb 2021.
Round duration - 60 minutes
Round difficulty - Hard
This round was carried out on Amcat. It was very user friendly platform and easily understandable. Countdown Timer was located at the top right corner that helped me to keep a check on the remaining time and I planned my answers and code accordingly.
The Ninja has been given a challenge by his master to reach the last stone. These stones are represented as an array of numbers. The Ninja can jump using either odd-numbered or even-numb...
Find the number of starting indices from which a Ninja can reach the last stone by following specific jump rules.
Iterate through the array and keep track of the possible jumps for each index.
Use dynamic programming to efficiently calculate the number of starting indices.
Consider odd and even jumps separately to determine the valid jumps.
Handle edge cases where there are no possible jumps from certain indices.
Return the...
You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or tw...
The problem involves determining the number of distinct ways to climb from the 0th to the Nth stair by climbing one or two steps at a time.
Use dynamic programming to solve this problem efficiently.
Define a recursive function to calculate the number of ways to reach each stair based on the number of ways to reach the previous two stairs.
Consider base cases for 0th and 1st stairs.
Use modulo operation to handle large numb...
Round duration - 30 minutes
Round difficulty - Medium
This was carried out on skype and the questions asked were relatively difficult, I wasn't very much sure with my answers. Although, this platform is nice and it wasn't the first time, I was using skype but still the final results didn't went in my faour.
Your task is to identify the position of the only '1' bit in the binary representation of a given non-negative integer N
. The representation contains exactly one '1' and the rest are...
Find the position of the lone '1' bit in the binary representation of a given non-negative integer.
Iterate through the bits of the integer to find the position of the lone '1'.
Use bitwise operations to check if there is exactly one '1' bit in the binary representation.
Return the position of the lone '1' or -1 if there isn't exactly one '1'.
Deadlock is a situation where two or more processes are unable to proceed because each is waiting for the other to release a resource, while livelock is a situation where two or more processes continuously change their states in response to changes in the other processes without making any progress.
Deadlock involves a circular wait condition where processes are stuck waiting for resources held by each other.
Livelock in...
Tip 1 : practice regularly on geeksforgeeks and coding ninjas like platforms
Tip 2 : solve all the must do questions from gfg
Tip 3 : compete in codechef long challenge
Tip 1 : try to keep only those things in resume on which you have very good command and you should be able to answer all of the questions(upto moderate level) related to your technical skills
Tip 2 : mention your projects with brief description, try avoiding very high level description because some times reader might not be able to understand your work, keep it descriptive and understandable
Top trending discussions
I applied via Naukri.com and was interviewed in Aug 2020. There were 3 interview rounds.
I was interviewed in Oct 2020.
I applied via Campus Placement and was interviewed before Feb 2020. There were 6 interview rounds.
I applied via Company Website and was interviewed before Feb 2020. There was 1 interview round.
I applied via Campus Placement and was interviewed in Oct 2020. There were 4 interview rounds.
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.
Start from the first element and compare it with the next element
If the next element is smaller, swap them
Repeat this process for all elements in the array
Continue this process until no more swaps are needed
A program to print all prime numbers
Take input from user for range of numbers
Loop through the range and check if each number is prime
Print the prime numbers
Hashmap is a data structure that stores key-value pairs and allows constant time access to values based on their keys.
Hashmap uses a hash function to map keys to indices in an array.
Collisions can occur when multiple keys map to the same index, which can be resolved using techniques like chaining or open addressing.
Examples of hashmap implementations include Java's HashMap class and Python's dict type.
Inheritance is a mechanism in object-oriented programming where a new class is created by inheriting properties of an existing class.
Inheritance allows code reuse and promotes code organization.
The existing class is called the parent or superclass, and the new class is called the child or subclass.
The child class inherits all the properties and methods of the parent class and can also add new properties and methods.
For...
I applied via Campus Placement and was interviewed before Aug 2021. There were 2 interview rounds.
Basic mathematical questions
I wrote code for Fibonacci series and swapping two numbers in my last semester project.
For Fibonacci series, I used a loop to generate the series up to a given number.
For swapping two numbers, I used a temporary variable to store one value while swapping the other.
Both codes were written in C++ language.
I also added error handling to ensure the input values were valid.
I applied via Walk-in and was interviewed in Mar 2021. There was 1 interview round.
I applied via Campus Placement and was interviewed before Dec 2021. There were 2 interview rounds.
Basic logical reasoning and verbal questions . Easy to clear