Antier Solutions Pvt. Ltd interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Antier Solutions Pvt. Ltd
upvote
share-icon
2 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Journey
I start my coding journey in 1st semester in my college. In 1st semester I cover the basic knowledge of C++ from the YOUTUBE channel name C++ by Saurabh Shukla. I suggest all freshers to cover all basic knowledge through this channel only. From ending of the second semester I started coding at online coding platforms like Geeks for Geeks and leetcode and completed around 700 questions at the end of 3rd semester.
Application story
Antier solution came to my campus I applied and cleared the test round. After that, there is another offline DSA test. There were 2 DSA questions and I cleared that also. After that, there were 1 technical interview and 1 HR interview.
Why selected/rejected for the role?
I was selected for this role because i answered all DSA questions and give all questions related to my project.
Preparation
Duration: 6-12 months
Topics: Array, String, stack, queue, graph, greedy OOPs
Tip
Tip

Tip 1 : Clear the core concept
Tip 2 : Give all contests in leetcode
 

Application process
Where: Campus
Eligibility: Above 7.5 CGPA
Resume Tip
Resume tip

Tip 1 : Mention the project which is done by you.
Tip 2 : Do not mention any irrelevant information. eg. achievement of 11th 12th school OR captain of my college theatre etc.

Interview rounds

01
Round
Medium
Online Coding Interview
Duration60 minutes
Interview date10 Dec 2022
Coding problem3

The environment was very good.
Timing is less as compared to another test.

1. Rotate Matrix

Moderate
15m average time
85% success
0/80
Asked in companies
AmazonSchlumbergerZoho Corporation

Given a 2-dimensional matrix of size ‘N’ x ‘M’, rotate the elements of the matrix clockwise.

For example: 
Input Matrix: [ [ 1, 2, 3 ] 
                [ 4, 5, 6 ] 
                [ 7, 8, 9 ] ]

Output Matrix: [ [ 4, 1, 2 ] 
                 [ 7, 5, 3 ] 
                 [ 8, 9, 6 ] ]

The output matrix is generated by rotating the elements of the input matrix in a clockwise direction. Note that every element is rotated only once. 
Note :
You do not need to print anything; it has already been taken care of. Also, update the given matrix in-place.
Try solving now

2. Longest Common Subsequence

Moderate
0/80
Asked in companies
AmazonVisaRed Hat

You have been given two Strings “STR1” and “STR2” of characters. Your task is to find the length of the longest common subsequence.

A String ‘a’ is a subsequence of a String ‘b’ if ‘a’ can be obtained from ‘b’ by deletion of several (possibly, zero or all) characters. A common subsequence of two Strings is a subsequence that is common to both Strings.

Problem approach

Let the input sequences be X[0 . . . m-1] and Y[0 . . . n-1] of lengths m and n respectively. And let L(X[0 . . . m-1], Y[0 . . . n-1]) be the length of the LCS of the two strings X and Y. 

Following is the recursive definition of L(X[0 . . . m-1], Y[0 . . . n-1]).

1: If the last characters of both sequences match (or X[m-1] = Y[n-1]) then 
L(X[0 . . . m-1], Y[0 . . . n-1]) = 1 + L(X[0 . . . m-2], Y[0 . . . n-2])
2: If last characters of both sequences do not match then 
L(X[0 . . . m-1], Y[0 . . . n-1]) = MAX ( L(X[0 . . . m-2], Y[0 . . . n-1]), L(X[0 . . . m-1], Y[0 . . . n-2]) )

Follow the below steps to implement the idea:

1: Create a recursive function [say lcs()].
2: Check the relation between the last characters of the strings that are not yet processed.
Depending on the relation call the next recursive function as mentioned above.
3: Return the length of the LCS received as the answer.

Try solving now

3. Puzzle Question

There are 25 horses among which you need to find out the fastest 3 horses. You can conduct race among at most 5 to find out their relative speed. At no point you can find out the actual speed of the horse in a race. Find out the minimum no. of races which are required to get the top 3 horses.

Problem approach

Tip 1: Try to solve this problem in brute force approach.
Tip 2: Before giving the interview try to solve at least 20-25 puzzle questions.
Tip 3:

02
Round
Medium
Online Coding Interview
Duration90 minutes
Interview date16 Dec 2022
Coding problem2

Timing : 7pm

1. Alien dictionary

Hard
46m average time
50% success
0/120
Asked in companies
Media.netFacebookAmazon

You have been given a sorted (lexical order) dictionary of an alien language.


Write a function that returns the order of characters as a string in the alien language. This dictionary will be given to you as an array of strings called 'dictionary', of size 'N'.


Example :
If the dictionary consists of the following words:-
["caa", "aaa", "aab"], and 'K' is 3.

Then, the order of the alphabet is -
['c', 'a', 'b']
Note:
If the language consists of four letters, the four letters should be the starting four letters of the English language. 

However, their order might differ in the alien language.
Try solving now

2. Search in a row wise and column wise sorted matrix

Moderate
15m average time
80% success
0/80
Asked in companies
AdobeNoBrokerOracle

You are given an 'N * N' matrix of integers where each row and each column is sorted in increasing order. You are given a target integer 'X'.


Find the position of 'X' in the matrix. If it exists then return the pair {i, j} where 'i' represents the row and 'j' represents the column of the array, otherwise return {-1,-1}


For example:
If the given matrix is:
[ [1, 2, 5],
  [3, 4, 9],
  [6, 7, 10]] 
We have to find the position of 4. We will return {1,1} since A[1][1] = 4.
Problem approach

1: The Brute Force and Easy Way To do it:

The Approach: the approach is very simple that we use to have linear search/mapping thing.


2: Another efficient approach that doesn’t require typecasting is explained below. 

1) Perform binary search on the middle column 
till only two elements are left or till the
middle element of some row in the search is
the required element 'x'. This search is done
to skip the rows that are not required
2) The two left elements must be adjacent. Consider
the rows of two elements and do following
a) check whether the element 'x' equals to the 
middle element of any one of the 2 rows
b) otherwise according to the value of the 
element 'x' check whether it is present in 
the 1st half of 1st row, 2nd half of 1st row, 
1st half of 2nd row or 2nd half of 2nd row. 

Note: This approach works for the matrix n x m 
where 2 <= n. The algorithm can be modified
for matrix 1 x m, we just need to check whether
2nd row exists or not

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
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