Scribd
Upload
291 views2 pages

HackWithInfy Exam Pattern Insights

The HackWithInfy coding competition consists of one round with three questions to be solved in three hours, focusing on various coding topics such as Dynamic Programming, Greedy Algorithms, and Data Structures. Participants are advised to prepare for array and string manipulation, backtracking, and non-linear data structures like graphs and trees. With adequate practice, solving two questions is likely sufficient for advancing to the next round.

Uploaded by

belongtoharyana06
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
291 views2 pages

HackWithInfy Exam Pattern Insights

The HackWithInfy coding competition consists of one round with three questions to be solved in three hours, focusing on various coding topics such as Dynamic Programming, Greedy Algorithms, and Data Structures. Participants are advised to prepare for array and string manipulation, backtracking, and non-linear data structures like graphs and trees. With adequate practice, solving two questions is likely sufficient for advancing to the next round.

Uploaded by

belongtoharyana06
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

HackwithInfy experience of students –

Infosys Interview Experience (HackWithInfy) - GeeksforGeeks

Probable topics-

In round 1 it is comprised of 3 questions that you have to solve in 3 hours. In


this round you have to solve at least 1-2 two coding questions then there will
be a chance of getting selected in 2nd round of HackWithInfy.

Here below you will get the Syllabus of HackWithInfy. There is no particular
syllabus for HackWithInfy but these are most asked coding problem topics
for HackWithInfy coding rounds:-

 Dynamic Programming

 Greedy Algorithms

 Backtracking

 Stack

 Queue

 Mapping Concepts

 Array manipulation

 String manipulation

 Tree

 Graph

 Bit Mapping and Hashing

 Recursion and Heap

 Divide and Conquer

Some Important points:

 Total Number of Questions - 3

 Total Time Limit - 3 Hour

 Difficulty Level - Medium-High

My analysis-
Question1 – 90 percent chances will be of array/string (Leetcode medium
level)

Question 2 – A combination of backtracking and dynamic programming or


maybe dedicated to any one (Leetcode medium)

Question 3 – Will surely be of a non linear data structure (Graph or Trees) or


maybe one more dp (Hard level leetcode).

With some practice you can easily solve 2 questions that will be surely more
than enough!!!!!

You might also like