Tip 1 : Practice coding questions till you are able to tackle medium level questions easily
Tip 2 : Be proficient in the project which you have mentioned in your resume.
Tip 1 : Never Lie about technologies you know
Tip 2 : Project shouldn't be copied from online sources even if you take help then do some your own tweaks or add new features and you should know all workings of project
The round was scheduled in afternoon time.
HackerEarth test link was shared beforehand
All the instructions were provided in the welcome page of test link.
It was proctored test



String 'S' is NOT case sensitive.
Let S = “c1 O$d@eeD o1c”.
If we ignore the special characters, whitespaces and convert all uppercase letters to lowercase, we get S = “c1odeedo1c”, which is a palindrome. Hence, the given string is also a palindrome.
Step1 : I started loop from 1st element to length/2 of array and checked first character is equal to last character and second character to the 2nd last so on
Step 2 : if any character mismatches return false
Step 3 : if every character matches and loop has run fully then in last return True.



If the string is: “abccba”, then the first repeated character is ‘c’, but the repeated character that is present first in the string is ‘a’. You need to print ‘a’.
Keep in mind that you need to print the repeated character that is present first in the string and not the first repeating character.
Step1 : I looped though the string for each character and searched for the same in rest of the string.
Step 2 : It used nested loops.
Step 3 : when we find repeated character save index of it and return it after breaking from loop.
I didn't used best approach as time was limited.
It was in afternoon 3pm.
Interview platform was Microsoft teams.
Interview link was shared a day before.
Interviewer was professional.



Each pair should be sorted i.e the first value should be less than or equals to the second value.
Return the list of pairs sorted in non-decreasing order of their first value. In case if two pairs have the same first value, the pair with a smaller second value should come first.
Step 1 : First take an empty hash table H
Step 2 : Do following for each element Arr[i] in Arr[]
1.) If H[y – A[i]] is set then print the pair (Arr[i], x – Arr[i])
2.) Add that Arr[i] into hash table H.
I was asked thoroughly about my Resume mentioned Data analysis project.
What is the real world issue in Data cleaning for sentiment analysis.
Basic questions about Python data analysis libraries such as pandas, seaborn like what are there uses and where are they used.
Asked about random forest and its basic working.
Tip 1 : Mention only the projects which you know fully.
Tip 2 : Try to provide O(N) solutions only after discussing Naive approach.
SQL query to find the first names in ending with n.
Select names of city in database which ends with n.
Tip 1 : Go through basic SQL queries
Tip 2 : Be good in DBMS basics.
It was held around 4pm.
Scheduled on MS teams.
Interview link shared one day before.
The interviewer was pretty chill and made me comfortable.
I was asked regarding situation where a company approaches me in pandemic time and asks that demand is high but supply is low how to handle this situation
Tip 1 : I told first we should remove middle man which can stock supplies as well as figure out which place has more demand so that we can focus on our loyal customers first.
Tip 2 : Next we should launch an emergency helpline if someone urgently needs the product for emergency use.
Tip 3 : We have to maybe outsource some of the parts of the product to make production faster.
How many cars in your city. Guestimate.
Tip 1 : Took Approx population of city and divided the number by 5 for number of families in city
Tip 2 : Further divided those families according to economic scale.
Tip 3 : Provided upper middle class family percentage with 1 car per family and rich family percentage in city which is pretty less with 2.5 cars per family which also covers the upper limit and lower cases of some lower middle class families which have cars.
Why to join this company?
Tip 1 : Go through the company and its history
Tip 2 : be ready with your ambition that why do you want to join.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?