Filter interviews by
Top trending discussions
Code Snept question with 3-4 Reasoning question. Google form
Pen paper coding round. String , Array . Linkedlist , graph, questions
To find the nearest prime number, iterate from the given number in both directions until a prime number is found.
Start iterating from the given number in both directions to find the nearest prime number.
Check if a number is prime by dividing it by all numbers less than its square root.
Keep track of the closest prime number found during the iteration.
Find the second maximum number in an array of strings.
Convert the array of strings to an array of integers.
Sort the array in descending order.
Return the second element in the sorted array.
posted on 12 Nov 2024
I applied via campus placement at Krishna Institute of Engineering and Technology, Ghaziabad and was interviewed in Oct 2024. There were 3 interview rounds.
Medium level questions asked
Simple easy to medium 2 questions asked of string and array
Android components like Recycler View, View Model, ANR are essential for building robust Android applications.
Recycler View: Efficient way to display large data sets by recycling views as they scroll off the screen.
View Model: Manages UI-related data in a lifecycle-conscious way, surviving configuration changes.
ANR (Application Not Responding): Dialog shown to the user when the main thread of an app is blocked for too ...
LRU cache is a data structure that stores the most recently used items, discarding the least recently used items when full.
Use a hashmap to store key-value pairs for quick access
Use a doubly linked list to keep track of the order of items based on their usage
When an item is accessed, move it to the front of the list
When the cache is full, remove the least recently used item from the end of the list
posted on 17 Oct 2024
I applied via Walk-in
To implement a queue using a stack, use two stacks and simulate the queue operations.
Use two stacks, one for enqueue operation and one for dequeue operation.
For enqueue operation, simply push elements onto the stack used for enqueueing.
For dequeue operation, if the dequeue stack is empty, pop all elements from enqueue stack and push onto dequeue stack.
Then pop from the dequeue stack to simulate dequeue operation.
A linked list is a data structure consisting of nodes where each node points to the next node in the sequence.
Create a Node class with data and next pointer
Initialize a head pointer to null
Add nodes by updating next pointers
Traverse the list by following next pointers
I applied via Campus Placement and was interviewed in Jun 2024. There were 2 interview rounds.
It was ok. I was not able to solve all the questions.
To remove the last element from a linked list, iterate to the second last node and update its next pointer to null.
Iterate through the linked list to find the second last node
Update the next pointer of the second last node to null
I applied via LinkedIn and was interviewed in Aug 2024. There was 1 interview round.
The interviewer asked about javascript basics and DSA questions and some typescript questions
Coding for international
Quantitative arithmetic,verbal reasoning,non-verbal reasoning,etc
posted on 31 Aug 2024
I applied via Naukri.com and was interviewed in Mar 2024. There were 2 interview rounds.
Simple question on maths
OOPS (Object-Oriented Programming) is a programming paradigm based on the concept of objects, which can contain data and code.
OOPS focuses on creating objects that interact with each other to solve complex problems
Key principles include encapsulation, inheritance, polymorphism, and abstraction
Encapsulation ensures that the internal state of an object is hidden from the outside world
Inheritance allows a class to inherit...
Software Developer
55
salaries
| ₹5.8 L/yr - ₹13.8 L/yr |
Junior Software Developer
45
salaries
| ₹4.5 L/yr - ₹9.2 L/yr |
Software Engineer
36
salaries
| ₹4.1 L/yr - ₹16.1 L/yr |
Senior Software Engineer
29
salaries
| ₹10.1 L/yr - ₹24 L/yr |
Quality Analyst
24
salaries
| ₹5 L/yr - ₹9 L/yr |
TCS
Infosys
Wipro
HCLTech