Filter interviews by
I applied via Campus Placement and was interviewed in Jul 2023. There were 2 interview rounds.
There were 13 MCQ questions on DSA, 17 MCQ aptitude questions, and 2 coding questions.
Check if after interleaving strings s1 and s2, we get s3 as one of the answers.
Create a recursive function to check all possible interleavings of s1 and s2
Check if the current interleaving matches s3
Return true if a valid interleaving is found, false otherwise
Cluster indexing physically reorders the data on disk to match the index, while non-cluster indexing does not.
Cluster indexing physically reorders the data on disk to match the index structure, leading to faster retrieval of data.
Non-cluster indexing creates a separate data structure that points to the actual data, which may result in slower retrieval times.
Cluster indexing is typically used in primary keys, while non-...
Stack memory is used for static memory allocation and follows a Last In First Out (LIFO) structure, while heap memory is used for dynamic memory allocation and has a more flexible structure.
Stack memory is limited in size and is typically faster to access compared to heap memory.
Variables stored in stack memory have a fixed size determined at compile time, while variables in heap memory can have a size determined at ru...
A stable sort is a sorting algorithm that preserves the relative order of equal elements in the sorted output.
Stable sorts are useful when the original order of equal elements needs to be maintained.
Examples of stable sorting algorithms include Merge Sort, Bubble Sort, and Insertion Sort.
In a stable sort, if two elements have the same key value, their relative order in the original array is preserved in the sorted arra
Time complexity of insertion in a hashmap is O(1).
Insertion in a hashmap has a constant time complexity of O(1) on average.
This is because hashmaps use a hashing function to determine the index where the key-value pair should be stored.
Even in the worst-case scenario, where there are collisions, the time complexity is still O(1) due to techniques like chaining or open addressing.
Example: Inserting a key-value pair into...
Hashing is a process of converting input data into a fixed-size string of bytes using a hash function.
Hashing is used to securely store passwords by converting them into a hash value.
Hashing is used in data structures like hash tables to quickly retrieve data based on a key.
Common hash functions include MD5, SHA-1, and SHA-256.
I applied via Naukri.com and was interviewed in Sep 2024. There were 3 interview rounds.
1 python question and 1 sql question for coding and rest were the mcqs based on sql and python.
I applied via Company Website and was interviewed in Sep 2024. There was 1 interview round.
Custom contracts in futures and forwards are agreements between two parties that are tailored to meet specific needs or requirements.
Custom contracts allow parties to negotiate terms such as quantity, price, delivery date, and other specifications.
These contracts are not standardized like exchange-traded futures and forwards, making them flexible and customizable.
Examples of custom contracts include over-the-counter (O
I applied via Recruitment Consulltant and was interviewed in Dec 2024. There was 1 interview round.
Arcesium interview questions for popular designations
Get interview-ready with Top Arcesium Interview Questions
posted on 31 May 2024
I was interviewed in May 2024.
Hacker rank test, coding for one big question, ample time given of around 90 mins
Design a historical pricing app for equity
Utilize a database to store historical pricing data for equities
Implement a user-friendly interface for users to search and view historical pricing
Include features such as chart visualization, comparison tools, and customizable date ranges
Consider incorporating real-time data updates and alerts for price changes
Design an app to bring data from external vendors in different formats
Create a data ingestion pipeline to collect data from various vendors
Implement data transformation processes to standardize formats
Utilize APIs or web scraping techniques to retrieve data from vendors
Use a database to store and manage the collected data
Implement data validation and cleansing techniques to ensure data quality
Was asked 30 mcq technical questions and one dsa question which as basic string based.
To remove a loop in a linked list, we can use Floyd's Cycle Detection Algorithm.
Use Floyd's Cycle Detection Algorithm to find the loop in the linked list.
Once the loop is detected, find the starting point of the loop using Floyd's algorithm.
Break the loop by setting the next pointer of the node before the starting point of the loop to null.
Implement a stack using two queues
Use two queues to simulate stack operations
Push operation: Enqueue the element to queue 1
Pop operation: Dequeue all elements from queue 1 to queue 2, dequeue the last element from queue 1, then swap the queues
Top operation: Return the front element of queue 1
Empty operation: Check if both queues are empty
I applied via Company Website and was interviewed in Jun 2024. There were 3 interview rounds.
3 questions, medium hard
I applied via Company Website and was interviewed in Jul 2024. There were 2 interview rounds.
Find the missing number in a permutation array
Iterate through the array and calculate the sum of all numbers
Calculate the sum of all numbers from 1 to n (where n is the length of the array)
Subtract the sum of the array from the sum of all numbers to find the missing number
To find a loop in a linked list, use Floyd's Cycle Detection Algorithm.
Use two pointers - slow and fast, where slow moves one step at a time and fast moves two steps at a time.
If there is a loop, the two pointers will eventually meet at some point within the loop.
To find the starting point of the loop, reset one pointer to the head and move both pointers one step at a time until they meet again.
Leetcode medium level questions, sql query, puzzle, test writing for api
I applied via Recruitment Consulltant and was interviewed in Jul 2024. There was 1 interview round.
Top trending discussions
The duration of Arcesium interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 54 interviews
Interview experience
based on 299 reviews
Rating in categories
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