Anukta IT Solutions interview experience Real time questions & tips from candidates to crack your interview

Software Developer

Anukta IT Solutions
upvote
share-icon
2 rounds | 2 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 3 months
Topics: Tree, Vector, Hashmap, Algorithms, OOPS, Data structure
Tip
Tip

Tip 1 : Learn and understand the deep logic 
Tip 2 : Do practice as much as possible that makes you perfect and you will remember all your concepts always
Tip 3 : Practice DSA regularly

Application process
Where: Campus
Eligibility: 6.5 CGPA
Resume Tip
Resume tip

Tip 1 : Mention your key skill, don't add anything that you didn't know
Tip 2 : For fresher make it one page only

Interview rounds

01
Round
Hard
Online Coding Interview
Duration60 minutes
Interview date22 Oct 2021
Coding problem1

They had asked one coding question related to trees. It was scheduled on google meet making it proctored.

1. Bottom View Of Binary Tree

Moderate
10m average time
90% success
0/80
Asked in companies
OYOMicrosoftAmazon

You are given a 'Binary Tree'.


Return the bottom view of the binary tree.


Note :
1. A node will be in the bottom-view if it is the bottom-most node at its horizontal distance from the root. 

2. The horizontal distance of the root from itself is 0. The horizontal distance of the right child of the root node is 1 and the horizontal distance of the left child of the root node is -1. 

3. The horizontal distance of node 'n' from root = horizontal distance of its parent from root + 1, if node 'n' is the right child of its parent.

4. The horizontal distance of node 'n' from root = horizontal distance of its parent from the root - 1, if node 'n' is the left child of its parent.

5. If more than one node is at the same horizontal distance and is the bottom-most node for that horizontal distance, including the one which is more towards the right.


Example:
Input: Consider the given Binary Tree:

alt text

Output: 4 2 6 3 7

Explanation:
Below is the bottom view of the binary tree.

alt text

1 is the root node, so its horizontal distance = 0.
Since 2 lies to the left of 0, its horizontal distance = 0-1= -1
3 lies to the right of 0, its horizontal distance = 0+1 = 1
Similarly, horizontal distance of 4 = Horizontal distance of 2 - 1= -1-1=-2
Horizontal distance of 5 = Horizontal distance of 2 + 1=  -1+1 = 0
Horizontal distance of 6 = 1-1 =0
Horizontal distance of 7 = 1+1 = 2

The bottom-most node at a horizontal distance of -2 is 4.
The bottom-most node at a horizontal distance of -1 is 2.
The bottom-most node at a horizontal distance of 0 is 5 and 6. However, 6 is more towards the right, so 6 is included.
The bottom-most node at a horizontal distance of 1 is 3.
The bottom-most node at a horizontal distance of 2 is 7.

Hence, the bottom view would be 4 2 6 3 7


Problem approach

I solved it using the vector concept.

Try solving now
02
Round
Medium
Online Coding Test
Duration60 minutes
Interview date24 Oct 2021
Coding problem1

Interviewer is the director of the company. She is a very good lady and remained very polite during the whole interview.

1. Magical Numbers

Moderate
60m average time
50% success
0/80
Asked in companies
Anukta IT SolutionsFlipkart limited

You are given three integers ‘A’, ‘B’ and ’K’. Your task is to find the number of Magical Numbers between ‘A’ and ‘B’(inclusive). A number ‘N’ is said to be a magical number if the sum of its digits is prime and the number ‘N’ is divisible by ‘K’.

For example:

Forgiven A = 10, B = 15 and K = 2.
12 and 14 are magical numbers because the sum of digits of 12 and 14 is a prime number, also 12 and 14 both are divisible by 2.  
Problem approach

You have to get a magic number.
Steps:
* do the square of each digit of a number
* do the sum of all square 
* divide by 9 if you will get less than 9 then return answer other wise repeat the process

Try solving now

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
3 rounds | 7 problems
Interviewed by OYO
4657 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 3 problems
Interviewed by Amazon
961 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
6451 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
3452 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Software Developer
3 rounds | 3 problems
Interviewed by HCL Technologies
3394 views
1 comments
0 upvotes
company logo
Software Developer
3 rounds | 6 problems
Interviewed by Arcesium
1684 views
0 comments
0 upvotes
company logo
Software Developer
3 rounds | 5 problems
Interviewed by HCL Technologies
4080 views
0 comments
0 upvotes