i
Reval Analytics
Filter interviews by
I applied via Campus Placement and was interviewed in Sep 2021. There were 2 interview rounds.
Verbal, Coding basic questions
Code for linked list
Create a Node class with data and next pointer
Create a LinkedList class with head pointer
Implement methods to add, remove, and traverse nodes
Top trending discussions
I applied via Job Portal and was interviewed in Dec 2024. There was 1 interview round.
The topic was -> "One nation one election"
String pool in Java is a pool of unique strings stored in memory to optimize memory usage.
String pool is a part of Java's memory where unique string literals are stored.
When a new string is created, Java checks if it already exists in the pool to save memory.
Strings created using double quotes are added to the pool, while those created using 'new' keyword are not.
Example: String str1 = "hello"; String str2 = "hello"; /...
Java has checked and unchecked exceptions. Checked exceptions must be handled at compile time, while unchecked exceptions do not need to be handled explicitly.
Checked exceptions: Must be caught or declared in the method signature. Example: IOException, SQLException
Unchecked exceptions: Do not need to be caught or declared. Example: NullPointerException, ArrayIndexOutOfBoundsException
I applied via Campus Placement and was interviewed in Jun 2024. There were 2 interview rounds.
1 dp
2 dynamic graph
I applied via Walk-in and was interviewed in May 2024. There was 1 interview round.
LRU cache with multi level caching involves implementing a cache with multiple levels of storage, where the least recently used items are evicted first.
Implement a two-level cache system with a primary cache (e.g. in-memory) and a secondary cache (e.g. disk-based).
Use a data structure like a doubly linked list and a hash map to efficiently manage the cache and track the least recently used items.
When an item is accesse...
posted on 9 Feb 2024
I was interviewed in Jan 2024.
I applied via campus placement at Indian Institute of Technology (IIT), Guwahati and was interviewed in Nov 2023. There were 4 interview rounds.
Mcqs based on cs fundamentals and 2_3 coding questions
Merge two sorted linked lists into one.
Create a new linked list to store the merged list.
Compare the values of the nodes from both lists and add the smaller value to the new list.
Move the pointer of the list with the smaller value to the next node.
Repeat the comparison and addition until one of the lists is empty.
Add the remaining nodes from the non-empty list to the new list.
Return the new merged list.
I applied via LinkedIn and was interviewed in Jun 2024. There were 2 interview rounds.
Data Structures Algorithms
Data Structures and Algorithm
based on 5 reviews
Rating in categories
Client Service Analyst
43
salaries
| ₹3 L/yr - ₹7.5 L/yr |
Financial Analyst
25
salaries
| ₹2.5 L/yr - ₹7 L/yr |
Software Developer
21
salaries
| ₹4.6 L/yr - ₹11.3 L/yr |
Senior Client Service Analyst
19
salaries
| ₹3 L/yr - ₹11 L/yr |
Team Lead
11
salaries
| ₹9.4 L/yr - ₹17.9 L/yr |
Fractal Analytics
Mu Sigma
Tiger Analytics
LatentView Analytics