Filter interviews by
I applied via campus placement at K J Somaiya College of Engineering, Mumbai and was interviewed in Sep 2024. There were 2 interview rounds.
They had given 10 MCQs questions based on OOPs(Java), 2 MCQs on SQL, 1 SQL Query to run and 1 DSA question to code based on Strings, so overall 14 question. Difficulty level was easy to Medium.
Sorting algorithms have different time complexities based on their implementation and efficiency.
Bubble Sort: O(n^2) - compares adjacent elements and swaps them if they are in the wrong order.
Merge Sort: O(n log n) - divides the array into two halves, sorts them, and then merges them.
Quick Sort: O(n log n) - picks a pivot element and partitions the array around the pivot.
Heap Sort: O(n log n) - builds a max heap and re...
Hashmaps and dictionaries are data structures used to store key-value pairs for efficient retrieval and storage.
Hashmaps and dictionaries are commonly used in programming to store and retrieve data based on a unique key.
They offer fast lookup times, typically O(1) on average, making them ideal for scenarios where quick access to data is required.
Examples of using hashmaps include storing user information with a unique ...
OOPs pillars are Abstraction, Encapsulation, Inheritance, and Polymorphism.
Abstraction: Hides complex implementation details and only shows necessary features. Example: Car dashboard displaying speed without showing internal engine details.
Encapsulation: Bundling data and methods that operate on the data into a single unit. Example: Class in Java encapsulates data members and member functions.
Inheritance: Allows a new ...
JOINS are used in SQL to combine rows from two or more tables based on a related column between them.
Inner Join: Returns rows when there is at least one match in both tables.
LEFT Join: Returns all rows from the left table, and the matched rows from the right table.
RIGHT Join: Returns all rows from the right table, and the matched rows from the left table.
FULL Join: Returns rows when there is a match in one of the table
Barclays is a global financial services company with a focus on innovation and technology.
Barclays is a leading global bank with a strong presence in the financial services industry.
Barclays is known for its commitment to innovation and technology in the financial sector.
Barclays offers a wide range of services including banking, investment management, and wealth management.
Barclays has a strong reputation for providin...
I manage stress by prioritizing tasks, breaking them down into smaller steps, and seeking help when needed.
Prioritize tasks based on deadlines and importance
Break down tasks into smaller, manageable steps
Seek help from team members or mentors when feeling overwhelmed
Practice time management and set realistic goals
posted on 9 Nov 2024
Easy to medium questions can be done easily
Medium to hard level coding question 2
posted on 4 Dec 2024
3 coding que easy,med and hard
Trapping rain water and median of two sorted array
posted on 22 Oct 2024
I applied via Company Website and was interviewed in Sep 2024. There was 1 interview round.
Authentication handling in microservices involves securing communication between services and managing user access.
Implement token-based authentication for secure communication between microservices
Use OAuth or JWT for authentication and authorization
Centralize authentication logic in a separate service to avoid duplication
Implement role-based access control to manage user permissions
The map function in Java 8 is used to transform each element of a stream using a given function.
Map function is a method in the Stream interface that applies a function to each element in the stream and returns a new stream with the transformed elements.
It is commonly used for converting or manipulating data in a stream without modifying the original data source.
Example: List
posted on 13 Sep 2024
posted on 31 May 2024
Simple algorithm question about sorting
The time complexity of the quicksort algorithm is O(n log n).
Quicksort has an average time complexity of O(n log n).
The best case time complexity of quicksort is O(n log n) when the pivot element divides the array into two equal halves.
The worst case time complexity of quicksort is O(n^2) when the pivot element is the smallest or largest element in the array.
posted on 21 Dec 2022
I applied via Referral and was interviewed in Apr 2023. There were 3 interview rounds.
The test was pretty straightforward tword east
Interview experience
Assistant Vice President
2.3k
salaries
| ₹17 L/yr - ₹45 L/yr |
Senior Analyst
1.1k
salaries
| ₹3 L/yr - ₹11.2 L/yr |
Assistant Manager
983
salaries
| ₹6.7 L/yr - ₹25 L/yr |
Process Advisor
930
salaries
| ₹1 L/yr - ₹8.3 L/yr |
Analyst
825
salaries
| ₹11.4 L/yr - ₹22 L/yr |
Deutsche Bank
Accenture
Amazon
Deloitte