HackWithInfy Previous Year Questions and Answers  Check HackWithInfy Previous Year Placement Papers, Exam Pattern  Download HackWithInfy Coding Questions for 2022 freshers With Solutions
HackWithInfy Previous Year Questions and Answers: From this article we have provided the Hack With Infy questions, HackWithInfy questions pdf, Hack with Infy package, HackWithInfy sample previous year questions, HackWithInfy Placement Paper Pattern & others. HackWithInfy was launched in 2018 by Infosys to select the best coders from the country. Students who are seeking for this HackWithInfy Placement Paper Exam Pattern, Beautiful function HackWithInfy, previous year question papers etc. can get it from our naukrimessenger page. For this HackWithInfy only B.E./B. Tech/M.E./M. Tech students graduating in 2022 is eligible. Here on this page, you will find all previous HackWithInfy sample questions asked in all three rounds since 2018. In addition to the previous year’s questions, you can also find sample questions for the HackWithInfy sample mock tests and sample questions for practice purposes. The detailed info about the HackWithInfy has been given below
Notification Details  

Recruiter  Infosys HackWithInfy  
Join our Telegram 
As per the HackWithInfy Previous Year Placement question papers Notification, the difficulty level of this project is very high but the reward is also very pleasant. For more info about the upcoming exam notification, Merit List, selection list, cut off list, old question papers, HackWithInfy previous year questions round 1, Syllabus, Hackwithinfy Questions codeofgeeks, eligibility, salary, registration last date, HackWithInfy 2022 registration, package, result & others keep touch with our Naukrimessenger website
Hack With Infy interview questions & experience
Hackwithinfy Coding Questions
HackWithInfy Eligibility Criteria  Hack With Infy 2022
 Education: Graduation and PostGraduation – B.E/ B.Tech/ M.E/ M.Tech
 Passed out Batch: 2022
 Backlogs: No current /past backlogs.
Preparation for HackWithInfy sample mock tests and sample questions
 For this HackWithInfy only B.E./B. Tech/M.E./M. Tech students graduating in 2022 is eligible.
 From this article, you will find all previous HackWithInfy sample questions asked in all three rounds since 2018.
 In addition to the previous year’s questions, you can also find sample questions for the HackWithInfy sample mock tests and sample questions for practice purposes
 This year there is a change in HackWithInfy mode, there will be no Round 2, ie; There is only Round 1 and the final
 HackWithInfy is basically a coding competition that greatly enhances the true coding capability of the country and offers the opportunity to be featured on Infosys with packages ranging from 5 LPA to 8 LPA
HackWithInfy Coding Questions and Answers 2022
 HackWithInfy Coding Questions With Solutions
 HackWithInfy Coding Questions 2022
1.HackWithInfy Coding Questions With Solutions
 Dynamic Programming
 Greedy Algorithms
 Backtracking
 Stack
 Queue
2.HackWithInfy Coding Questions 2022
 Mapping Concepts
 Array manipulation
 String manipulation
 Tree
 Graph
 Bit Mapping and Hashing
 Recursion and Heap
HackWithInfy Placement Paper Pattern Details
HackWithInfy Details  Sections/ marks 
Round 1  03 Hours 
Sections (Primarily)  02 
Grand Finale  48 Hours hackathon 
Negative Marking  NIL 
Total Prize Money  Rs.3.5 Lakhs 
Adaptive/NonAdaptive  Non Adaptive 
Winner gets  Rs.02 Lakh 
HackWithInfy Curriculum 2022
 Dynamic Programming
 Greedy Algorithms
 Backtracking
 Stack
 Queue
 Mapping Concepts
 Array manipulation
 String manipulation
 Tree
 Graph
 Bit Mapping and Hashing
 Recursion and Heap
HackWithInfy Coding Questions for 2022 freshers
Q1: Ramu has N dishes of different types arranged in a row: A1,A2,…,AN where Ai denotes the type of the ith dish. He wants to choose as many dishes as possible from the given list but while satisfying two conditions

