HackWithInfy 2019 Round 2 Experience.

Published on


In my previous blog I shared the questions and my experience for HackWithInfy Round 1. So if you haven't read that yet then check it out first.

In this one, I'll be sharing my experience from round 2 for which around 7,500 students were qualified.


DMCA Content

Due to DMCA violation, I cannot share the exact questions here. Although I can share what types of questions I was asked and how was the difficulty level of these questions.

Question 1 was an array manipulation question, Pretty straight-forward question.

Question 2 was another array manipulation question but this was a bit tricky, consider it to be somewhere between leetcode easy to medium.

Question 3 was a Graph question, again this one was also a bit tricky and somewhere between leetcode medium to hard.

My Experience

Personally, for me Round 2 was far much better than Round 1 of HackWithInfy.

Question 1 was very simple and I solved it quickly with the O(n) solution directly.

Question 2 was nice, I tried the brute force approach first with O(n2) complexity and was able to solve 6 test cases. However, after spending some time on it, I was able to solve the question in O(nlogn) time complexity which helped me clear all the test cases.

So, by far I had solved 2 questions completely with all test cases which was way better than my round 1. So I was quite positive when I moved to the third question.

Unfortunately, It was a Graph question and I was not very confident with Graph data structures at that time.

But I had like around an hour left, so I started thinking of the solution. I understood the question and tried implementing the solution but could not come up with any solution to test and submit.


So I can conclude by saying that I was quite happy with my performance in Round 2.

Now let's talk about the results.

I was not selected for the final round which is the on-site hackathon at the Pune campus. A total of 109 students were selected for the final phase of HackWithInfy in 2019.

But wait!!

There was a silver lining for me, I was given an opportunity for the pre-placement interview for the Power Programmer Role.

Although Infosys never disclosed the exact ranking for the participants, it was written on their website that the top 300 or 500 (I don't remember exactly) are given the chance to get a pre-placement interview for power programmer.

So solving 2 questions didn't help me to reach in the top 109 candidates but it did help me to reach in the top 300 or 500 out of 1,20,000 students who participated.

Now what happened in the interview can be a topic for another blog.

So this was my experience with HackWithInfy 2019 competition.

If you have any doubts or queries then let me know in the comment section below.

See you in the next one 👋

Updates straight in your inbox!

A periodic update about my life, recent blog posts, TIL (Today I learned) related stuff, things I am building and more!

Share with others

Liked it?


You may also like

  • competition

    HackWithInfy 2019 Round 1 Experience.

    Sharing my Hackwithinfy 2019 Round 1 experience and other useful tips.

    3 min read
  • system-designdatabase

    Master-Slave Replication: Scaling Your Database for High Availability

    As businesses grow, their databases can become overloaded and slow, leading to a poor user experience. To address this issue, database administrators can use a system called master-slave replication, which allows for multiple copies of a database to be distributed across different servers. In this article, we'll explore the concept of master-slave replication, how it works, and why it's important for achieving high availability in your database.

    3 min read
  • system-designdatabase

    Exploring Master-Master Replication in Databases: How It Works and Its Benefits

    Master-master replication is a powerful technique that can help you improve the availability and scalability of your database system. But what exactly is master-master replication, and how does it work? In this article, we'll explore the details of this technique, including its benefits and some real-world examples.

    4 min read