Filter interviews by
I applied via Recruitment Consulltant and was interviewed before Jun 2023. There was 1 interview round.
Use a combination of a stack and a queue to achieve O(1) time complexity for random, push, and pop operations.
Use a stack to push elements and pop them in O(1) time.
Use a queue to enqueue elements and dequeue them in O(1) time.
To achieve random access in O(1) time, maintain an array to store the elements and use a hash map to store the indices of each element.
Reverse a string by iterating through the characters and swapping them
Create a function that takes a string as input
Initialize two pointers, one at the beginning and one at the end of the string
Swap the characters at the two pointers and move them towards the center until they meet
I applied via Campus Placement and was interviewed before May 2023. There were 3 interview rounds.
Shared a list of problems to solve on paper, discussion was based on the logic implemented
I applied via Walk-in and was interviewed before Dec 2020. There were 3 interview rounds.
I applied via Naukri.com and was interviewed in Aug 2020. There were 3 interview rounds.
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 Walk-in and was interviewed in Mar 2021. There was 1 interview round.
based on 2 interviews
Interview experience
based on 15 reviews
Rating in categories
Software Developer
582
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer
551
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
472
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Manager
432
salaries
| ₹0 L/yr - ₹0 L/yr |
Deputy Manager
366
salaries
| ₹0 L/yr - ₹0 L/yr |
Jio
Reliance Industries
Bharti Airtel
Vodafone Idea