Answer: Ramu wants to know which type of dish he should choose from, so that he can pick the maximum number of dishes 
Example :
 Given N= 9 and A= [1,2,2,1,2,1,1,1,1]
 For type 1, Ramu can choose at most four dishes. One of the ways to choose four dishes of type 1 is A1,A4, A7 and A9.
 For type 2, Ramu can choose at most two dishes. One way is to choose A3 and A5.
 So in this case, Ramu should go for type 1, in which he can pick more dishes
INPUT FORMAT:
 The first line contains T, the number of test cases. Then the test cases follow.
 For each test case, the first line contains a single integer N.
 The second line contains N integers A1,A2,…,AN.
OUTPUT FORMAT
For each test case, print a single line containing one integer ― the type of the dish that Ramu should choose from.
If there are multiple answers, print the smallest one
CONSTRAINTS :
 1 <= T <= 10^3
 1 <= N <= 10^3
 1 <= Ai <= 10^3
Sample Input :
03, 05, 1 2 2 1 2, 06, 1 1 1 1 1 1, 08, 1 2 2 2 3 4 2 1
Sample Output :
01, 01, 02
Example:C++ Program 
#include <bits/stdc++.h> using namespace std; using ll = long long; int main () { int t; cin >> t; while (t) { int a, b, c, x, y; cin >> a >> b >> c >> x >> y; if ((a + b + c) != (x + y)) { cout << "NO" << endl; } else { if (y < min (a, min (b, c))  x < min (a, min (b, c))) { cout << "NO" << endl; } else { cout << "YES" << endl; } } } } 
Example:Python Program 
#Test case t=int(input()) # loop for each test case for tc in range(t): # int inputs in single line a,b,c,x,y = [ int(x) for x in input().split() ] if (a+b+c) != (x+y): print(“NO”) elif y< min (a, min(b,c)) or x<min(a,min(b,c)): print(“NO”) else: print(“YES”)

Q2: Altaf has recently learned about number bases and is becoming fascinated.Altaf learned that for bases greater than ten, new digit symbols need to be introduced, and that the convention is to use the first few letters of the English alphabet. For example, in base 16, the digits are 0123456789ABCDEF. Altaf thought that this is unsustainable; the English alphabet only has 26 letters, so this scheme can only work up to base 36. But this is no problem for Altaf, because Altaf is very creative and can just invent new digit symbols when she needs them. (Altaf is very creative.)
Altaf also noticed that in base two, all positive integers start with the digit 1! However, this is the only base where this is true. So naturally, Altaf wonders: Given some integer N, how many bases b are there such that the baseb representation of N starts with a 1? 
INPUT FORMAT :
The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows.
Each test case consists of one line containing a single integer N (in base ten).
OUTPUT FORMAT :
For each test case, output a single line containing the number of bases b, or INFINITY if there are an infinite number of them.
CONSTRAINTS :
 1 <= T <= 10^5
 0 <= N < 10^12
SAMPLE INPUT :
04, 06, 09, 11 & 24
SAMPLE OUTPUT :
04, 07, 08, 14
Example: C++ Programs 
#include<bits/stdc++.h> using namespace std; vector<long long int>v[47]; int main() { long long int i,j; for(i=2;i<=(int)1e6;i++) { long long int tem=i; for(j=2;j<=40;j++) { tem=tem*i; if(tem>(long long int)1e12) break; v[j].push_back(tem); } } int t; scanf("%d",&t); while(t) { long long int m; scanf("%lld",&m); if(m==1) { printf("INFINITY\n"); continue; } long long int ans=(m+1)/2; long long int p=m/2+1; for(i=2;i<=40;i++) ans=ans+(lower_bound(v[i].begin(),v[i].end(),m+1)lower_bound(v[i].begin(),v[i].end(),p)); printf("%lld\n",ans); } return 0; } 
HackWithInfy Rounds
The HackWithInfy consists of total 02 rounds which are given below
Round 01  Round 02 


Information:

Information:

Online Test Pattern for HackWithInfy 2022
 Round 1: Consists 3 Coding Question till Medium Difficulty Level
 Round 2: Hardest Round of all Questions are based and conducted on the HackerEarth platform
HackWithInfy 2022 Syllabus
Section Name  No.of Questions 

Round 1  3 on Hackerrank Platform 
Round 2  Hackathon on HackerEarth Platform 
Interview  After Clearing HackerEarth Hackathon 
Important Details 
