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

SDE - Intern

Acko
upvote
share-icon
3 rounds | 4 Coding problems

Interview preparation journey

expand-icon
Journey
My coding Journey started in my first year of college. Like most people, I was also new to coding and didn't know much about it, but I was curious and passionate about learning about it.
Application story
Acko came on campus for hiring. The role was SDE-Intern, and PPO was performance-based. Most of the colleges applied for it. After taking the online assessment, the company shortlisted 60 students. Now, after taking 1 round, the number of students left was 30; after two rounds, that was the final round. Acko selected 13 students from our college.
Why selected/rejected for the role?
I got selected for this role. The person interviewing me later became my manager in Acko. He told me that he took three interviews from my college, and mine was the best because I had clarity about my projects and was confident.
Preparation
Duration: 1 year
Topics: Data Structures and algorithms, OOPS, DBMS, CN, System Design
Tip
Tip

Tip 1: Solve at least 500 medium-level questions; it will help you crack interviews.
Tip 2: Do at least two good projects to help shortlist your resume.

Application process
Where: Campus
Eligibility: No
Resume Tip
Resume tip

Tip 1: Have some Eye-catching projects.
Tip 2: Mention the coding profile links and achievements, if any.

Interview rounds

01
Round
Medium
Online Coding Interview
Duration120 minutes
Interview date3 Aug 2022
Coding problem2

It was Online Assessment round.

1. Delete Node In BST

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

You have been given a Binary Search Tree of integers with ‘N’ nodes. You are also given data of a node of this tree. Your task is to delete the given node from the BST.


A binary search tree (BST) is a binary tree data structure that has the following properties:

• The left subtree of a node contains only nodes with data less than the node’s data.

• The right subtree of a node contains only nodes with data greater than the node’s data.

• Both the left and right subtrees must also be binary search trees.
Example:
For the given BST, if we want to delete the node with data 5 :

Input

The modified BST will be:

Ouput

Please notice that another valid answer is:

Output

Note :

1. The node which we want to delete will always be present in the given tree.

2. If after deletion the tree becomes empty, print -1.
Try solving now

2. 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
02
Round
Medium
Video Call
Duration60 minutes
Interview date11 Aug 2022
Coding problem1

It was in afternoon.1 hour interview

1. LCA of Two Nodes In A BST

Moderate
15m average time
85% success
0/80
Asked in companies
Morgan StanleyShareChatSamsung

You are given a binary search tree of integers with N nodes. You are also given references to two nodes 'P' and 'Q' from this BST.


Your task is to find the lowest common ancestor(LCA) of these two given nodes.


The lowest common ancestor for two nodes P and Q is defined as the lowest node that has both P and Q as descendants (where we allow a node to be a descendant of itself)


A binary search tree (BST) is a binary tree data structure which has the following properties.

• The left subtree of a node contains only nodes with data less than the node’s data.
• The right subtree of a node contains only nodes with data greater than the node’s data.
• Both the left and right subtrees must also be binary search trees.


For example:
'P' = 1, 'Q' = 3
tree = 2 1 4 -1 -1 3 -1 -1 -1,

The BST corresponding will be- 

Here, we can clearly see that LCA of node 1 and node 3 is 2.
Try solving now
03
Round
Medium
Video Call
Duration60 minutes
Interview date24 Aug 2022
Coding problem1

It was a kind of discussion round with some technical questions. I was grilled hard on projects and other skills mentioned on my resume.

1. Reverse Words In A String

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

You are given a string 'str' of length 'N'.


Your task is to reverse the original string word by word.


There can be multiple spaces between two words and there can be leading or trailing spaces but in the output reversed string you need to put a single space between two words, and your reversed string should not contain leading or trailing spaces.


Example :
If the given input string is "Welcome to Coding Ninjas", then you should return "Ninjas Coding to Welcome" as the reversed string has only a single space between two words and there is no leading or trailing space.
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 - Intern
2 rounds | 2 problems
Interviewed by Acko
900 views
0 comments
0 upvotes
company logo
SDE - Intern
4 rounds | 7 problems
Interviewed by Acko
1924 views
0 comments
0 upvotes
company logo
SDE - Intern
4 rounds | 10 problems
Interviewed by Acko
1381 views
0 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 7 problems
Interviewed by Acko
865 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
13919 views
4 comments
0 upvotes
company logo
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
13231 views
1 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
9230 views
2 comments
0 upvotes