Open In App

HackWithInfy Interview Experience – 2019 for Power Programmer Role

Last Updated : 23 Jun, 2020
Improve
Improve
Like Article
Like
Save
Share
Report

Infosys is one of the major recruiters in the country. Since 2 years HackWithInfy has become one of the premier coding competitions conducted by Infosys. So here I am going to discuss my experience of HackwithInfy 2019. I applied for HackWithInfy through my college VIT Vellore’s training and placement cell.

Round 1:

It was held on 1st July 2019 on the HackerRank coding platform. It is merely an individual online coding challenge. It consisted of 3 coding questions that are different for each student to be solved in 3 hours. There will be plagiarism check and the final scores will depend on the number of test cases your code passes successfully.

I can exactly remember only one of the three questions word by word but I will put the gist of the other 2 questions for you

Question number 1

Given an array of n elements and a number m, we need to find all distinct pairs existing in the array whose pair sum is divisible by the given number m and then print the total number of such pairs. Distinct pairs means (1, 2) and (2, 1) are the same. Here I was able to pass half of the total cases and the rest cases did not pass due to exceeding the given time complexity constraint.

Question number 2

A string manipulation question. I managed to pass 2 out of 13 cases here.

Question number 3

It was a problem based on arrays. I managed to pass 8 out of 13 test cases.

Overall if you have moderate coding skills you are good to sail through this round. After 2 weeks I was among the 260 odd students from VIT Vellore and Chennai campus to be selected for round 2 of HackWithInfy 2019.

Round 2:

It was held on 14th July 2019. It was an online coding round consisting of 3 questions on the HackerRank platform with web camera access for the administrator. Just like round 1, every student got a different set of questions. The questions were of moderate to high difficulty. I managed to solve 2 questions completely and pass 2 test cases out of the available test cases in the third question. The questions were framed smartly and you have to just arrive at the gist of the question. So I would give you the gist of the questions.

Question Number  1

Given an array of n numbers find the largest difference in the 
starting and ending indexes of the elements of the all possible 
strictly decreasing sub-sequences in the array.

Input: 21, 13, 18, 10, 7, 3, 1

Output : 4

Here for element 1 the decreasing subsequence can be mapped till
18.It is 18, 10, 7, 3, 1.Similarly, for 3 it can be mapped till 
18 which is 18, 10, 7, 3. For 7 it can be mapped till 
18 which is 18, 10, 7. For 10 it can be mapped till 18
which is 18, 10. For 18 there is no continuous decreasing 
subsequence. For 13 it is 21, 13. 
The largest difference in indexes is at index 2 and index 
6 that is 4. 

This question can be done using Two pointer method.
We can keep track of indices of contiguous subsequence just by checking next array element.
store the difference in a variable max and check it after each iteration.
 
You just have to find the longest increasing contiguous subsequence from 
the backside of the array and report the difference in 
the index of starting and ending elements.
Complexity of the algorithm will be O(n).

Input: 1, 18, 17, 14, 15, 32, 16 

Output: 2 

Question number 2

There are n people in the party. Each person is wearing T-shirts with numbers written on the T-shirts. The numbers on the T-shirts can be unique or the same. In three turns 3 people leave the party one at a time. You are provided with the people remaining in the party after every turn. You need to print the T-shirt number of people who left the party in the order they left. I used four maps in total one for initial array plus three one each for each turn arrays with T-shirt number as key and its frequency as value. I then compared the initial map with the first turn map to find the first missing element. Similarly, I then compared the first turn map with the second turn map to get the second missing element. Finally, I compared the second and third turn map to get the third missing element. Finally, I printed all the missing elements after storing it in a variable. I managed to pass all the given test cases.

 Input:- Initial :- 11, 5, 1, 2, 7, 3, 1 
         After Turn 1 :- 11, 5, 2, 7, 3, 1 
         After Turn 2:-  5, 2, 7, 3, 1 
         After turn 3:-  5, 7, 3, 1 


Output : 1, 11, 2 

We can observe that one of the two 1's is missing 
after turn 1, similarly, 11 is missing after turn 2 
and finally, 2 is missing after turn 3. 
So the output is 1, 11, 2.

 Input:- Initial :- 21, 15, 12, 11, 6, 5, 7 
         After Turn 1 :- 21, 15, 12, 6, 5, 7 
         After Turn 2:- 15, 12, 6, 5, 7 
         After turn 3:- 15, 6, 5, 7 


Output : 11, 21, 12 

Question number 3

I don’t exactly remember the question but it was based on prime numbers. I managed to pass 2 test cases out of the given total test cases.

The result was announced on 31st July 2019 and I was lucky few to get the Pre-placement interview for Power Programmer Role. In my college, only 9 were called for Power Programmer Interview while 91 were called for System Engineer Role.

