Acko interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Acko
upvote
share-icon
2 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 3 Months
Topics: Arrays, Linked List, System Design, Graphs, OOPS
Tip
Tip

Tip 1 : Practice coding
Tip 2 : Try to write attractive resume
Tip 3 : Don't follow others blindly

Application process
Where: Company Website
Eligibility:
Resume Tip
Resume tip

Tip 1 : Don't lie on resume
Tip 2 : Write in one page with important details

Interview rounds

01
Round
Easy
Video Call
Duration90 minutes
Interview date7 Apr 2022
Coding problem2

This was an online coding round in our college. It contains 2 coding questions and 6-7 MCQs based on operating systems, data structures, and some other basic computer science topics. The test was around 90 minutes and those who were able to solve both coding questions completely are called for the next round of interviews. I don’t remember the exact coding questions but the first question was the simple stl(c++) implementation and the second question was a dynamic programming question.

1. Reverse the String

Easy
15m average time
85% success
0/40
Asked in companies
American ExpressHarman InternationalDelhivery

You are given a string 'STR'. The string contains [a-z] [A-Z] [0-9] [special characters]. You have to find the reverse of the string.

For example:

 If the given string is: STR = "abcde". You have to print the string "edcba".
follow up:
Try to solve the problem in O(1) space complexity. 
Problem approach

Using another string variable and traverse from end to start

Try solving now

2. Find Duplicates In Array

Easy
15m average time
90% success
0/40
Asked in companies
InfosysAckoIBM

You are given an array/list 'ARR' consisting of N integers, which contains elements only in the range 0 to N - 1. Some of the elements may be repeated in 'ARR'. Your task is to find all such duplicate elements.

Note:
1. All the elements are in the range 0 to N - 1.
2. The elements may not be in sorted order.
3. You can return the duplicate elements in any order.
4. If there are no duplicates present then return an empty array.
Problem approach

Use hashmap

Try solving now
02
Round
Easy
Video Call
Duration60 minutes
Interview date8 Apr 2022
Coding problem3

So, This was the technical interview held on Google meet. The interviewer asked me to share my screen and open the Visual Studio Code. After this, he introduced himself and asked me about my hobbies and how much you are active in competitive coding platforms. Then he came up with the coding questions: 

1. Delete a node from AVL tree

Easy
10m average time
90% success
0/40
Asked in companies
AckoOYOAmdocs

Given an AVL tree,delete an element in the AVL Tree.

An AVL tree is a self-balancing binary search tree.

It has the following properties:

It has the property of the binary search tree , i.e for every node , the nodes in its left subtree is less than the node and the node in the right subtree is greater than the current node.

The absolute difference between the height of left subtree and right subtree of any node is less than or equal to 1.

Read more about AVL Tree Here: https://en.wikipedia.org/wiki/AVL_tree

Note
1. Do not print anything, just return the root node of the tree.
2. Your constructed tree will be checked by doing an in-order traversal of the tree from the returned root node.
Try solving now

2. Equilibrium Index

Easy
0/40
Asked in companies
GoogleWalmartAdobe

You are given an array Arr consisting of N integers. You need to find the equilibrium index of the array.

An index is considered as an equilibrium index if the sum of elements of the array to the left of that index is equal to the sum of elements to the right of it.

Note:

1. The array follows 0-based indexing, so you need to return the 0-based index of the element.
2. Note that the element at the equilibrium index won’t be considered for either left sum or right sum.
3. If there are multiple indices which satisfy the given condition, then return the left-most index i.e if there are indices i,j,k…. which are equilibrium indices, return the minimum among them
4. If no such index is present in the array, return -1.
Try solving now

3. Closest Sum

Moderate
30m average time
70% success
0/80
Asked in companies
AmazonMicrosoftAcko

Given an array 'ARR'' of 'N' integers and an integer 'target', your task is to find three integers in 'ARR' such that the sum is closest to the target.

Note
In the case of two closest sums, print the smallest sum.
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

Which SQL keyword removes duplicate records from a result set?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
4 rounds | 6 problems
Interviewed by Acko
1337 views
0 comments
0 upvotes
company logo
SDE - 1
4 rounds | 6 problems
Interviewed by Acko
1070 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 4 problems
Interviewed by Acko
856 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 4 problems
Interviewed by Acko
605 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
107832 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
52130 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
32261 views
6 comments
0 upvotes