Filter interviews by
Clear (1)
It was an on campus coding and aptitude test.
Find the nearest index of a character in a string for each index.
Create an array of strings to store the results.
Loop through each character in the string.
For each character, loop through the rest of the string to find the nearest index of the same character.
Store the result in the array.
Minimum weight to reach bottom right corner in matrix starting from top left. You can move only down and right.
Use dynamic programming to solve the problem efficiently
Create a 2D array to store the minimum weight to reach each cell
The minimum weight to reach a cell is the minimum of the weight to reach the cell above and the cell to the left plus the weight of the current cell
The minimum weight to reach the bottom righ...
Find the missing number in an array of integers from 1 to n.
Create a hash set to store the numbers in the array
Loop through the numbers from 1 to n and check if they are in the hash set
Return the number that is not in the hash set
Topological Sort is a linear ordering of vertices in a directed acyclic graph.
It is used to find a linear ordering of elements that have dependencies.
It is based on the concept of DFS (Depth First Search).
It can be implemented using both DFS and BFS (Breadth First Search).
It is commonly used in scheduling jobs, resolving dependencies, and compiling code.
Example: Topological sorting of courses to take in a college based
A 2 player chess game with standard rules and GUI
Implement standard chess rules and moves
Create a GUI for players to interact with the game
Allow players to make moves and track game progress
Incorporate checkmate and stalemate conditions
Implement a timer for each player's turn
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 was interviewed in Sep 2017.
I was interviewed 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.
I applied via Campus Placement and was interviewed before Sep 2020. There were 5 interview rounds.
I applied via Referral and was interviewed in May 2021. There was 1 interview round.
I applied via Referral and was interviewed in Jun 2021. There were 4 interview rounds.
Senior Analyst
318
salaries
| ₹0 L/yr - ₹0 L/yr |
Analyst
314
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
227
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
186
salaries
| ₹0 L/yr - ₹0 L/yr |
Financial Analyst
153
salaries
| ₹0 L/yr - ₹0 L/yr |
Edelweiss
JPMorgan Chase & Co.
Goldman Sachs
Morgan Stanley