Be the first one to contribute and help others!
I was interviewed in Apr 2021.
Round duration - 90 Minutes
Round difficulty - Medium
The idea is simple, we will check all the possible ways of choosing planets with the help of recursion and find out which combination gives maximum time.
Along with this, we will prefer to move Mars whenever possible as it is always beneficial to make a move to Mars.
Approach: We can start the traversal of the paths from the rat’s starting position, i.e. (0,0) keeping track of the visited cells during the traversal. We will recursively go through all the paths possible until the last index of the grid (destination) is reached, and add the path information using which the rat successfully reached the end.
Algorithm is as follows:
Round duration - 90 Minutes
Round difficulty - Medium
O(V) where V is the number of ...
Tip 1 : Solve competitive programming questions regularly.
Tip 2 : Work on some live projects
Tip 1 : Have some good skills
Tip 2 : Show some live projects
I was interviewed in Nov 2020.
Round duration - 50 minutes
Round difficulty - Medium
Consisted of two parts- Verbal and quantitative aptitude with 1 mark for each correct answer and -0.33 mark for each wrong answer.
Round duration - 60 minutes
Round difficulty - Medium
Took place at 10 a.m morning.
Consisted of 2 questions which has to solved in 1 hour. First problem had to be solved to view the next question. Both were easy implementation adhoc problems.
Approach: The basic idea is that, find the total cost of a ‘Petrol’ car and ‘Diesel’ car for 6 months.
Algorithm is as follows:
The key idea is to recursively check every 3x3 grid and see what vowel does it signify and it to the string. This can be easily done using a recursive function.
Here is the algorithm :
Round duration - 50 minutes
Round difficulty - Medium
Took place at 1 pm at noon and I was very confident. Three interviewers were present- One technical , One managerial and One HR .
Initially, the interviewers introduced themselves and asked me to introduce myself.
Then, I was asked about my project.
We need to keep exploring the given string from current position ‘i’ to until we wouldn’t find a position such that substring ‘i’ to ‘j’ exists in the dictionary.
Algorithm:
Tip 1 : Should be strong in Data structures and Algorithms.
Tip 2 : Should be proficient Computer Science fundamentals.
Tip 3 : Try to have good soft skills.
Tip 1: Should be thorough on all things present in Resume.
Tip 2: Have a minimum of 1 good project in Resume.
Tip 3: Try to keep the resume to 1 page(for freshers) and maximum 2 pages(for experienced).
I was interviewed in Mar 2021.
Round duration - 180 Minutes
Round difficulty - Medium
Round 1 - Coding Contest on HackerEarth (Elimination round)
Number of questions - 3 ( Level - leetcode Medium)
The key idea is to put the highest frequency element first (a greedy approach). We will be using the priority queue to pick the elements with the highest frequency.
So first, we will store the frequency of each element. And then we will store all the numbers with their frequencies into the priority queue in the highest frequency priority manner.
After that, we will pop elements one ...
Tip 1 : Try to cover all the most asked interview questions for each topic
Tip 2 : Read previous year interview experiences
Tip 3 : Focus on your communication skills
Tip 1 : Keep your resume of 1 page
Tip 2 : Mention 2-3 descent projects
I was interviewed in Feb 2021.
Round duration - 90 minutes
Round difficulty - Medium
first round was mcq based on aptitude,dbms and output based questions
theory questions and SQL
Round duration - 90 minutes
Round difficulty - Medium
it was coding as well as mcq round
A simple method is to create a 2-dimensional array to store the changes we need to update in the original matrix to convert the given matrix into the Good matrix.
Our approach will be to create a 2-dimensional array answer with N rows and M columns, and we will copy all elements value present in the matrix ARR into the matrix answer. We will iterate the variable row from 0 to N - 1, and in each iteratio...
Round duration - 15 minutes
Round difficulty - Easy
Round duration - 180 minutes
Round difficulty - Easy
1...
We will try to solve the following problem by dividing it into two parts. In the first part, we will choose each element of the first column as a starting point and print diagonally upward starting at it. In the second part, we will choose each element of the last row as a starting point (except the first element as it has already been processed in the previous part) and print diagonally upward starting ...
Round duration - 25 minutes
Round difficulty - Easy
It was in the late afternoon since it was virtual location and environment didn't affected that much, interviewer was very friendly he asked how my day went and then went on starting with my introduction.
Tip 1 : Make at-least 2-3 projects and know those projects inside out, need to have complete understanding of how the project works and how things are working inside project
Tip 2 : Practice DSA at-least 200 questions.
Tip 3 : Practice aptitude and reasoning questions.
Tip 1: Don't write anything fake in resume
Tip 2: Don't make resume too lengthy.
Tip 3: Have some projects on resume.
I was interviewed in Jan 2021.
Round duration - 180 Minutes
Round difficulty - Medium
This round consists of objective and hands-on questions that are needed to be answered within 3 hours. You have to score 65% or above in this round to be eligible for a job interview at Infosys.
Round duration - 180 Minutes
Round difficulty - Hard
This exam has 3 coding Questions – Easy( 50 points), Medium (75 points), Hard (100 points), total 225 points, and the points are assigned according to the number of test cases you pass
The idea is to check for all the possible subarrays and inside each subarray, check for the highest value of the difference between the count for zeroes and ones for this. Let’s consider this highest difference to be MAX and initialize it to zero so formally MAX = count of zeroes in that subarray - count of ones in the same subarray.
This approach is straightforward, we will keep a ‘COUNTER’ initialized with 0. Then we iterate over integers starting from 2. For each integer, we will check whether it is multiple of any of the given ‘N’ prime numbers in the list ‘LABELS’ or not. If it is multiple of any of those prime numbers then we increment the ‘COUNTER’ by ‘1’. When the value of ‘COUNTER’ becomes ‘K’ then we return the curr...
Round duration - 45 Minutes
Round difficulty - Medium
Basic Introduction and detailed discussion on the projects, after that i was given some basic coding problems and after that some discussion on Oops and detailed discussion on Database,
Interviewer was cool and being supportive so overall it was a good experience.
Tip 1 : Never answer any question that you do not know, try to answer as precisely as you can
Tip 2 : Prepare your resume, they can any thing from that and you can't deny that you don't know
Tip 3 : Projects increase your chances so prepare atleast two
Tip 1 : Be honest, make sure what are you mentioning on it, one false information can leads to disqualification
Tip 2 : Projects are mandatory, basically it reflects your practical skills so focus on this part.
Tip 3 : Any experience like an internship would be appreciated.
ACID properties are a set of properties that ensure database transactions are processed reliably.
ACID stands for Atomicity, Consistency, Isolation, and Durability.
Atomicity ensures that a transaction is treated as a single, indivisible unit of work.
Consistency ensures that a transaction brings the database from one valid state to another.
Isolation ensures that concurrent transactions do not interfere with each other.
Du...
Thrashing is a phenomenon in OS where excessive paging occurs, leading to a decrease in system performance.
Occurs when the system is overcommitted with too many processes or tasks
Causes excessive swapping of pages between RAM and disk
Can be resolved by adding more RAM or reducing the number of processes
Can be identified by monitoring page fault rates
NOSQL databases are non-relational databases that store and retrieve data in a flexible and scalable manner.
NOSQL stands for 'Not Only SQL'
They are designed to handle large volumes of unstructured or semi-structured data
They offer high scalability and availability
Examples include MongoDB, Cassandra, and Couchbase
I was interviewed in Oct 2020.
Round duration - 180 minutes
Round difficulty - Easy
Timing :- They conducted test in day time on weekends.
Problems :- Round consist of 3 coding problems.
Environment :- Test was web proctored.
Other :- Only 1 problem is needed to clear this round.
Round duration - 180 minutes
Round difficulty - Medium
Timing :- 10 a.m. - 1 p.m. ( 3 hours )
Problems :- 3 coding problems were in this round ( Easy, Medium, Hard ) basis. You can not check the submission results in this round. So, can't be sure whether solution you submitted is correct or not. PPI oppurtunity for roles in infosys (SE, SES, Power Programmer) were based on this round.
The idea is very simple and naive. We will process the rotten oranges second by second. Each second, we rot all the fresh oranges that are adjacent to the already rotten oranges. The time by which there are no rotten oranges left to process will be our minimum time.
In the first traversal of the grid, we will process all the cells with value 2 (rotten oranges). We will also mark their adjacent cells ...
Round duration - 50 minutes
Round difficulty - Medium
After getting the PPI offer from Infosys and waiting for long 2 months. On 12th October my interview was scheduled, it was a 1 hour interview 12 noon - 1 p.m. Interview was conducted on Infosys Meridian ( Infosys Own Platform ). A meeting id was provided in mail, and we can not join before interviewer. HR contact number was provided in mail.
Interview begin :-
Interviewer :- Good afternoon, So tell me something about your family forget about your acdemics now. ( He was trying to make me comfortable ).
Me :- Told about my family, what they are doing and something about myself.
Interviewer :- You are from electrical, then why you preferred coding instead of going Navratna Electrical companies ( Bhel, NTPC)
Me :- I started coding from 2nd year and i found myself more interested in this. So, i just followed my passion.
Interviewer :- In which programming language are you comfortable ?
Me :- C++
Interviewer :- Why?
Me :- Because its faster than Java and Python and easy to implement. And i take part in competitive programming contest on Codechef, Codeforces so, C++ consists of Standard Template Library which is beneficial.
Interviewer:- What is this pointer?
Me:- This pointer represents to the current object in a class.
Then he asked few more question on C++ ( difference between call be value and call be reference, namespace, some C++ libraries)
Interviewer:- In which CSE topics are you comfortable?
Me:- DS and Algo, OOPS
Interviewer:- Can you write some queries?
Me:- I practised one day before few SQL queries but i was not confident. So, dont want to give a try I answered "No sir".
Interviewer:- What is flux?
Me:- Magnetic flux passing through a unit area.
Then he start asking few more question form electrical core. I was not able to answer. I said him I am not good in electrical core. I am more interested to solve any DS/Algo question.
Interviewer:- Make a doubly linked list of 5 elements and apply merge sort on it. He asked me to share the screen and open any of my favourite online editor.
Me:- I coded on Codechef-IDE. First dicuss the logic with him and then coded witn explaining him each line. Th code run successfully and Interviwer seems to satisfy.
Then, he pasted a piece of code in Python in a doc sheet and send me. He asked me to solve that problem. It was based on concepts of OOPS. Consisting of 3 classes and relation of Inheritance, Copy constructor, Parameterised Constructor was there in that problem. I step by step solve that problem and gave final output to interviewer. Interviewer was satisfied with output and said it was correct.
Interviewer:- I am done with interviewer. I check your coding knowledge. Do you have any questions for me?
Me:- Asked about training process in infosys.
Verdict:- Selected
The first and the only line of input contains the elements of the ...
Tip 1 : Go through your resume properly and mention only those points in which you are comfortable to answer.
Tip 2 : Prepare interview question on any one programming language properly
Tip 3 : Be prepared with any one of your project ( if done )
Tip 1 : Have at least one project or experience in your resume.
Tip 2 : Do not put false things on your resume.
I was interviewed in Nov 2020.
Program to check if a number is a palindrome or not.
Convert the number to a string
Reverse the string
Compare the reversed string with the original string
If they are the same, the number is a palindrome
Sum of even numbers in an array
Loop through the array and check if each element is even
If even, add it to a running sum
Return the sum
I applied via Company Website and was interviewed before Dec 2019. There were 4 interview rounds.
posted on 17 Dec 2020
I applied via Company Website and was interviewed before Dec 2019. There were 4 interview rounds.
Anonymously discuss salaries, work culture, and many more
Get Ambitionbox App
TCS
Accenture
Wipro
Cognizant