Angel One SDE (Software Development Engineer) Interview Questions and Answers

Q1. It was an MCQ Round and the questions were a mixture of CS fundamentals topics.
Add your answer

This round contained 2 coding questions.

Q1. This was a one on one coding round where I was asked 3 questions that were of Easy to Medium level of LeetCode.
Add your answer

Q1. HR round was more of a technical interview round where I was asked about my android projects and some core android topics since both me and my interviewer were Android Developers.
Add your answer

3 coding question 1 SQL query

Q1. Question about tree check tree is bst or not ?write code on it
Add your answer
Q2. Array question find 1st repeated element in o(n).
Ans. 
Find the first repeated element in an array of strings in O(n) time complexity.
• Create a hash table to store the frequency of each element.

• Traverse the array and check if the element is already present in the hash table.

• If it is present, return the element as the first repeated element.

• If no element is repeated, return null or -1.

• Example: ['apple', 'banana', 'orange', 'apple'] => 'apple'
Answered by AI
Add your answer

Q1. Multiple of big integers and find complexity
Ans. 
Question about finding complexity of multiplying big integers.
• Big integers require more memory and processing power than regular integers.

• Multiplying two n-digit integers takes O(n^2) time using the standard algorithm.

• There are faster algorithms like Karatsuba and FFT which have lower complexity.

• The complexity of multiplying two n-digit integers using Karatsuba algorithm is O(n^log2(3)).

• The complexity of multiplying tw...read more
Answered by AI
Add your answer

Q1. Where do you see yourself in 5 years?
Add your answer
Q2. What are your strengths and weaknesses?
Add your answer
Q3. Tell me about yourself.
Add your answer

15 MCQs and 2 coding questions were given. MCQs include questions from topics like dbms, system design, oops etc.
1st coding question was of dp and 2nd was of a good question of graph.

Q1. Create a linked list from scratch and then delete a given node. Then print the linked list.
Ans. 
Create and delete a node in a linked list and print the updated list.
• Create a Node class with data and next pointer attributes

• Create a LinkedList class with head attribute and methods to add, delete and print nodes

• To delete a node, traverse the list and update the next pointer of the previous node to skip the node to be deleted

• Print the list by traversing and printing the data of each node
Answered by AI
Add your answer
Q2. Reverse first K(given) characters of string.
Ans. 
Reverse the first K characters of a given string.
• Take the first K characters of the string.

• Reverse the selected substring.

• Concatenate the reversed substring with the rest of the original string.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

test timing: 7-8 pm
2 programming questions
webcam proctored

Q1. 
Minimum Cost to Reach End Problem
You are provided with an array ARR of integers of size 'N' and an integer 'K'. The goal is to move from the starting index to the end of the array with the minimum possib...read more
Ans. 
Find minimum cost to reach end of array by jumping with constraints
• Use dynamic programming to keep track of minimum cost at each index

• Iterate through the array and update the minimum cost based on reachable indices within K steps

• Calculate cost to jump from current index to reachable indices and update minimum cost accordingly
Answered by AI
Add your answer

New market launch strategy

SQL intermediate level

Simple programming test from mettl website

Q1. First tech interview is also more of a coding round.
Add your answer
Q2. Questions on data structures in Java Multithreading Immutability
Add your answer

Q1. 2nd technical interview more of conceptual questions on related technology
Add your answer

Q1. Tech manager round based on previous project and scenario based questions
Add your answer

Q1. Salary discuss Why you want to join paytm
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

Nice environment

Q1. 
Zigzag Traversal of Binary Tree
Given a binary tree with integer values in its nodes, your task is to print the zigzag traversal of the tree.
Note:
In zigzag order, level 1 is printed from left to right...read more
Ans. 
Implement a function to print the zigzag traversal of a binary tree.
• Traverse the tree level by level, alternating the direction of traversal for each level.

• Use a queue to keep track of nodes at each level.

• Print the nodes in zigzag order as per the given pattern.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Nice Environment

Q1. 
Prime Numbers Identification
Given a positive integer N, your task is to identify all prime numbers less than or equal to N.
Explanation:
A prime number is a natural number greater than 1 that has no po...read more
Ans. 
Identify all prime numbers less than or equal to a given positive integer N.
• Iterate from 2 to N and check if each number is prime

• Use the Sieve of Eratosthenes algorithm for better efficiency

• Optimize by only checking up to the square root of N for divisors
Answered by AI
Add your answer
Q2. What was the use of DBMS in your project, and how did you handle the problems that arose?
Ans. 
DBMS was used to store and manage data in the project, handled problems by optimizing queries and database design.
• Used DBMS to store and manage project data efficiently

• Optimized queries for better performance

• Designed database schema to handle data effectively

• Resolved concurrency issues by implementing proper locking mechanisms
Answered by AI
Add your answer