Angel One Wealth interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Angel One Wealth
upvote
share-icon
2 rounds | 4 Coding problems

Interview preparation journey

expand-icon
Journey
Starting from the basics, I immersed myself in core concepts such as OOP, OS, DBMS, and DSA, while simultaneously practicing extensively on coding platforms for three months to sharpen my problem-solving skills. Additionally, I developed two projects to enhance my portfolio and gained hands-on experience as a Software Engineer at Freo. When I appeared for the Angel One Wealth interview, it consisted of two technical rounds and one HR round. Although I eventually managed to solve the problems, the experience was a valuable learning opportunity, especially in debugging under pressure. While I didn’t secure the position, the process emphasized the importance of preparation, persistence, and adaptability.
Application story
I applied to Angel One Wealth through Instahyre. After being shortlisted, I was invited for the interview process, which consisted of two technical rounds. The process was conducted online and focused on problem-solving, coding skills, and my understanding of core concepts.
Why selected/rejected for the role?
I was rejected for this role because, although I eventually solved the coding problems, I made several syntax errors during the process, reflecting a lack of fluency under pressure. Additionally, after starting my role in my company, I focused more on hands-on work and less on practicing DSA regularly, which impacted my problem-solving speed and confidence during the interview. This experience highlighted the importance of consistent DSA practice alongside work.
Preparation
Duration: 6 months
Topics: Data Structures, Algorithms, OOPS, System Design, Operating Systems, DBMS, Dynamic Programming
Tip
Tip

Tip 1 :Practice at least 250 DSA questions on online coding platforms.
Tip 2 : Build at least 2 real-world projects to demonstrate your development skills.
Tip 3 :Revise core CS fundamentals like OOPS, OS, DBMS, and System Design thoroughly.

Application process
Where: Other
Eligibility: NA, (Salary package: 15 LPA)
Resume Tip
Resume tip

Tip 1: Highlight key projects and achievements that showcase your technical skills and impact.
Tip 2: Keep your resume concise, error-free, and tailored to the job description with relevant keywords.

Interview rounds

01
Round
Medium
Telephonic
Duration60 minutes
Interview date23 Oct 2024
Coding problem3

Timing: The interview was conducted in the afternoon, around 2 PM, so it wasn’t too late.
Environment: It was an online interview, and the environment was professional and focused. There were no significant distractions during the session.
Significant Activity: The interviewer emphasized problem-solving approach and time management. At one point, the interviewer gave feedback on my approach and asked for optimization after I solved a problem, which added to the learning experience.
Interviewer: The interviewer was knowledgeable and patient. He was friendly but kept the pace brisk, which kept me on my toes throughout the interview.

1. Heaps – Min-Heap vs Max-Heap

The interviewer asked to explain the difference between min-heaps and max-heaps. (Learn)
I was asked to demonstrate how min-heaps always give the smallest value in the data structure, while max-heaps return the greatest value.
The interviewer gave a follow-up question on what gets swapped when inserting or deleting elements from heaps and how heap property is maintained.

Problem approach

Tip 1:General knowledge of heaps in algorithms (common topic in competitive programming)

2. Convert Sorted Array to BST

Easy
15m average time
85% success
0/40
Asked in companies
WalmartAngel One WealthUST Global

The problem involved constructing a balanced binary search tree (BST) from a sorted array.
The middle element of the array should be the root, and the left and right subtrees should be formed by recursively repeating this process for the left and right halves of the array.

Problem approach

Typical algorithm for constructing a balanced BST from sorted data, based on divide-and-conquer strategy

Try solving now

3. External Sorting

The interviewer gave a problem where the task was to sort a large file (e.g., 100 GB) that exceeds available RAM. (Learn)
I was asked to divide the file into smaller chunks, sort them individually, and then merge them into one sorted output file using pointers.

Problem approach

This is a well-known problem in external sorting, often used in scenarios dealing with large datasets.

02
Round
Easy
Telephonic
Duration60 minutes
Interview date5 Nov 2024
Coding problem1

Timing: The second round was scheduled for 5 PM in the evening, one week after the first round. It was expected to last around 60 minutes, but the interviewer took a bit longer.

Environment: The interview was conducted online. The environment was professional, and the interviewer was focused and direct.

Significant Activity: The interviewer initially intended to ask one question and spend around 30 minutes on it, but the question took more time as I had to troubleshoot and fix syntax errors during my coding process.

Interviewer: The interviewer was patient and helpful when I faced difficulties. He gave me time to think through the problem and write the code but emphasized clean and efficient coding. By the end of the round, I was able to write the correct code, but I felt that my performance could have been better with more practice.

1. Implementing Singly Linked List

The problem required implementing a basic singly linked list. (Learn)
I was asked to write the code to create nodes, insert elements, and traverse the list.
The interviewer asked me to handle edge cases like an empty list or a list with a single node.

Problem approach

I defined a Node class with pointers to store data and the next node.
I implemented methods for inserting nodes, traversing the list, and displaying the elements.
I managed edge cases by checking for null conditions and updating the head pointer appropriately.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
8518 views
0 comments
0 upvotes
Analytics Consultant
3 rounds | 10 problems
Interviewed by ZS
907 views
0 comments
0 upvotes
company logo
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
3320 views
0 comments
0 upvotes
company logo
SDE - 2
4 rounds | 6 problems
Interviewed by Expedia Group
2580 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
114579 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
57825 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
34961 views
7 comments
0 upvotes