Round 3:

Skype Interview

It was a skype interview where the interviewer was himself a power programmer sitting at the Infosys office. First of all, he asked me to introduce myself. Then he asked me to explain basic OOPS concepts which I did well. Then he posted a coding question in the skype chatbox.

Given a file consisting of billions of characters. Read the file and for each chunk of 6 unique characters in the file map the string of all possible 6 letter chunks of unique characters to a unique value. Print the entire output.

I did not know file handling so, I tried to solve the question with the map. However, my code did not produce the right output.

Later he asked me questions about the kind of technologies I know and about my projects.

3 out of 6 were selected for HR round and I was not one of them. All 3 selected for HR round were given the job.

I got the opportunity to sit for the SES(System Engineer Specialist) role thereafter. I will share the experience of SES interview in the next post.

I would like to thank GeeksforGeeks without which I could not learn to code at all.


Similar Reads

Infosys Interview by Hackwithinfy for Power Programmer role 2019
Firstly you need to register for this Hackwithinfy contest it consists three rounds Round 1: For this round all final year students are eligible. it is national wide competition. it is a online coding round in hacker rank platform. the time duration is 2hr 30 mins. in this challenge 3 questions will be given. they provide more than 5 programming la
2 min read
Interview Experience for Power Programmer Role Infosys by HackWithInfy
Each year Infosys conducts (started from the year 2018) this Competition for students which basically comprises of 3 Rounds in total and then Pre-Placement Interview for PowerProgrammer Role for top 100 students. The first two rounds are of competitive coding with a duration of 3 hours comprising of 3 question in each round and are held on HackerRa
3 min read
Infosys Interview Experience for Power Programmer Role through HackWithInfy
Each year Infosys organize a competition called HackWithInfy(Starting from 2018). There are basically three rounds. The first two rounds are Online coding round on HackerRank followed by a interview for Power Programmer Role. After the two rounds of coding Top 107 students were selected for interview and hackathon at Infosys Pune Campus. ONLINE COD
3 min read
Infosys Interview Experience | Power Programmer Role through Hackwithinfy
Hackwithinfy is an online contest organized by Infosys. It's basically a coding competition consisting of two online rounds. Round 1 (Online Coding Round): The first round was hosted on the Hackerank Platform consisting of 3 questions from easy to hard level. All the 3 questions will be of the easy to medium level. Generally, questions will be from
2 min read
Infosys Interview Experience for Power Programmer Role | HackWithInfy 2020
HackWithInfy is basically an online competition conducted by Infosys. It includes two coding rounds and a hackathon. Based on the performance in the coding round, further stuff is decided. The top 100 students get the opportunity to participate in the hackathon and additionally, they get an interview call for the Power Programmer role. The top 500
5 min read
HackWithInfy 2020 Interview Experience for Power Programmer Role
HackWithInfy is an open contest of Infosys. It contains three rounds. Round 1 Round 1, contains three problem-solving coding questions hosted by HackerEarth. Three Questions of different difficulties. Easy for 50 points, Medium for 75 points, Hard for 100 points. Total of 225 points. I have solved only one coding question(Easy). In this round, we a
4 min read
HackWithInfy Power Programmer Interview 2019
Hackwithinfy conducted by Infosys is an online coding competition which has 3 rounds in total. Round 1: Basic coding round on Hackerrank. 3 coding questions in 3 hours. You can clear this round if you know basic arrays, linkedlist, strings. Prepare using https://www.geeksforgeeks.org/must-do-coding-questions-for-companies-like-amazon-microsoft-adob
3 min read
HackWithInfy Interview Experience for Power Programmer 2020
Hey Guys, Here is my Recruitment Process for Power Programming Role at Infosys (HackWithInfy). There were 4 rounds in total. Round 1 (Coding Test): The test was conducted on HackerEarth Platform. It consisted of 3 questions that were based on Data Structures, Algorithms, and Number Theory. All the 3 questions were in increasing order of difficulty
2 min read
Infosys Virtual Interview Experience for Power Programmer | HackWithInfy 2020
After clearing 2 coding rounds of HackWithInfy Challenge and solving 2/3 questions in round 2, got PPI for Power Programmer: Technical Interview 1: No of Panelists:1Duration: 1 hour Intro in the very beginning. Just after that, the interviewer gave me a question to code while sharing my screen. Problem: Given a palindrome number, find the next high
1 min read
Infosys Hackwithinfy Interview Experience for Power Programmer 2021
Hackwithinfy is the known way to get a pre-placement offer from Infosys. This year hackwithinfy had only 1 online coding round. Round 1(Online Coding): There were 3 coding questions with different difficulty levels and therefore different weightages. So in 3 questions 1 was easy,1 medium,1 difficult. Depending on how many and which questions you so
3 min read