Filter interviews by
I applied via Approached by Company and was interviewed in May 2024. There were 4 interview rounds.
Basic array and vectors DSA questions
The last function I wrote calculates the factorial of a given number using recursion.
Uses a recursive approach to calculate factorial.
Base case: factorial(0) = 1.
Example: factorial(5) = 5 * factorial(4) = 120.
Handles positive integers only.
I applied via Naukri.com and was interviewed in Mar 2024. There was 1 interview round.
Oops concepts in Java refer to Object-Oriented Programming principles like Inheritance, Polymorphism, Encapsulation, and Abstraction.
Inheritance: Allows a class to inherit properties and behavior from another class.
Polymorphism: Allows objects to be treated as instances of their parent class.
Encapsulation: Bundling data and methods that operate on the data into a single unit.
Abstraction: Hides the implementation detail...
I appeared for an interview before Jan 2023.
Top trending discussions
I have a strong background in software engineering and a passion for innovation, making me a valuable asset to HSBC.
I have a proven track record of successfully delivering high-quality software solutions in previous roles.
I am highly skilled in various programming languages and technologies, including Java, Python, and SQL.
I have experience working in agile development environments, allowing me to adapt quickly to chan...
I appeared for an interview before Mar 2021.
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions on DSA and OS.
Design and implement a data structure for a Least Recently Used (LRU) cache that supports the following operations:
get(key)
- Retrieve the value associated with the...Design and implement a Least Recently Used (LRU) cache data structure that supports get and put operations with a specified capacity.
Implement a doubly linked list to keep track of the order of keys based on their usage.
Use a hashmap to store key-value pairs for quick access and updates.
When a key is accessed or updated, move it to the front of the linked list to mark it as the most recently used.
When the cache reaches...
Given an array of non-negative integers and an integer K representing the length of a subarray, your task is to determine the maximum elements for each subarray of size ...
Find the maximum elements for each subarray of size K in a given array.
Iterate through the array and maintain a deque to store the indices of elements in decreasing order.
Pop elements from the deque that are out of the current window.
Keep track of the maximum element in each subarray of size K.
Return the maximum elements for each subarray.
Virtual memory is a memory management technique that allows a computer to compensate for physical memory shortages by temporarily transferring data from RAM to disk storage.
Virtual memory allows programs to use more memory than is physically available on the system.
It helps in multitasking by allowing multiple programs to run simultaneously without running out of memory.
Virtual memory uses a combination of RAM and disk...
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.
Implement LRU cache
LRU stands for Least Recently Used
It is a cache eviction policy that removes the least recently used item
It can be implemented using a doubly linked list and a hash map
Newly accessed items are moved to the front of the list
When the cache is full, the item at the end of the list is removed
Virtual memory is a memory management technique that allows a computer to use more memory than it physically has.
Virtual memory uses a combination of RAM and hard disk space to store data.
It allows programs to use more memory than is physically available.
If a program tries to access memory that is not currently in RAM, it will be swapped in from the hard disk.
Even if we had infinite RAM, virtual memory would still be n...
Find maximum length of subarray where max <= 2*min.
Iterate through array and keep track of max and min values.
Update max length when condition is met.
Time complexity: O(n)
I applied via Naukri.com and was interviewed before Apr 2020. There were 3 interview rounds.
SCD Type 2 is a technique used to track historical changes in data over time in a data warehouse.
SCD Type 2 maintains a separate row for each change in data, with a start and end date.
It requires a surrogate key to uniquely identify each row.
Informatica provides a built-in SCD Type 2 transformation to implement this technique.
Example: tracking changes in customer addresses over time.
based on 4 interview experiences
Difficulty level
Duration
based on 35 reviews
Rating in categories
Senior Software Engineer
502
salaries
| ₹18.5 L/yr - ₹32 L/yr |
Software Engineer
332
salaries
| ₹11.1 L/yr - ₹20 L/yr |
Lead Software Engineer
117
salaries
| ₹24.9 L/yr - ₹40 L/yr |
Senior Associate Software Engineer
112
salaries
| ₹13.5 L/yr - ₹24 L/yr |
Software Developer
107
salaries
| ₹18.2 L/yr - ₹32 L/yr |
JPMorgan Chase & Co.
Wells Fargo
Citicorp
HSBC Group