Filter interviews by
Futures and forward contracts are financial agreements to buy or sell an asset at a specified price on a future date.
Futures contracts are standardized and traded on exchanges, while forward contracts are customized and traded over-the-counter.
Both contracts involve an agreement to buy or sell an asset at a predetermined price on a future date.
Futures contracts require daily settlement of gains and losses, while f...
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 ...
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...
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
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
Find the lowest common ancestor of a binary tree.
Traverse the tree recursively from the root node.
If the current node is null or matches either of the given nodes, return the current node.
Recursively search for the nodes in the left and right subtrees.
If both nodes are found in different subtrees, return the current node.
If both nodes are found in the same subtree, continue the search in that subtree.
Find first missing positive integer from an array of non-negative integers.
Create a hash set to store all positive integers in the array
Loop through the array and add all positive integers to the hash set
Loop through positive integers starting from 1 and return the first missing integer not in the hash set
Group list of strings into distinct anagrams.
Create a hash table with sorted string as key and list of anagrams as value.
Iterate through the list of strings and add each string to its corresponding anagram list in the hash table.
Return the values of the hash table as a list of lists.
Design a parking lot
Consider the size and capacity of the parking lot
Decide on the layout and organization of parking spaces
Implement a system to manage parking availability and reservations
Include features like ticketing, payment, and security
Consider scalability and future expansion
I applied via LinkedIn and was interviewed in Mar 2024. There were 3 interview rounds.
Finance and derivates
An MBA provides a well-rounded business education, networking opportunities, and career advancement potential.
An MBA helps develop a strong foundation in business principles and practices.
It offers opportunities to network with industry professionals and alumni.
Having an MBA can lead to higher earning potential and career advancement.
Specializations in areas like finance, marketing, or entrepreneurship can provide focu...
I am a dedicated and motivated individual with a strong background in finance and a proven track record of success.
I have a solid understanding of financial principles and have excelled in relevant coursework
I have previous internship experience in finance where I successfully completed projects and contributed to the team
I am a quick learner and eager to expand my knowledge and skills in the finance industry
I applied via Naukri.com and was interviewed in May 2023. There were 5 interview rounds.
30 Mins Test, Questions related to Aptitude, Options and Finance
I applied via Campus Placement
45 mins; asked me two questions that were Leetcode Medium => Product of Array Except Self (Was asked to keep optimize till O(n) time & O(1) space & Generate all possible subsequences of an integer array.
Simple DP on grids question & how to further optimize it; also a puzzle
I applied via Approached by Company and was interviewed in Feb 2023. There were 3 interview rounds.
Hackerrank test, fairly simple coding problems
I have extensive exposure to the financial domain.
I have worked as a Product Manager for a financial services company for 3 years.
I have experience in developing and launching financial products such as credit cards, loans, and savings accounts.
I have a good understanding of financial regulations and compliance requirements.
I have collaborated with cross-functional teams including finance, legal, and compliance to ensu...
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
I applied via Campus Placement and was interviewed before Sep 2022. There were 3 interview rounds.
2 hrs, topics : mcq + 2 coding ques, mettl
Left view of a binary tree is the set of nodes visible when the tree is viewed from the left side.
Traverse the tree level by level from left to right
At each level, add the first node encountered to the result array
Continue this process until all levels are traversed
I applied via Company Website and was interviewed before Mar 2023. There were 4 interview rounds.
Derivatives, Economics,Finance, General Awareness, Logical Reasoning
Futures and forward contracts are financial agreements to buy or sell an asset at a specified price on a future date.
Futures contracts are standardized and traded on exchanges, while forward contracts are customized and traded over-the-counter.
Both contracts involve an agreement to buy or sell an asset at a predetermined price on a future date.
Futures contracts require daily settlement of gains and losses, while forwar...
Beta is a measure of a stock's volatility, required return is the minimum return an investor expects, methods include CAPM and DDM.
Beta measures a stock's volatility in relation to the market.
Required return is the minimum return an investor expects to compensate for the risk of an investment.
Methods of calculating required return include Capital Asset Pricing Model (CAPM) and Dividend Discount Model (DDM).
CAPM formula...
After a stock split, the value of options will be adjusted based on the new stock price and the split ratio.
Value of options will be adjusted based on the new stock price and the split ratio
Number of options will increase proportionally to the split ratio
Strike price of options will decrease proportionally to the split ratio
I appeared for an interview in Aug 2021.
Round duration - 45 minutes
Round difficulty - Medium
2 coding questions were given to solve in 45 minutes.
You are given a binary tree of integers. Your task is to determine the left view of the binary tree. The left view consists of nodes that are visible when the tree...
The task is to determine the left view of a binary tree, which consists of nodes visible when viewed from the left side.
Traverse the binary tree in a level order manner and keep track of the leftmost node at each level.
Use a queue to perform level order traversal of the binary tree.
Maintain a count of nodes at each level to identify the leftmost node.
Return the leftmost nodes at each level as the left view of the binar...
You are given a non-empty grid that consists of only 0s and 1s. Your task is to determine the number of islands in this grid.
An island is defined as a group of 1s (re...
The task is to determine the number of islands in a grid consisting of 0s and 1s.
Iterate through the grid and perform depth-first search (DFS) to find connected 1s.
Mark visited 1s as 0 to avoid counting them again.
Increment the island count each time a new island is found.
Consider all 8 adjacent cells (horizontally, vertically, diagonally) while performing DFS.
Handle edge cases like out of bounds and already visited ce...
Round duration - 60 minutes
Round difficulty - Medium
This was a 60 min technical interview round. The interviewer asked me to code 2 programming questions.
Tip : Practice more to clear DSA problems. Medium level questions will be enough to clear the rounds.
Given a Directed Acyclic Graph (DAG) consisting of V
vertices and E
edges, your task is to find any topological sorting of this DAG. You need to return an array of size ...
Implement a function to find any topological sorting of a Directed Acyclic Graph (DAG).
Use Depth First Search (DFS) to traverse the graph and add vertices to the result in reverse order of finishing times.
Maintain a visited array to keep track of visited vertices to avoid revisiting them.
Start DFS from any unvisited vertex and recursively explore its neighbors.
Once all neighbors are visited, add the current vertex to t...
You are provided with a Singly Linked List containing integers. Your task is to determine the N-th node from the end of the list.
If the list is...
Find the N-th node from the end of a Singly Linked List containing integers.
Traverse the list to find the length L of the list.
Calculate the position of the N-th node from the beginning as L - N + 1.
Traverse the list again to reach the calculated position and return the node's value.
Handle edge cases like N being equal to 1 or equal to the length of the list.
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 appeared for an interview in Jul 2021.
Round duration - 45 minutes
Round difficulty - Medium
It was an online coding round where we were supposed to solve 2 coding questions in 45 minutes.
Given the schedule of N meetings with their start time Start[i]
and end time End[i]
, you need to determine which meetings can be organized in a single meeting room such ...
Given N meetings with start and end times, determine the maximum number of meetings that can be organized in a single room without overlap.
Sort the meetings based on their end times.
Iterate through the sorted meetings and select the first meeting that does not overlap with the previous one.
Repeat the process until all meetings are considered.
Return the selected meetings in the order they are organized.
You are given 'N' ropes, each of varying lengths. The task is to connect all ropes into one single rope. The cost of connecting two ropes is the sum of their lengths. Yo...
Given 'N' ropes of varying lengths, find the minimum cost to connect all ropes into one single rope.
Sort the lengths of ropes in ascending order.
Keep connecting the two shortest ropes at each step.
Update the total cost by adding the lengths of the connected ropes.
Repeat until all ropes are connected.
Return the total cost as the minimum cost to connect all ropes.
Round duration - 60 minutes
Round difficulty - Medium
The interview was conducted online. The interviewer asked me 2 programming questions and questions on OOPS concepts.
Given a binary tree, determine and return its bottom view when viewed from left to right. Assume that each child of a node is positioned at a 45-degree angle from its parent.
N...
Given a binary tree, return the bottom view of the tree when viewed from left to right.
Traverse the tree level by level and keep track of the horizontal distance of each node from the root.
For each horizontal distance, store the node with the maximum depth in a map.
After traversing the entire tree, return the values of the map in sorted order of their horizontal distance.
Given a binary tree of integers, your task is to implement serialization and deserialization methods. You can choose any algorithm for serialization...
Implement serialization and deserialization methods for a binary tree of integers.
Use level order traversal for serialization and deserialization.
Use -1 to represent null nodes in the binary tree.
Ensure the serialized string can be correctly decoded back to form the original binary tree.
Virtual destructors in C++ are used to ensure that the correct destructor is called when deleting an object through a base class pointer.
Virtual destructors are declared with the 'virtual' keyword in the base class to allow proper cleanup of derived class objects.
When deleting an object through a base class pointer, having a virtual destructor ensures that the destructor of the derived class is called.
Without a virtual...
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 4 : One should have strong DSA skills and knowledge of Basic OOPS. Its not necessary to learn OS and DBMS if it's not taught in your college yet.
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 in Jul 2021. There were 3 interview rounds.
Interview questions for Software Developer Intern
Maximum meetings in one room can be calculated using greedy approach
Bottom view of tree can be obtained using level order traversal and a map to store horizontal distance
Serialization and deserialization of binary tree can be done using preorder traversal
Virtual destructor in Java is automatically called while in C++ it needs to be explicitly defined
Top trending discussions
Some of the top questions asked at the Arcesium interview for freshers -
The duration of Arcesium interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 5 interview experiences
Difficulty level
Duration
based on 336 reviews
Rating in categories
Hyderabad / Secunderabad
7-12 Yrs
Not Disclosed
Senior Analyst
385
salaries
| ₹14.6 L/yr - ₹25.4 L/yr |
Analyst
327
salaries
| ₹10.2 L/yr - ₹19 L/yr |
Senior Software Engineer
252
salaries
| ₹25 L/yr - ₹43 L/yr |
Manager
162
salaries
| ₹23 L/yr - ₹38.5 L/yr |
Software Engineer
157
salaries
| ₹18 L/yr - ₹33 L/yr |
ITC Infotech
CMS IT Services
KocharTech
3i Infotech