Filter interviews by
I appeared for an interview in Aug 2021.
Round duration - 60 Minutes
Round difficulty - Medium
Interview was scheduled in afternoon. It was more on OOPs and DSA.
Given a singly linked list of integers, determine if the linked list is a palindrome.
A linked list is considered a palindrome if it reads the same forwar...
Check if a given singly linked list of integers is a palindrome or not.
Traverse the linked list to find the middle element using slow and fast pointers.
Reverse the second half of the linked list.
Compare the first half with the reversed second half to determine if it's a palindrome.
Round duration - 20 Minutes
Round difficulty - Easy
She asked me more about myself and few projects in resume. It was more of formal discussion than an interview round. I was very comfortable and she aksed me about my location preference at end of. Interview.
Tip 1 : BlackRock has so many projects in Java, So I made sure I clear my basics and prepare well for each and every question about Java
Tip 2 : OOPS is something which was being asked from everyone and every seniors confirmed the same.
Tip 3 : Have good projects, preferably in development.
Tip 1 : Have at least 2 projects.
Tip 2 : Include certifications.
I applied via Referral and was interviewed in Nov 2020. There were 5 interview rounds.
I applied via Company Website and was interviewed before Oct 2019. There were 4 interview rounds.
I applied via Campus Placement and was interviewed before Aug 2021. There was 1 interview round.
Data structure is a way of organizing and storing data in a computer so that it can be accessed and used efficiently.
Data structures are used to manage large amounts of data efficiently.
They can be implemented using arrays, linked lists, trees, graphs, and other techniques.
Examples include stacks, queues, hash tables, and binary search trees.
Choosing the right data structure for a particular problem is important for op...
Stack and Queue are used in real-time systems for managing tasks and events.
Stack is used for managing function calls, undo/redo operations, and backtracking.
Queue is used for managing events, scheduling tasks, and buffering data.
Real-time systems use both data structures for managing tasks and events in a time-sensitive manner.
Examples include task scheduling in operating systems, event handling in GUI applications, a
I applied via Walk-in and was interviewed before Apr 2021. There were 3 interview rounds.
Pickling is a process of serializing and de-serializing Python objects into a byte stream.
Pickling is used to store Python objects in a file or transfer them over a network.
The pickle module in Python is used for pickling and unpickling.
The pickled data can be stored in a file or transferred over a network.
The pickled data can be easily unpickled to get back the original Python object.
I applied via Referral and was interviewed before Oct 2020. There were 3 interview rounds.
A stack is a data structure that follows the Last In First Out (LIFO) principle.
Elements are added and removed from the top of the stack.
Common operations include push (add element) and pop (remove element).
Stacks are used in programming for function calls, expression evaluation, and more.
DOM stands for Document Object Model. It is a programming interface for web documents.
DOM is a tree-like structure that represents the HTML or XML document.
It allows developers to manipulate the content and structure of a web page using scripting languages like JavaScript.
DOM provides a way to access and modify the elements, attributes, and text content of a web page.
It also allows developers to add or remove elements ...
An interface is a contract between two components that defines the communication between them.
An interface defines a set of methods that a class must implement.
Interfaces allow for polymorphism and loose coupling.
Interfaces can be used to define common behavior for unrelated classes.
Examples include the Java Collection interface and the USB interface.
Insertion sort is a simple sorting algorithm that iterates through an array and places each element in its correct position. Merge sort is a divide and conquer algorithm that divides an array into two halves, sorts them separately, and then merges them back together.
Insertion sort has a time complexity of O(n^2) while merge sort has a time complexity of O(n log n)
Insertion sort is efficient for small data sets while me...
based on 5 reviews
Rating in categories
Senior Consultant
721
salaries
| ₹11.1 L/yr - ₹37 L/yr |
Application Developer
646
salaries
| ₹6.8 L/yr - ₹19 L/yr |
Lead Consultant
248
salaries
| ₹23 L/yr - ₹65 L/yr |
Consultant
163
salaries
| ₹8 L/yr - ₹21.8 L/yr |
Software Developer
108
salaries
| ₹6 L/yr - ₹22 L/yr |
TCS
Infosys
Wipro
HCLTech