i
SAP
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I was interviewed in May 2024.
Questions based on Data Structures. Could not complete.
I applied via LinkedIn and was interviewed in Feb 2023. There were 4 interview rounds.
Asked me to code on isomorphic strings
Asked me about how to design a project like BookmyShow
I applied via Job Portal and was interviewed in Feb 2024. There was 1 interview round.
Find the Kth node from the end of a linked list
Traverse the linked list to find the length of the list
Calculate the position of the Kth node from the beginning
Traverse the list again to find the Kth node from the end
I was interviewed in Oct 2021.
Round duration - 60 Minutes
Round difficulty - Medium
This round had 2 questions of DSA where I was asked to first explain my approach and then code it as well in a production ready manner . After that , I was asked some questions related to Operating Systems and Java .
You are given a singly Linked List with 'N' nodes containing integer data and an integer 'K'. Your task is to delete the Kth node from the end of this Lin...
Approach :
1) Maintain two pointers – reference pointer and main pointer.
2) Initialize both reference and main pointers to head.
3) First, move the reference pointer to n nodes from head.
4) Now move both pointers one by one until the reference pointer reaches the end.
5) Now the main pointer will point to nth node from the end.
6) Return the main pointer.
TC : O(N) where N=length of the Linked
You are provided with two singly linked lists containing integers, where both lists converge at some node belonging to a third linked list.
Your task is to determine t...
Approach :
I) Using Hashing :
Basically, we need to find a common node of two linked lists. So we hash all nodes of the first list and then check the second list.
Note : Hash the nodes not the node value
1) Create an empty hash set.
2) Traverse the first linked list and insert all nodes' addresses in the hash set.
3) Traverse the second list. For every node check if it is present in the hash set. If we find a node in the has...
In Java, a thread always exists in any one of the following states. These states are:
1) New
2) Active
3) Blocked / Waiting
4) Timed Waiting
5) Terminated
Explanation of Different Thread States :
1) New: Whenever a new thread is created, it is always in the new state. For a thread in the new state, the code has not been run yet and thus has not begun its execution.
2) Active: When a thread invokes the start() method, it ...
Round duration - 60 Minutes
Round difficulty - Medium
This round also had 2 questions of DS/Algo where I coded one of them and then we switched our discussion to DBMS and OOPS ( particularly in Java ) .
You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.
...Approach 1 (Recursive) :
1) Compare the head of both linked lists.
2) Find the smaller node among the two head nodes. The current element will be the smaller node among two head nodes.
3) The rest elements of both lists will appear after that.
4) Now run a recursive function with parameters, the next node of the smaller element, and the other head.
5) The recursive function will return the next smaller element linked with r...
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key)
- Return the value of the key if it exists in the cache; otherw...
Answer :
Structure of an LRU Cache :
1) In practice, LRU cache is a kind of Queue — if an element is reaccessed, it goes to the end of the eviction order
2) This queue will have a specific capacity as the cache has a limited size. Whenever a new element is brought in, it
is added at the head of the queue. When eviction happens, it happens from the tail of the queue.
3) Hitting data in the cache must be done in constan...
Answer :
DELETE command:
1) This command is needed to delete rows from a table based on the condition provided by the WHERE clause.
2) It can be rolled back if required.
3) It maintains a log to lock the row of the table before deleting it and hence it’s slow.
TRUNCATE command:
1) This command is needed to remove complete data from a table in a database. It is like a DELETE command which has no WHERE clause.
2) It removes com...
Answer :
1) Garbage Collection in Java is a process by which the programs perform memory management automatically.
2) The Garbage Collector(GC) finds the unused objects and deletes them to reclaim the memory. I
3) In Java, dynamic memory allocation of objects is achieved using the new operator that uses some memory and the
memory remains allocated until there are references for the use of the object.
4) When there are no re...
Round duration - 50 Minutes
Round difficulty - Medium
This round was inclined towards some Low Level Design Principles and some concepts from Java .
Tip 1: Firstly, remember that the system design round is extremely open-ended and there’s no such thing as a standard answer. Even for the same question, you’ll have a totally different discussion with different interviewers.
Tip 2:Before you jump into the solution always clarify all the assumptions you’re making at the beginning of the interview. Ask questions to identify the scope of the system. This will clear the in...
JVM is platform dependent because it takes java byte code and generates byte code for the current operating system. So Java software is platform dependent but Java language is platform independent because different operating system have different JVMs.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more
Arrays and strings - 90 mins
Create Modules, railway reservation system - 60 mins
posted on 3 Dec 2024
30min duration simple questions
Basic array 2 coding questions
posted on 11 Dec 2024
I applied via LinkedIn and was interviewed in Nov 2024. There were 3 interview rounds.
Basic DSA from the hacker rank website
I applied via Recruitment Consulltant and was interviewed in Sep 2024. There were 2 interview rounds.
HashSet is an unordered collection of unique elements, while Hashtable is a synchronized collection of key/value pairs.
HashSet does not allow duplicate elements, while Hashtable does not allow duplicate keys.
HashSet does not maintain insertion order, while Hashtable does not guarantee any order.
HashSet allows null values, while Hashtable does not allow null keys or values.
Collection is an interface in Java that represents a group of objects, while Collections is a utility class that contains static methods for operating on collections.
Collection is an interface in Java that represents a group of objects.
Collections is a utility class in Java that contains static methods for operating on collections.
Example: List
Example: Collections
Java program to find duplicates in an array of strings
Create a HashSet to store unique elements
Iterate through the array and check if element is already in the HashSet
If element is already in the HashSet, it is a duplicate
posted on 1 Jan 2025
LeetCode , hard questions on dynamic programming, graphs, and more.
DSA, Cn, os, DBMS, ML
based on 2 interviews
Interview experience
based on 2 reviews
Rating in categories
Software Developer
1k
salaries
| ₹8.5 L/yr - ₹32 L/yr |
Developer
859
salaries
| ₹10 L/yr - ₹34 L/yr |
Developer Associate
821
salaries
| ₹6.7 L/yr - ₹24 L/yr |
Senior Developer
486
salaries
| ₹13.1 L/yr - ₹48 L/yr |
Business Process Consultant
419
salaries
| ₹10 L/yr - ₹40 L/yr |
Oracle
SAS
Zoho
IBM