Arcesium Interview Questions, Process, and Tips

Q1. What do you know About CDS?
Add your answer

Hacker rank test, coding for one big question, ample time given of around 90 mins

Q1. Basics of current project
Add your answer
Q2. Design historical pricing app for equity
Ans. 
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
Answered by AI
Add your answer

Q1. Project discussion
Add your answer
Q2. Design a app which will bring data from lot of external vendors in different formats
Ans. 
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
Answered by AI
Add your answer

Q1. Project discussion
Add your answer
Q2. Role discussion and team fitment
Add your answer

Was asked 30 mcq technical questions and one dsa question which as basic string based.

Q1. Remove a loop in linked list
Ans. 
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.
Answered by AI
Add your answer
Q2. Implement stack using queues
Ans. 
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
Answered by AI
Add your answer

3 questions, medium hard

Q1. Greedy Algorithm, simple jumps question, easily approachable by greedy algorithm
Add your answer
Q2. Binary Search, simple array based
Add your answer

Q1. DBMS, Projects, SQL Queries
Add your answer
Q2. 2 coding questions
Add your answer

Q1. Find the missing number in a permutation array
Ans. 
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
Answered by AI
Add your answer
Q2. Find if there is a loop in linked list
Ans. 
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.
Answered by AI
Add your answer

Leetcode medium level questions, sql query, puzzle, test writing for api

Q1. Basic to Intermediate SQL Based questions
Add your answer
Q2. Basic to Intermediate Python Based questions
Add your answer