Filter interviews by
I applied via LinkedIn and was interviewed in Dec 2023. There were 3 interview rounds.
Httpclient implementation for getting response feed from an GitHub api , parse response and print
Test was easy, basic gk and finance knowledge was asked too
I applied via campus placement at Thapar Institute of Engineering and Technology (TIET) 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 Mar 2024. There was 1 interview round.
Design an online hotel booking system
User-friendly interface for searching and booking hotels
Secure payment gateway integration
Ability to filter search results based on price, location, amenities, etc.
Real-time availability updates
Confirmation emails and booking details
User reviews and ratings for hotels
Integration with mapping services for location details
Arcesium interview questions for popular designations
I applied via campus placement at Institute of Management Nirma University, Ahmedabad and was interviewed before Sep 2023. There were 2 interview rounds.
Derivatives Heavy with Macro Economic and Pricing Strategies
Black Scholes Pricing of Derivatives is a mathematical model used to calculate the theoretical price of European-style options.
Developed by Fischer Black, Myron Scholes, and Robert Merton in 1973.
Factors in the current stock price, strike price, time to expiration, volatility, risk-free interest rate, and dividends.
Assumes the option can only be exercised at expiration (European-style).
Used to determine the fair market...
I would ensure the elephant is well taken care of and find a suitable environment for it.
Research proper care and diet for elephants
Find a reputable sanctuary or zoo to transfer the elephant to
Ensure the elephant's well-being and safety at all times
Get interview-ready with Top Arcesium Interview Questions
Hard 2 questions in 45 mins
I applied via Naukri.com and was interviewed in Mar 2024. There was 1 interview round.
Aptitude and coding, lots of math and studying suggest you get familiar with everything
Wildcard in Excel is a symbol used to represent one or more characters in a search string.
Wildcards include * (asterisk) for multiple characters and ? (question mark) for a single character.
Example: 'te*t' can match 'test' or 'text'.
Wildcards are commonly used in functions like VLOOKUP and SUMIF.
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 Referral and was interviewed in Aug 2023. There were 2 interview rounds.
Leetcode practice should be sufficient to tackle this round.
Trapping Rain Water problem involves calculating the amount of water that can be trapped between buildings given their heights.
Calculate the maximum height of buildings to the left and right of each building
Find the minimum of the two heights
Subtract the height of the current building to get the amount of water that can be trapped at that building
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 296 reviews
Rating in categories
Senior Analyst
316
salaries
| ₹9 L/yr - ₹28.5 L/yr |
Analyst
313
salaries
| ₹7.6 L/yr - ₹20 L/yr |
Senior Software Engineer
221
salaries
| ₹15 L/yr - ₹42 L/yr |
Software Engineer
186
salaries
| ₹9 L/yr - ₹33 L/yr |
Financial Analyst
153
salaries
| ₹7.5 L/yr - ₹19 L/yr |
Edelweiss
JPMorgan Chase & Co.
Goldman Sachs
Morgan Stanley