Antino Labs Pvt Ltd interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Antino Labs Pvt Ltd
upvote
share-icon
2 rounds | 10 Coding problems

Interview preparation journey

expand-icon
Journey
In my second year, I took a competitive programming course from Coding Ninjas, which helped me delve deeper into data structures and algorithms (DSA). Afterward, I began practicing problems on coding platforms.
Application story
It was an on-campus drive. They were hiring for SDE. Software Developer for the below profile : Mobile App Development Frontend Development Backend Development Round 1: Coding + Apti Round 2: 1 Tech interview Round 3: 1 Tech interview Round 4: 1 HR round
Why selected/rejected for the role?
I was rejected in the technical interview round because I did not know the front end in deep. He was asking questions in JavaScript and also asked me about MERN.
Preparation
Duration: 3 months
Topics: Dynamic programming, Graph, DSA, OS, networking
Tip
Tip

Tip 1: Practise DSA from coding websites.
Tip 2: Learn CS fundamentals ( mainly oops, DBMS )

Application process
Where: Campus
Eligibility: 60 % throughout.
Resume Tip
Resume tip

Tip 1: Undertake a few quality projects. 

Tip 2: Ensure accuracy on your resume; do not include false information.

Interview rounds

01
Round
Medium
Online Coding Interview
Duration60 mins
Interview date7 Oct 2022
Coding problem6

2 coding questions + MCQs were asked.

1. Maximum Subarray Sum

Moderate
35m average time
81% success
0/80
Asked in companies
HCL TechnologiesInformaticaSamsung

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

I solved it using two Pointer techniques.

Try solving now

2. Cycle Detection in a Singly Linked List

Moderate
15m average time
80% success
0/80
Asked in companies
GrabThalesSterlite Technologies Limited

You are given a Singly Linked List of integers. Return true if it has a cycle, else return false.


A cycle occurs when a node's next points back to a previous node in the list.


Example:
In the given linked list, there is a cycle, hence we return true.

Sample Example 1

Problem approach

Use slow and fast Pointer

Try solving now

3. OS MCQ

BIOS is used?

By operating system
By compiler
By interpreter
By application software

4. OS MCQ

Banker's algorithm is used?

To prevent deadlock
To deadlock recovery
To solve the deadlock
None of these

5. DBMS MCQ

Which of the following is a top-down approach in which the entity's higher level can be divided into two lower sub-entities?

Aggregation
Generalization
Specialization
All of the above

6. DBMS MCQ

Which of the following refers collection of the information stored in a database at a specific time?

Independence
Instance of the database
Schema
Data Domain

02
Round
Medium
Video Call
Duration30 minutes
Interview date8 Oct 2022
Coding problem4

The interviewer mainly asked coding questions and front-end questions.

1. Maximum Product Subarray

Moderate
25m average time
75% success
0/80
Asked in companies
InnovaccerAmazonMicrosoft

You are given an array “arr'' of integers. Your task is to find the contiguous subarray within the array which has the largest product of its elements. You have to report this maximum product.

An array c is a subarray of array d if c can be obtained from d by deletion of several elements from the beginning and several elements from the end.

For e.g.- The non-empty subarrays of an array [1,2,3] will be- [1],[2],[3],[1,2],[2,3],[1,2,3]. 
For Example:
If arr = {-3,4,5}.
All the possible non-empty contiguous subarrays of “arr” are {-3}, {4}, {5}, {-3,4}, {4,5} and {-3,4,5}.
The product of these subarrays are -3, 4, 5, -12, 20 and -60 respectively.
The maximum product is 20. Hence, the answer is 20.
Follow Up:
Can you solve this in linear time and constant space complexity?
Try solving now

2. Javascript Questions

Which is faster in JavaScript and ASP script?
What are global variables? How are these variables declared, and what are their associated problems?
What is a prompt box? (Learn)
Explain Hoisting in JavaScript. (Learn)
Difference between var and let keyword in javascript. (Learn)
What is the NaN property in JavaScript?

3. React Questions

What are props in React? (Learn)
How is React different from AngularJS (1.x)? (Learn)
What are the key features of Node.js? (Learn)

4. MERN stack Questions

What is Callback Hell and what is the main cause of it? (Learn)
What are the differences between a Class component and a Functional component?

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
6450 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
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
114579 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
57825 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
34961 views
7 comments
0 upvotes