Acko interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Acko
2 rounds | 4 Coding
problems
Rejected
Interview preparation journey
Preparation
Duration: 3 months
Topics: Data Structures, Algorithms, OOPS, Dynamic Programming
Tip 1 : Practice popular questions from Arrays, Binary Trees, LinkedLists from CodeStudio's Interview Problems
Tip 2 : Make sure you are aware of calculating the time and space complexity for every problem you're coding.
Tip 3 : Prepare through Mock Interviews to practice explaining your approach while solving in an actual interview.
Application process
Where: Referral
Eligibility: Above 7.5 CGPA
Tip 1 : Describe best of your projects in minimum words. Don't forget to add buzz words like REST APIs/ DB Indexing/ Benchmarking etc if you worked on backend.
Tip 2 : Don't add school achievements like Olympiads or Class Topper in your resume.
Tip 3 : If you've some work experience, put it in a way ,you're marketing yourself. Add terms like 'Created/Owned the Project through entire SDLC'
Tip 4 : Make sure you mention how your work experience actually impacted the company. Or how your self project can be actually useful to end user.
Interview rounds
01
Round
Easy
Video Call
Duration45 minutes
Interview date11 Nov 2021
Coding problem2
1. Maximum Subarray Sum
Moderate
35m average time
81% success
0/80
Asked in companies
You are given an array 'arr' of length 'n', consisting of integers.
A subarray is a contiguous segment of an array. In other words, a subarray can be formed by removing 0 or more integers from the beginning and 0 or more integers from the end of an array.
Find the sum of the subarray (including empty subarray) having maximum sum among all subarrays.
The sum of an empty subarray is 0.
Example :
Input: 'arr' = [1, 2, 7, -4, 3, 2, -10, 9, 1]
Output: 11
Explanation: The subarray yielding the maximum sum is [1, 2, 7, -4, 3, 2].
Problem approach
You are given an array/list ARR consisting of N integers. Your task is to find the maximum possible sum of a non-empty subarray(contagious) of this array.
Note: An array C is a subarray of array D if it can be obtained by deletion of several elements(possibly zero) from the beginning and the end of array D.
For e.g.- All the non-empty subarrays of array [1,2,3] are [1], [2], [3], [1,2], [2,3], [1,2,3].
2. DBMS Questions
What is 3NF?
Types of DataBases ?
02
Round
Easy
Video Call
Duration45 minutes
Interview date11 Nov 2021
Coding problem2
1. LCA Of Binary Tree
Moderate
10m average time
90% success
0/80
Asked in companies
You have been given a Binary Tree of distinct integers and two nodes ‘X’ and ‘Y’. You are supposed to return the LCA (Lowest Common Ancestor) of ‘X’ and ‘Y’.
The LCA of ‘X’ and ‘Y’ in the binary tree is the shared ancestor of ‘X’ and ‘Y’ that is located farthest from the root.
Note :
You may assume that given ‘X’ and ‘Y’ definitely exist in the given binary tree.
For example :
For the given binary tree
LCA of ‘X’ and ‘Y’ is highlighted in yellow colour.
Problem approach
You have been given a Binary Tree of distinct integers and two nodes ‘X’ and ‘Y’. You are supposed to return the LCA (Lowest Common Ancestor) of ‘X’ and ‘Y’.
The LCA of ‘X’ and ‘Y’ in the binary tree is the shared ancestor of ‘X’ and ‘Y’ that is located farthest from the root.
2. OS Questions
What are semaphores?
What is virtual memory?
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
How do you remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
SDE - 1
4 rounds | 6 problems
Interviewed by Acko
Selected 
1868 views
0 comments
0 upvotes
SDE - 1
4 rounds | 6 problems
Interviewed by Acko
Selected 1388 views
0 comments
0 upvotes
SDE - 1
2 rounds | 5 problems
Interviewed by Acko
Rejected
1692 views
0 comments
0 upvotes
SDE - 1
2 rounds | 4 problems
Interviewed by Acko
Rejected
1215 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
Selected 115097 views
24 comments
0 upvotes
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
Selected 58238 views
5 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
Selected 35147 views
7 comments
0 upvotes