{"id":361,"date":"2021-04-06T14:24:35","date_gmt":"2021-04-06T08:54:35","guid":{"rendered":"https:\/\/codequotient.com\/blog\/?page_id=361"},"modified":"2024-06-21T11:19:39","modified_gmt":"2024-06-21T05:49:39","slug":"complete-guide-to-hackwithinfy","status":"publish","type":"page","link":"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/","title":{"rendered":"HackWithInfy: Everything You Need to Know"},"content":{"rendered":"<p><img fetchpriority=\"high\" decoding=\"async\" class=\"aligncenter wp-image-3579 size-full\" src=\"https:\/\/codequotient.com\/blog\/wp-content\/uploads\/2023\/02\/HackWithInfy-The-Complete-Guide-New.jpg\" alt=\"HackWithInfy-The-Complete-Guide\" width=\"1480\" height=\"774\" \/><\/p>\n<p><a href=\"https:\/\/www.infosys.com\/careers\/hackwithinfy.html\">HackWithInfy<\/a> is a highly competitive programming competition organised by <a href=\"https:\/\/www.infosys.com\/\">Infosys<\/a>, one of the largest IT companies in India. The competition aims to provide a platform for aspiring software developers to showcase their skills and get an opportunity to work with Infosys.<\/p>\n<p>The HackWithInfy exam is a comprehensive test that assesses the participant&#8217;s technical skills in data structures, algorithms, programming languages, and problem-solving. It is open to students, fresh graduates, and working professionals looking to build careers in the IT industry.<\/p>\n<p>In this article, we provide a complete one-stop resource guide to the HackWithInfy competition 2024 for all participants. It covers information on the eligibility criteria, dates, syllabus, common questions, results and more.<\/p>\n<div id=\"ez-toc-container\" class=\"ez-toc-v2_0_82_2 ez-toc-wrap-center counter-hierarchy ez-toc-counter ez-toc-custom ez-toc-container-direction\">\n<div class=\"ez-toc-title-container\">\n<p class=\"ez-toc-title\" style=\"cursor:inherit\">Table of Contents<\/p>\n<span class=\"ez-toc-title-toggle\"><a href=\"#\" class=\"ez-toc-pull-right ez-toc-btn ez-toc-btn-xs ez-toc-btn-default ez-toc-toggle\" aria-label=\"Toggle Table of Content\"><span class=\"ez-toc-js-icon-con\"><span class=\"\"><span class=\"eztoc-hide\" style=\"display:none;\">Toggle<\/span><span class=\"ez-toc-icon-toggle-span\"><svg style=\"fill: #dd6833;color:#dd6833\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" class=\"list-377408\" width=\"20px\" height=\"20px\" viewBox=\"0 0 24 24\" fill=\"none\"><path d=\"M6 6H4v2h2V6zm14 0H8v2h12V6zM4 11h2v2H4v-2zm16 0H8v2h12v-2zM4 16h2v2H4v-2zm16 0H8v2h12v-2z\" fill=\"currentColor\"><\/path><\/svg><svg style=\"fill: #dd6833;color:#dd6833\" class=\"arrow-unsorted-368013\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" width=\"10px\" height=\"10px\" viewBox=\"0 0 24 24\" version=\"1.2\" baseProfile=\"tiny\"><path d=\"M18.2 9.3l-6.2-6.3-6.2 6.3c-.2.2-.3.4-.3.7s.1.5.3.7c.2.2.4.3.7.3h11c.3 0 .5-.1.7-.3.2-.2.3-.5.3-.7s-.1-.5-.3-.7zM5.8 14.7l6.2 6.3 6.2-6.3c.2-.2.3-.5.3-.7s-.1-.5-.3-.7c-.2-.2-.4-.3-.7-.3h-11c-.3 0-.5.1-.7.3-.2.2-.3.5-.3.7s.1.5.3.7z\"\/><\/svg><\/span><\/span><\/span><\/a><\/span><\/div>\n<nav><ul class='ez-toc-list ez-toc-list-level-1 ' ><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-1\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#Why-Participate-in-HackWithInfy\" >Why Participate in HackWithInfy?<\/a><ul class='ez-toc-list-level-3' ><li class='ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-2\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#Prize-Money\" >Prize Money<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-3\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#Kickstart-Your-Career\" >Kickstart Your Career<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-4\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#Other-Opportunities\" >Other Opportunities\u00a0<\/a><\/li><\/ul><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-5\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#Background-of-HackWithInfy\" >Background of HackWithInfy\u00a0<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-6\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#HackWithInfy-2024-Registration-and-Eligibility\" >HackWithInfy 2024 Registration and Eligibility<\/a><ul class='ez-toc-list-level-3' ><li class='ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-7\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#Eligibility-Criteria-of-HackWithInfy\" >Eligibility Criteria of HackWithInfy\u00a0<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-8\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#Ensure-your-computer-meets-these-system-requirements-before-taking-the-online-test\" >Ensure your computer meets these system requirements before taking the online test:<\/a><\/li><\/ul><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-9\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#Selection-Process-of-HackWithInfy\" >Selection Process of HackWithInfy<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-10\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#HackWithInfy-2024-Syllabus\" >HackWithInfy 2024 Syllabus<\/a><ul class='ez-toc-list-level-3' ><li class='ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-11\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#Round-1-Certification-Round\" >Round 1: Certification Round<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-12\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#Round-2-Grand-Finale\" >Round 2: Grand Finale<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-13\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#Interview-Round\" >Interview Round\u00a0<\/a><\/li><\/ul><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-14\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#Technical-Requirements-of-HackWithInfy\" >Technical Requirements of HackWithInfy<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-15\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#Evaluation-Criteria-of-HackWithInfy-2024\" >Evaluation Criteria of HackWithInfy 2024<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-16\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#Preparing-for-HackWithInfy-2024-Vital-Tips\" >Preparing for HackWithInfy 2024: Vital Tips<\/a><ul class='ez-toc-list-level-3' ><li class='ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-17\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#Resources-to-prepare-for-HackWithInfy-2024\" >Resources to prepare for HackWithInfy 2024<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-18\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#Detailed-Preparation-Strategy-for-HackWithInfy\" >Detailed Preparation Strategy for HackWithInfy<\/a><\/li><\/ul><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-19\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#Previous-HackWithInfy-Questions\" >Previous HackWithInfy Questions<\/a><ul class='ez-toc-list-level-4' ><li class='ez-toc-heading-level-4'><ul class='ez-toc-list-level-4' ><li class='ez-toc-heading-level-4'><a class=\"ez-toc-link ez-toc-heading-20\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#Question-1\" >Question 1<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-4'><a class=\"ez-toc-link ez-toc-heading-21\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#Question-2\" >Question 2<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-4'><a class=\"ez-toc-link ez-toc-heading-22\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#Question-3\" >Question 3<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-4'><a class=\"ez-toc-link ez-toc-heading-23\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#Question-4\" >Question 4<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-4'><a class=\"ez-toc-link ez-toc-heading-24\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#Question-5\" >Question 5<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-4'><a class=\"ez-toc-link ez-toc-heading-25\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#Question-6\" >Question 6<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-4'><a class=\"ez-toc-link ez-toc-heading-26\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#Question-7\" >Question 7<\/a><\/li><\/ul><\/li><\/ul><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-27\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#How-Will-The-HackWithInfy-2024-Results-Be-Announced\" >How Will The HackWithInfy 2024 Results Be Announced?<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-28\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#Final-Words\" >Final Words<\/a><ul class='ez-toc-list-level-3' ><li class='ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-29\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#Take-your-Coding-Skills-A-Notch-Higher\" >Take your Coding Skills A Notch Higher<\/a><\/li><\/ul><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-30\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#FAQs\" >FAQs<\/a><ul class='ez-toc-list-level-3' ><li class='ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-31\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#1-How-do-I-apply-for-HackWithInfy\" >1. How do I apply for HackWithInfy?<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-32\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#2-Can-I-register-for-both-HackWithInfy-and-Infosys-Certification\" >2. Can I register for both HackWithInfy and Infosys Certification?<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-33\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#3-Is-participation-in-HackWithInfy-only-as-a-team-or-can-individuals-also-participate\" >3. Is participation in HackWithInfy only as a team, or can individuals also participate?<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-34\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#4-What-if-I-have-technical-issues-with-my-computer-or-internet-connection-during-the-contest\" >4. What if I have technical issues with my computer or internet connection during the contest?<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-35\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#5-Do-I-need-to-be-online-the-entire-time-during-Round-1\" >5. Do I need to be online the entire time during Round 1?<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-36\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#6-Can-I-view-the-solutions-for-the-problems-in-the-challenge\" >6. Can I view the solutions for the problems in the challenge?<\/a><\/li><\/ul><\/li><\/ul><\/nav><\/div>\n\n<h2><span class=\"ez-toc-section\" id=\"Why-Participate-in-HackWithInfy\"><\/span><b>Why Participate in HackWithInfy?<\/b><span class=\"ez-toc-section-end\"><\/span><\/h2>\n<p><img decoding=\"async\" class=\"aligncenter wp-image-3573 size-full\" src=\"https:\/\/codequotient.com\/blog\/wp-content\/uploads\/2023\/02\/Why-Participate-in-HackWithInfy-new.jpg\" alt=\"Why-Participate-in-HackWithInfy\" width=\"1480\" height=\"480\" \/><\/p>\n<div class=\"su-note\"  style=\"border-color:#c34e19;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\"><div class=\"su-note-inner su-u-clearfix su-u-trim\" style=\"background-color:#DD6833;border-color:#ffffff;color:#333333;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\">\n<h3><span class=\"ez-toc-section\" id=\"Prize-Money\"><\/span><b>Prize Money<\/b><span class=\"ez-toc-section-end\"><\/span><\/h3>\n<\/div><\/div>\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"1\">First Place: INR 200,000<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Second Place: INR 100,000<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Third Place: INR 50,000<\/li>\n<\/ul>\n<div class=\"su-note\"  style=\"border-color:#c34e19;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\"><div class=\"su-note-inner su-u-clearfix su-u-trim\" style=\"background-color:#DD6833;border-color:#ffffff;color:#333333;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\">\n<h3><span class=\"ez-toc-section\" id=\"Kickstart-Your-Career\"><\/span><b>Kickstart Your Career<\/b><span class=\"ez-toc-section-end\"><\/span><\/h3>\n<\/div><\/div>\n<p>A chance to secure a full-time job with Infosys as<\/p>\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"1\">A Power Programmer with a salary of INR 8,32,198 per annum.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Digital System Engineer with a salary of INR 6,32,198 per annum.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><a href=\"https:\/\/codequotient.com\/blog\/infosys-syllabus-systems-engineer-interview\/\">System Engineer<\/a> Specialist with a salary of INR 5,19,198 per annum.<\/li>\n<\/ul>\n<div class=\"su-note\"  style=\"border-color:#c34e19;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\"><div class=\"su-note-inner su-u-clearfix su-u-trim\" style=\"background-color:#DD6833;border-color:#ffffff;color:#333333;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\">\n<h3><span class=\"ez-toc-section\" id=\"Other-Opportunities\"><\/span><b>Other Opportunities\u00a0<\/b><span class=\"ez-toc-section-end\"><\/span><\/h3>\n<\/div><\/div>\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Pre-placement interview opportunities for niche technical roles at Infosys.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">A chance to secure <a href=\"https:\/\/codequotient.com\/blog\/benefits-infosyss-instep-internship-program-ranked-consecutive-years\/\">paid internships<\/a>.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">A chance to become a Campus Ambassador.<\/li>\n<\/ul>\n<div class=\"su-note\"  style=\"border-color:#c34e19;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\"><div class=\"su-note-inner su-u-clearfix su-u-trim\" style=\"background-color:#DD6833;border-color:#ffffff;color:#333333;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\">\n<h2><span class=\"ez-toc-section\" id=\"Background-of-HackWithInfy\"><\/span><b>Background of HackWithInfy\u00a0<\/b><span class=\"ez-toc-section-end\"><\/span><\/h2>\n<\/div><\/div>\n<p>HackWithInfy dates back to 2018, when it was first launched as a coding competition for engineering students. Over the years, the competition has gained popularity among students and has become a widely-recognised platform for showcasing their skills and competing with their peers. The competition&#8217;s top performers are also given an opportunity to work with Infosys, further providing them with the exposure they need to develop their skills and pursue their careers in the tech industry.<\/p>\n<p>HackWithInfy is organised by Infosys, a global leader in next-generation digital services and consulting. With a mission to create the next opportunity for people, businesses, and communities and amplify human potential, Infosys has been at the forefront of digital transformation for over thirty years.<\/p>\n<p>The company&#8217;s expertise and experience in technology, innovation, and problem-solving are evident in the design of HackWithInfy, which aims to nurture young talent in programming and software development.<\/p>\n<p>By providing a platform for students to showcase their skills, Infosys seeks to identify and support the next generation of tech leaders and innovators.<\/p>\n<h2><span class=\"ez-toc-section\" id=\"HackWithInfy-2024-Registration-and-Eligibility\"><\/span><b>HackWithInfy 2024 Registration and Eligibility<\/b><span class=\"ez-toc-section-end\"><\/span><\/h2>\n<p><img decoding=\"async\" class=\"aligncenter size-full wp-image-3581\" src=\"https:\/\/codequotient.com\/blog\/wp-content\/uploads\/2023\/02\/HackWithInfy-2023-Registration-and-Eligibility.jpg\" alt=\"HackWithInfy-2023-Registration-and-Eligibility\" width=\"1480\" height=\"480\" \/><\/p>\n<p>All students from colleges, universities, and institutes in India are welcome to participate in HackWithInfy!<\/p>\n<p>The registration process is simple and can be done through <a href=\"https:\/\/infytq.onwingspan.com\/en\/page\/home\">InfyTQ<\/a>, Infosys&#8217; learning and engagement platform for engineering students in India.<\/p>\n<p><b>If you already have an InfyTQ account<\/b>, simply click on the HackWithInfy program banner on the InfyTQ homepage to register. If you&#8217;re new to InfyTQ, simply visit the website to create an account and sign up for HackWithInfy.<\/p>\n<div class=\"su-note\"  style=\"border-color:#c34e19;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\"><div class=\"su-note-inner su-u-clearfix su-u-trim\" style=\"background-color:#DD6833;border-color:#ffffff;color:#333333;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\">\n<h3><span class=\"ez-toc-section\" id=\"Eligibility-Criteria-of-HackWithInfy\"><\/span><b><\/b><b>Eligibility Criteria of HackWithInfy\u00a0<\/b><span class=\"ez-toc-section-end\"><\/span><\/h3>\n<\/div><\/div>\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Must be 18 years or older and a resident of India at the time of registration.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Must be a B.E.\/ B. Tech\/ M.E.\/ M. Tech student.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">A minimum percentage of 60% or 6.5 CGPA in all academic records from 10th, 12th, UG, or PG.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">The company may request proof of eligibility for verification.<\/li>\n<\/ul>\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Participants can only register through a single InfyTQ account.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Registration is free and can be done through InfyTQ, which is available on the Google Play Store, iOS App Store, or the InfyTQ website.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Multiple registrations through different InfyTQ accounts will be disqualified.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">No active backlogs.<\/li>\n<\/ul>\n<div class=\"su-note\"  style=\"border-color:#c34e19;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\"><div class=\"su-note-inner su-u-clearfix su-u-trim\" style=\"background-color:#DD6833;border-color:#ffffff;color:#333333;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\">\n<h3><span class=\"ez-toc-section\" id=\"Ensure-your-computer-meets-these-system-requirements-before-taking-the-online-test\"><\/span><b>Ensure your computer meets these system requirements before taking the online test:<\/b><span class=\"ez-toc-section-end\"><\/span><\/h3>\n<\/div><\/div>\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"1\">i3 Core processor or higher.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">4GB RAM minimum.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Working webcam.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Google Chrome browser version 70 or higher with pop-up blocker disabled.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Stable internet connection (2 Mbps download, 1 Mbps upload speed).<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Uninterrupted power supply during the test.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Check system readiness by clicking <a href=\"https:\/\/rec-test.infosys.com\/precheck\">here<\/a>.<\/li>\n<\/ul>\n<h2><span class=\"ez-toc-section\" id=\"Selection-Process-of-HackWithInfy\"><\/span><b>Selection Process of HackWithInfy<\/b><span class=\"ez-toc-section-end\"><\/span><\/h2>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"aligncenter wp-image-3574 size-full\" src=\"https:\/\/codequotient.com\/blog\/wp-content\/uploads\/2023\/02\/Selection-Process-of-HackWithInfy-New.jpg\" alt=\"Selection-Process-of-HackWithInfy\" width=\"1480\" height=\"480\" \/><\/p>\n<p>HackWithInfy consists of two rounds and an interview:<\/p>\n<ol>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><b>Round 1<\/b>: April 6, 7, and 9, 2024: Online individual challenge on Infosys Assessment Platform (IAP).<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><b>Round 2<\/b>: July \u2013 August 2024: A 48-hour hackathon among teams and a Grand Finale for the top 100 participants from Round 1.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Winners from Round 2 will qualify for the <a href=\"https:\/\/codequotient.com\/blog\/job-interview-tips-for-freshers\/\"><b>interviews<\/b><\/a>.<\/li>\n<\/ol>\n<p>Round 1 will be hosted on the IAP and evaluated by the judging panel based on the following criteria:<\/p>\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Code efficiency and the number of test cases passed.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">The difficulty level of the questions and evaluation of solutions.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Negative marking for plagiarism.<\/li>\n<\/ul>\n<p>Round 2 will be a team-based hackathon, and the top 100 finalists from Round 1 will participate in the Grand Finale. The finalists will also receive opportunities for pre-placement interviews and internships for niche technical roles at Infosys.<\/p>\n<p><b>Note:<\/b><\/p>\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Participants must register as individuals for Round 1, but participation in Round 2 may be on a team basis as determined by the company.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Participants who have opted for the Infosys Certification Advantage Round cannot participate in Round 1, as their performance in the Advantage Round will determine their selection for the final round of HackWithInfy 2024.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Participants providing incomplete, false, fraudulent, forged, or tampered information will be disqualified.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">The judging panel&#8217;s decision is final and will be communicated directly to the participants.<\/li>\n<\/ul>\n<h2><span class=\"ez-toc-section\" id=\"HackWithInfy-2024-Syllabus\"><\/span><b>HackWithInfy 2024 Syllabus<\/b><span class=\"ez-toc-section-end\"><\/span><\/h2>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"aligncenter size-full wp-image-3580\" src=\"https:\/\/codequotient.com\/blog\/wp-content\/uploads\/2023\/02\/HackWithInfy-2023-Syllabus.jpg\" alt=\"HackWithInfy-2023-Syllabus\" width=\"1480\" height=\"480\" \/><\/p>\n<div class=\"su-note\"  style=\"border-color:#c34e19;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\"><div class=\"su-note-inner su-u-clearfix su-u-trim\" style=\"background-color:#DD6833;border-color:#ffffff;color:#333333;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\">\n<h3><span class=\"ez-toc-section\" id=\"Round-1-Certification-Round\"><\/span><b>Round 1: Certification Round<\/b><span class=\"ez-toc-section-end\"><\/span><\/h3>\n<\/div><\/div>\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Total Number of Questions -3<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Negative Marking: No<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Time Allotted : 3 Hours<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Cut-Off: 1.5-2 Questions<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Difficulty Level- Medium-High<\/li>\n<\/ul>\n<ol>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Section I: Java\/ Python Hands-on Coding: 2 Questions.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Section II: Java\/ Python MCQ: 10 Questions.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Section III: DBMS MCQ: 10 Questions.<\/li>\n<\/ol>\n<p>The syllabus for HackWithInfy is not set, but the coding questions often <b>cover the following topics<\/b>:<\/p>\n<ul>\n<li aria-level=\"1\"><b>Java<\/b><\/li>\n<\/ul>\n<ul>\n<li style=\"list-style-type: none;\">\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"2\">Introduction to Programming<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"2\">Polymorphism<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"2\">OOP Basics<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"2\">Arrays and String<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"2\">Abstract, final and Interfaces<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"2\">Recursion<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<ul>\n<li aria-level=\"1\"><b>Python<\/b><\/li>\n<\/ul>\n<ul>\n<li style=\"list-style-type: none;\">\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"2\">Introduction to Programming<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"2\">Algorithms<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"2\">Control Structure<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"2\">Collection<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"2\">Functions<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"2\">OOPS Concept<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<ul>\n<li aria-level=\"1\"><b>InfyTQ DBMS Syllabus<\/b><\/li>\n<\/ul>\n<ul>\n<li style=\"list-style-type: none;\">\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"2\">Introduction to DBMS<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"2\"><a href=\"https:\/\/codequotient.com\/blog\/select-best-online-sql-compiler\/\">SQL Basics<\/a><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"2\">Joins<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"2\">Normalisation<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"2\">Subquery<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"2\">Searching and Sorting<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"2\">Transactions<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"2\">NoSQL Databases<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<p>The top 100 finalists from round 1 will be invited to the Grand Finale, and they will get an excellent opportunity for Pre-Placement at Infosys for the role of Power Programmer.<\/p>\n<div class=\"su-note\"  style=\"border-color:#c34e19;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\"><div class=\"su-note-inner su-u-clearfix su-u-trim\" style=\"background-color:#DD6833;border-color:#ffffff;color:#333333;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\">\n<h3><span class=\"ez-toc-section\" id=\"Round-2-Grand-Finale\"><\/span><b>Round 2: Grand Finale<\/b><span class=\"ez-toc-section-end\"><\/span><\/h3>\n<\/div><\/div>\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"1\">No. of Questions: 1<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Negative Marking: No<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Time Allotted: 48-hour Hackathon<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Difficulty Level- High<\/li>\n<\/ul>\n<p><b>Must-know topics:<\/b><\/p>\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Data Structures<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Hashing Concepts<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Game Theory<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Mathematical Coding Problems<\/li>\n<\/ul>\n<p>The winner will be rewarded with a prize of Rs 2 Lakh. The first runner-up will also receive a prize of 1 lakh, and the second runner-up will receive a prize mon of Rs 50,000.<\/p>\n<div class=\"su-note\"  style=\"border-color:#c34e19;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\"><div class=\"su-note-inner su-u-clearfix su-u-trim\" style=\"background-color:#DD6833;border-color:#ffffff;color:#333333;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\">\n<h3><span class=\"ez-toc-section\" id=\"Interview-Round\"><\/span><b>Interview Round<\/b><b>\u00a0<\/b><span class=\"ez-toc-section-end\"><\/span><\/h3>\n<\/div><\/div>\n<p>The Interview Round is the final stage of the selection process. During the <a href=\"https:\/\/codequotient.com\/blog\/cracking-coding-interview-technical-rounds\/\">technical interview<\/a>, candidates will be asked technical and HR questions. To reach this stage, candidates must have cleared all three previous rounds.<\/p>\n<p>The Interview Round consists of two rounds:<\/p>\n<ol>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><b>Technical Round:<\/b> This round will test your technical knowledge and skills through coding questions.<\/li>\n<\/ol>\n<ol>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><b>HR Round:<\/b> This is an opportunity for the panel to evaluate your communication skills, personality, and fit for the company.<\/li>\n<\/ol>\n<p><b>Questions can be asked on a range of topics<\/b>, including but not limited to:<\/p>\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Data Structure<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Algorithms<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">DBMS<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Operating Systems<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Networking<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">OOP concepts.<\/li>\n<\/ul>\n<div class=\"su-note\"  style=\"border-color:#c34e19;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\"><div class=\"su-note-inner su-u-clearfix su-u-trim\" style=\"background-color:#DD6833;border-color:#ffffff;color:#333333;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\">\n<h2><span class=\"ez-toc-section\" id=\"Technical-Requirements-of-HackWithInfy\"><\/span><b>Technical Requirements of HackWithInfy<\/b><span class=\"ez-toc-section-end\"><\/span><\/h2>\n<\/div><\/div>\n<ol>\n<li><b> Programming Language Proficiency<\/b><\/li>\n<\/ol>\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Strong command of the programming language you choose to code in.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">It&#8217;s recommended to choose a language with which you&#8217;re most comfortable (C, C++, or <a href=\"https:\/\/codequotient.com\/blog\/7-python-books-developers-must-read\/\">Python<\/a>).<\/li>\n<\/ul>\n<ol start=\"2\">\n<li><b> Practice Platform<\/b><\/li>\n<\/ol>\n<p>Select a platform where you can regularly practice coding problems (e.g. HackerEarth, Codechef, HackerRank).<\/p>\n<ol start=\"3\">\n<li><b> Typing Speed<\/b><\/li>\n<\/ol>\n<p>Good typing speed is important to save time for re-checking and modifying code.<\/p>\n<div class=\"su-note\"  style=\"border-color:#c34e19;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\"><div class=\"su-note-inner su-u-clearfix su-u-trim\" style=\"background-color:#DD6833;border-color:#ffffff;color:#333333;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\">\n<h2><span class=\"ez-toc-section\" id=\"Evaluation-Criteria-of-HackWithInfy-2024\"><\/span><b>Evaluation Criteria of HackWithInfy 2024<\/b><span class=\"ez-toc-section-end\"><\/span><\/h2>\n<\/div><\/div>\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><b>Code Effectiveness:<\/b> Evaluated based on the number of test cases passed by the code.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><b>Plagiarism:<\/b> Strictly prohibited and will result in negative marking.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><b>Difficulty Level:<\/b> Questions are assigned marks based on their difficulty level, and evaluations are made accordingly.<\/li>\n<\/ul>\n<h2><span class=\"ez-toc-section\" id=\"Preparing-for-HackWithInfy-2024-Vital-Tips\"><\/span><b>Preparing for HackWithInfy 2024: Vital Tips<\/b><span class=\"ez-toc-section-end\"><\/span><\/h2>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"aligncenter size-full wp-image-3577\" src=\"https:\/\/codequotient.com\/blog\/wp-content\/uploads\/2023\/02\/Preparing-for-HackWithInfy-2023-Vital-Tips.jpg\" alt=\"Preparing-for-HackWithInfy-2023-Vital-Tips\" width=\"1480\" height=\"480\" \/><\/p>\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><b>Brush up on Data Structures:<\/b> Make sure you have a good understanding of the most commonly used data structures, such as arrays, linked lists, trees, graphs, etc.<\/li>\n<\/ul>\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><b>Study Algorithms:<\/b> Focus on algorithms like Dynamic Programming, Greedy Algorithms, Backtracking, Stack, Queue, etc.<\/li>\n<\/ul>\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><b>Familiarise yourself with programming languages:<\/b> Choose a language you are most comfortable with and practice coding in that language. Python, C, and C++ are recommended.<\/li>\n<\/ul>\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><b>Use online platforms for practice:<\/b> Platforms like HackerRank, Codeforces, HackerEarth, etc., are a great way to practice coding problems and improve your skills.<\/li>\n<\/ul>\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><b>Time Management:<\/b> Practice solving coding problems within a set time limit to improve speed and accuracy.<\/li>\n<\/ul>\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><b>Practice Previous Year Questions:<\/b> Solve previous year&#8217;s HackWithInfy questions to get a feel for the difficulty level and type of questions asked.<\/li>\n<\/ul>\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><b>Read Books and Online Resources:<\/b> Many books and online resources are available to help you prepare for the exam. Use these resources to build a strong foundation in computer science concepts.<\/li>\n<\/ul>\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><b>Seek Help:<\/b> Don&#8217;t hesitate to seek help from your professors, mentors, or senior students.<\/li>\n<\/ul>\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><b>Get enough sleep and exercise. <\/b>Keeping yourself physically and mentally healthy\u00a0will help you perform better during the exam.<\/li>\n<\/ul>\n<div class=\"su-note\"  style=\"border-color:#c34e19;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\"><div class=\"su-note-inner su-u-clearfix su-u-trim\" style=\"background-color:#DD6833;border-color:#ffffff;color:#333333;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\">\n<h3><span class=\"ez-toc-section\" id=\"Resources-to-prepare-for-HackWithInfy-2024\"><\/span><b>Resources to prepare for HackWithInfy 2024<\/b><span class=\"ez-toc-section-end\"><\/span><\/h3>\n<\/div><\/div>\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"1\">GeeksforGeeks<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Leetcode<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Codechef<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">HackerRank<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">HackerEarth<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Books on <a href=\"https:\/\/codequotient.com\/blog\/data-structures-algorithms-comprehensive-guide\/\">Data Structures and Algorithms<\/a>.<\/li>\n<\/ul>\n<div class=\"su-note\"  style=\"border-color:#c34e19;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\"><div class=\"su-note-inner su-u-clearfix su-u-trim\" style=\"background-color:#DD6833;border-color:#ffffff;color:#333333;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\">\n<h3><span class=\"ez-toc-section\" id=\"Detailed-Preparation-Strategy-for-HackWithInfy\"><\/span><b>Detailed Preparation Strategy for HackWithInfy<\/b><b><\/b><span class=\"ez-toc-section-end\"><\/span><\/h3>\n<\/div><\/div>\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Participate in coding competitions like CodeChef and TopCoder to get a feel of the pressure and time constraints during the actual exam.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Practice solving coding problems under time constraints to improve your speed and accuracy.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Seek feedback from seniors or mentors to identify your strengths and weaknesses and work on them.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Take mock tests to familiarise yourself with the type of questions that might be asked in the exam.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Practice coding problems on online platforms such as LeetCode, HackerRank, and GeeksforGeeks. These platforms have a wide range of questions on topics like algorithms, data structures, and more.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><a href=\"https:\/\/codequotient.com\/blog\/programming-career\/\">Study books<\/a> like &#8220;Introduction to Algorithms&#8221; by Thomas H. Cormen, &#8220;Data Structures and Algorithms Made Easy&#8221; by Narasimha Karumanchi, and &#8220;Competitive Programming 3&#8221; by Steven Halim.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Make use of YouTube tutorials and video lessons to learn about the topics covered in the exam. Channels like MyCodeSchool, GeeksforGeeks, and HackerEarth have great content.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Utilise the practice papers and mock tests available on websites like Prepinsta and IndiaBix to get an idea of the types of questions that may be asked in the exam.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Brush up on core computer science concepts like OOPs, DBMS, and networking. Websites like Coursera, Udemy, and edX have courses on these topics.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Join online study groups and forums to discuss doubts and improve problem-solving skills. Websites like Stack Overflow and Quora have communities dedicated to computer science and coding.<\/li>\n<\/ul>\n<p>You can also take the <a href=\"https:\/\/infytq.onwingspan.com\/web\/en\/infytq-login?ref=%2Fviewer%2Fiap%2Flex_auth_0132317475110666243\">sample test<\/a> to understand the test platform and the environment.<\/p>\n<p>Follow the tips and utilise the available resources to stay well-prepared and <a href=\"https:\/\/codequotient.com\/blog\/hackwithinfy-head-detailed-preparation-strategy\/\">give your best in HackWithInfy 2024<\/a>.<\/p>\n<p>Remember, the key to success in the HackWithInfy exam is consistent practice and a strong grasp of core computer science concepts.<\/p>\n<div class=\"su-note\"  style=\"border-color:#c34e19;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\"><div class=\"su-note-inner su-u-clearfix su-u-trim\" style=\"background-color:#DD6833;border-color:#ffffff;color:#333333;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\">\n<h2><span class=\"ez-toc-section\" id=\"Previous-HackWithInfy-Questions\"><\/span><b>Previous HackWithInfy Questions<\/b><span class=\"ez-toc-section-end\"><\/span><\/h2>\n<\/div><\/div>\n<p>The Questions from previous HackWithInfys play a crucial role in preparation for the examination. These questions provide insight into the type and difficulty level of questions that can be expected in the actual program.<\/p>\n<div class=\"su-note\"  style=\"border-color:#c34e19;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\"><div class=\"su-note-inner su-u-clearfix su-u-trim\" style=\"background-color:#DD6833;border-color:#ffffff;color:#333333;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\">\n<h4><span class=\"ez-toc-section\" id=\"Question-1\"><\/span><b>Question 1<\/b><span class=\"ez-toc-section-end\"><\/span><\/h4>\n<\/div><\/div>\n<p>As the hotel manager, you have N guests to attend to, and each guest has a happiness value (Ci) that depends on when they are served. A guest&#8217;s unhappiness is determined by the difference between their happiness value (Ci) and the time (x) they are served, which is calculated as |Ci\u2014x|.<\/p>\n<p>Your goal is to find the minimum total unhappiness by serving all guests in any order you choose.<\/p>\n<p>Please note that at a given time, only one guest can be served, and each guest takes exactly one unit of time to be served.<\/p>\n<p>Here are the constraints:<\/p>\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"1\">1 &lt;= N &lt;= 10^3<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">1 &lt;= Ci &lt;= N<\/li>\n<\/ul>\n<p>For example:<\/p>\n<p>Input: 4 2 2 3 3<\/p>\n<p>Output: 2<\/p>\n<p>Input: 4 1 1 1 1<\/p>\n<p>Output: 6<\/p>\n<div class=\"su-note\"  style=\"border-color:#c34e19;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\"><div class=\"su-note-inner su-u-clearfix su-u-trim\" style=\"background-color:#DD6833;border-color:#ffffff;color:#333333;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\">\n<h4><span class=\"ez-toc-section\" id=\"Question-2\"><\/span><b>Question 2<\/b><span class=\"ez-toc-section-end\"><\/span><\/h4>\n<\/div><\/div>\n<p>You&#8217;re tasked with finding the total number of positive integer pairs (A, B) where A, B &lt;= N, A^B &lt;= X and A+B is divisible by D. Given the inputs N, X and D, return the result modulo 10^9+7 as the total number of pairs can be large.<\/p>\n<p>Here&#8217;s an example: for the inputs 4, 3, and 2, there are six pairs that meet the conditions: (1,1), (1,3), (2,2), (3,1), (3,3), (4,4).<\/p>\n<p>For debugging purposes, a sample test case of 100, 121, and 2 should return 4778.<\/p>\n<div class=\"su-note\"  style=\"border-color:#c34e19;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\"><div class=\"su-note-inner su-u-clearfix su-u-trim\" style=\"background-color:#DD6833;border-color:#ffffff;color:#333333;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\">\n<h4><span class=\"ez-toc-section\" id=\"Question-3\"><\/span><b>Question 3<\/b><span class=\"ez-toc-section-end\"><\/span><\/h4>\n<\/div><\/div>\n<p>Given an array of size N and the limit M, find the maximum number of triplets that can be formed such that each element of the array is &lt;= M. A triplet is considered valid if it meets either of the following criteria:<\/p>\n<p>All numbers in the triplet are the same.<\/p>\n<p>The numbers are consecutive.<\/p>\n<p>Each element in the array can only belong to one triplet.<\/p>\n<p>Constraints:<\/p>\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"1\">1 &lt;= N &lt;= 10^5<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">1 &lt;= M &lt;= 10^4<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">1 &lt;= arr[i] &lt;= M<\/li>\n<\/ul>\n<p>Example:<\/p>\n<p>Input:<\/p>\n<p>4 2<\/p>\n<p>1 2 2 2<\/p>\n<p>Output:<\/p>\n<p>1<\/p>\n<p>Explanation: Only one triplet can be formed {2,2,2}<\/p>\n<div class=\"su-note\"  style=\"border-color:#c34e19;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\"><div class=\"su-note-inner su-u-clearfix su-u-trim\" style=\"background-color:#DD6833;border-color:#ffffff;color:#333333;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\">\n<h4><span class=\"ez-toc-section\" id=\"Question-4\"><\/span><b>Question 4<\/b><span class=\"ez-toc-section-end\"><\/span><\/h4>\n<\/div><\/div>\n<p>Find the minimum possible absolute difference between the maximum and minimum sum of elements in 4 non-empty contiguous subsequences of an array A of N elements by making three cuts.<\/p>\n<p>Constraints:<\/p>\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"1\">4 &lt;= N &lt;= 10^5<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">1 &lt;= A[i] &lt;= 10^4<\/li>\n<\/ul>\n<p>Input:<\/p>\n<p>10<\/p>\n<p>10 71 84 33 6 47 23 25 52 64<\/p>\n<p>Output:<\/p>\n<p>36<\/p>\n<div class=\"su-note\"  style=\"border-color:#c34e19;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\"><div class=\"su-note-inner su-u-clearfix su-u-trim\" style=\"background-color:#DD6833;border-color:#ffffff;color:#333333;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\">\n<h4><span class=\"ez-toc-section\" id=\"Question-5\"><\/span><b>Question 5<\/b><span class=\"ez-toc-section-end\"><\/span><\/h4>\n<\/div><\/div>\n<p>You are given N people and K days, each day represented by an array of N numbers, indicating the order of the people who arrived at the theatre. Your task is to find the largest group of people who arrive in the same order for all K days.<\/p>\n<p>Constraints:<\/p>\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"1\">1 &lt;= N &lt;= 1000<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">1 &lt;= K &lt;= 10<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">1 &lt;= a[i][j] &lt;= N<\/li>\n<\/ul>\n<p>Sample Input:<\/p>\n<p>N=4, K=3<\/p>\n<p>Day 1: [1, 3, 2, 4]\n<p>Day 2: [1, 3, 2, 4]\n<p>Day 3: [1, 4, 3, 2]\n<p>Sample Output:<\/p>\n<p>3 (people 1, 3, and 2 arrive in the same order for all K days)<\/p>\n<div class=\"su-note\"  style=\"border-color:#c34e19;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\"><div class=\"su-note-inner su-u-clearfix su-u-trim\" style=\"background-color:#DD6833;border-color:#ffffff;color:#333333;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\">\n<h4><span class=\"ez-toc-section\" id=\"Question-6\"><\/span><b>Question 6<\/b><span class=\"ez-toc-section-end\"><\/span><\/h4>\n<\/div><\/div>\n<p>You are given a string of length n consisting of numbers and question marks (# represents a mine, and the number represents the sum of the number of mines in the adjacent cells). Your task is to fill the question marks with either 0 or 1 in such a way that the string represents the correct sum of mines in the adjacent cells. Return the number of ways to fill the question marks.<\/p>\n<p>Constraints:<\/p>\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"1\">1 &lt;= n &lt;= 10^5<\/li>\n<\/ul>\n<p>Example Input:<\/p>\n<p>??0?1?<\/p>\n<p>Example Output:<\/p>\n<p>2<\/p>\n<p>Example explanation: Two possible ways to fill the question marks are #1001# and 00001#.<\/p>\n<div class=\"su-note\"  style=\"border-color:#c34e19;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\"><div class=\"su-note-inner su-u-clearfix su-u-trim\" style=\"background-color:#DD6833;border-color:#ffffff;color:#333333;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\">\n<h4><span class=\"ez-toc-section\" id=\"Question-7\"><\/span><b>Question 7<\/b><span class=\"ez-toc-section-end\"><\/span><\/h4>\n<\/div><\/div>\n<p>Akshat has N squares, each with a side length of S[i]. Your task is to help him create K pyramids using all N squares. The i-th pyramid has C[i] squares. The beauty of a structure is defined as the sum of the side lengths of the top and bottom squares of all K pyramids. Find the maximum beauty of a structure that can be created.<\/p>\n<p>Input:<\/p>\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"1\">First line: an integer N representing the number of squares.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Second line: an integer K representing the number of pyramids to be created.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Next N lines: an integer S[i] representing the side length of each square.<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">Next K lines: an integer C[i] representing the number of squares in the i-th pyramid.<\/li>\n<\/ul>\n<p>Constraints:<\/p>\n<ul>\n<li style=\"font-weight: 400;\" aria-level=\"1\">1 &lt;= N &lt;= 10^5<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">1 &lt;= K &lt;= 10^5<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">1 &lt;= S[i] &lt;= 10^5<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">1 &lt;= C[i] &lt;= 10^5<\/li>\n<\/ul>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"aligncenter wp-image-3576 size-full\" src=\"https:\/\/codequotient.com\/blog\/wp-content\/uploads\/2023\/02\/Question-7-1.jpg\" alt=\"Question\" width=\"1024\" height=\"693\" \/><\/p>\n<h2><span class=\"ez-toc-section\" id=\"How-Will-The-HackWithInfy-2024-Results-Be-Announced\"><\/span><b>How Will The HackWithInfy 2024 Results Be Announced?<\/b><span class=\"ez-toc-section-end\"><\/span><\/h2>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"aligncenter size-full wp-image-3578\" src=\"https:\/\/codequotient.com\/blog\/wp-content\/uploads\/2023\/02\/How-Will-The-HackWithInfy-2023-Results-Be-Announced.jpg\" alt=\"How-Will-The-HackWithInfy-2023-Results-Be-Announced\" width=\"1480\" height=\"480\" \/><\/p>\n<p>Participants will be kept in the loop about their competition status by Infosys via email updates.<\/p>\n<p>Successful Round 1 completers will receive emails regarding their results and a set of instructions for the following round.<\/p>\n<div class=\"su-note\"  style=\"border-color:#c34e19;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\"><div class=\"su-note-inner su-u-clearfix su-u-trim\" style=\"background-color:#DD6833;border-color:#ffffff;color:#333333;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\">\n<h2><span class=\"ez-toc-section\" id=\"Final-Words\"><\/span><b>Final Words<\/b><span class=\"ez-toc-section-end\"><\/span><\/h2>\n<\/div><\/div>\n<p>HackWithInfy provides a unique opportunity for students to showcase their technical skills and secure job offers. The exam covers various topics such as algorithms, data structures, <a href=\"https:\/\/codequotient.com\/blog\/software-engineer-graduate-program-essentials\/\">programming languages<\/a>, and more. It is an excellent way for students to assess their strengths and weaknesses in these areas.<\/p>\n<p>To summarise the key points, it is important for students to have a strong grip on the foundations of data structures, algorithms, and programming languages and to practice solving coding problems regularly.<\/p>\n<p>Additionally, being familiar with the exam format and prepared to answer questions on diverse topics is also essential.<\/p>\n<p>We highly encourage students to participate in HackWithInfy 2024 and take advantage of the opportunities it can provide. With proper preparation, dedication, and hard work, they can achieve great success and significantly impact the tech industry.<\/p>\n<p>Our final recommendations are to <b>never give up<\/b> and to<b> keep practising<\/b>, practising, and practising. The more time you invest in preparing for the exam, the better you will perform and the more confident you will be on exam day. Good luck!<\/p>\n<div class=\"su-note\"  style=\"border-color:#c34e19;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\"><div class=\"su-note-inner su-u-clearfix su-u-trim\" style=\"background-color:#DD6833;border-color:#ffffff;color:#333333;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\">\n<h3><span class=\"ez-toc-section\" id=\"Take-your-Coding-Skills-A-Notch-Higher\"><\/span><b><\/b><b>Take your Coding Skills A Notch Higher<\/b><span class=\"ez-toc-section-end\"><\/span><\/h3>\n<\/div><\/div>\n<p>If you&#8217;re looking to advance your coding career and stay updated on the latest tips and strategies, check out the learning and career platform <a href=\"https:\/\/codequotient.com\/\">CodeQuotient<\/a>!<\/p>\n<p>At CodeQuotient, we provide personalised guidance and resources to help you reach your goals. Plus, we offer a fantastic opportunity with our 3-month online <a href=\"https:\/\/codequotient.com\/software-engineering-bootcamp\">SuperCoders<\/a> internship program. This program is perfect for both upskilling software engineers and introducing first-time learners to project-based learning so that you can build a killer portfolio.<\/p>\n<p>Don&#8217;t hesitate to <a href=\"https:\/\/codequotient.com\/about\/#contactSection\">reach out<\/a> and learn more about how Code Quotient can help you on your coding career journey!<\/p>\n<div class=\"su-note\"  style=\"border-color:#c34e19;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\"><div class=\"su-note-inner su-u-clearfix su-u-trim\" style=\"background-color:#DD6833;border-color:#ffffff;color:#333333;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\">\n<h2><span class=\"ez-toc-section\" id=\"FAQs\"><\/span><b>FAQs<\/b><span class=\"ez-toc-section-end\"><\/span><\/h2>\n<\/div><\/div>\n<div class=\"su-note\"  style=\"border-color:#c34e19;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\"><div class=\"su-note-inner su-u-clearfix su-u-trim\" style=\"background-color:#DD6833;border-color:#ffffff;color:#333333;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\">\n<h3><span class=\"ez-toc-section\" id=\"1-How-do-I-apply-for-HackWithInfy\"><\/span><b>1. How do I apply for HackWithInfy?<\/b><span class=\"ez-toc-section-end\"><\/span><\/h3>\n<\/div><\/div>\n<p>Registrations for HackWithInfy 2024 are open only through the <a href=\"https:\/\/infytq.onwingspan.com\/en\/page\/home\">InfyTQ<\/a> portal. Tech students who are already onboard InfyTQ can apply for registration through the HackWithInfy program banner displayed on the application homepage.<\/p>\n<div class=\"su-note\"  style=\"border-color:#c34e19;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\"><div class=\"su-note-inner su-u-clearfix su-u-trim\" style=\"background-color:#DD6833;border-color:#ffffff;color:#333333;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\">\n<h3><span class=\"ez-toc-section\" id=\"2-Can-I-register-for-both-HackWithInfy-and-Infosys-Certification\"><\/span><b>2. Can I register for both HackWithInfy and Infosys Certification?<\/b><span class=\"ez-toc-section-end\"><\/span><\/h3>\n<\/div><\/div>\n<p>Yes, it is possible if you meet the eligibility criteria. Please carefully review the terms and conditions for more information.<\/p>\n<div class=\"su-note\"  style=\"border-color:#c34e19;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\"><div class=\"su-note-inner su-u-clearfix su-u-trim\" style=\"background-color:#DD6833;border-color:#ffffff;color:#333333;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\">\n<h3><span class=\"ez-toc-section\" id=\"3-Is-participation-in-HackWithInfy-only-as-a-team-or-can-individuals-also-participate\"><\/span><b>3. Is participation in HackWithInfy only as a team, or can individuals also participate?<\/b><span class=\"ez-toc-section-end\"><\/span><\/h3>\n<\/div><\/div>\n<p>Round 1 of HackWithInfy is an online test that individuals take. Teams are required in the Grand Finale. A few days before the Grand Finale, finalists will receive guidelines for forming a team.<\/p>\n<div class=\"su-note\"  style=\"border-color:#c34e19;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\"><div class=\"su-note-inner su-u-clearfix su-u-trim\" style=\"background-color:#DD6833;border-color:#ffffff;color:#333333;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\">\n<h3><span class=\"ez-toc-section\" id=\"4-What-if-I-have-technical-issues-with-my-computer-or-internet-connection-during-the-contest\"><\/span><b>4. What if I have technical issues with my computer or internet connection during the contest?<\/b><span class=\"ez-toc-section-end\"><\/span><\/h3>\n<\/div><\/div>\n<p>It&#8217;s important to ensure you have a fast and stable internet connection before the contest begins. You should also have a backup plan in case of technical issues. Infosys will not provide additional attempts.<\/p>\n<div class=\"su-note\"  style=\"border-color:#c34e19;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\"><div class=\"su-note-inner su-u-clearfix su-u-trim\" style=\"background-color:#DD6833;border-color:#ffffff;color:#333333;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\">\n<h3><span class=\"ez-toc-section\" id=\"5-Do-I-need-to-be-online-the-entire-time-during-Round-1\"><\/span><b>5. Do I need to be online the entire time during Round 1?<\/b><span class=\"ez-toc-section-end\"><\/span><\/h3>\n<\/div><\/div>\n<p>Yes, you will need to be active during the entire process. Detailed guidelines will be provided before you start coding.<\/p>\n<div class=\"su-note\"  style=\"border-color:#c34e19;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\"><div class=\"su-note-inner su-u-clearfix su-u-trim\" style=\"background-color:#DD6833;border-color:#ffffff;color:#333333;border-radius:5px;-moz-border-radius:5px;-webkit-border-radius:5px;\">\n<h3><span class=\"ez-toc-section\" id=\"6-Can-I-view-the-solutions-for-the-problems-in-the-challenge\"><\/span><b>6. Can I view the solutions for the problems in the challenge?<\/b><span class=\"ez-toc-section-end\"><\/span><\/h3>\n<\/div><\/div>\n<p>No, the problems and solutions are not made publicly available. Participants can take the <a href=\"https:\/\/infytq.onwingspan.com\/en\/infytq-login?ref=%2Fviewer%2Fiap%2Flex_auth_0132317475110666243\">sample test<\/a> to familiarise themselves with the testing platform and environment.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>HackWithInfy is a highly competitive programming competition organised by Infosys, one of the largest IT companies in India. The competition aims to provide a platform for aspiring software developers to showcase their skills and get an opportunity to work with Infosys. The HackWithInfy exam is a comprehensive test that assesses the participant&#8217;s technical skills in&#8230;<\/p>\n","protected":false},"author":1,"featured_media":3579,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_acf_changed":false,"footnotes":""},"class_list":{"0":"post-361","1":"page","2":"type-page","3":"status-publish","4":"has-post-thumbnail","5":"hentry","6":"nt-post-class","7":"","10":"excerpt-none"},"acf":[],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v27.3 - https:\/\/yoast.com\/product\/yoast-seo-wordpress\/ -->\n<title>HackWithInfy: Everything You Need to Know - CodeQuotient<\/title>\n<meta name=\"description\" content=\"All you need to know about HackWithInfy 2024: eligibility criteria, exam dates, syllabus, how to prepare, and more...\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/\" \/>\n<meta property=\"og:locale\" content=\"en_GB\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"HackWithInfy: Everything You Need to Know - CodeQuotient\" \/>\n<meta property=\"og:description\" content=\"All you need to know about HackWithInfy 2024: eligibility criteria, exam dates, syllabus, how to prepare, and more...\" \/>\n<meta property=\"og:url\" content=\"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/\" \/>\n<meta property=\"og:site_name\" content=\"CodeQuotient\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/codequotient\" \/>\n<meta property=\"article:modified_time\" content=\"2024-06-21T05:49:39+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/codequotient.com\/blog\/wp-content\/uploads\/2023\/02\/HackWithInfy-The-Complete-Guide-New.jpg\" \/>\n\t<meta property=\"og:image:width\" content=\"1480\" \/>\n\t<meta property=\"og:image:height\" content=\"774\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/jpeg\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:site\" content=\"@codequotient\" \/>\n<meta name=\"twitter:label1\" content=\"Estimated reading time\" \/>\n\t<meta name=\"twitter:data1\" content=\"3 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\\\/\\\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\\\/\\\/codequotient.com\\\/blog\\\/complete-guide-to-hackwithinfy\\\/\",\"url\":\"https:\\\/\\\/codequotient.com\\\/blog\\\/complete-guide-to-hackwithinfy\\\/\",\"name\":\"HackWithInfy: Everything You Need to Know - CodeQuotient\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/codequotient.com\\\/blog\\\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\\\/\\\/codequotient.com\\\/blog\\\/complete-guide-to-hackwithinfy\\\/#primaryimage\"},\"image\":{\"@id\":\"https:\\\/\\\/codequotient.com\\\/blog\\\/complete-guide-to-hackwithinfy\\\/#primaryimage\"},\"thumbnailUrl\":\"https:\\\/\\\/codequotient.com\\\/blog\\\/wp-content\\\/uploads\\\/2023\\\/02\\\/HackWithInfy-The-Complete-Guide-New.jpg\",\"datePublished\":\"2021-04-06T08:54:35+00:00\",\"dateModified\":\"2024-06-21T05:49:39+00:00\",\"description\":\"All you need to know about HackWithInfy 2024: eligibility criteria, exam dates, syllabus, how to prepare, and more...\",\"breadcrumb\":{\"@id\":\"https:\\\/\\\/codequotient.com\\\/blog\\\/complete-guide-to-hackwithinfy\\\/#breadcrumb\"},\"inLanguage\":\"en-GB\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\\\/\\\/codequotient.com\\\/blog\\\/complete-guide-to-hackwithinfy\\\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"en-GB\",\"@id\":\"https:\\\/\\\/codequotient.com\\\/blog\\\/complete-guide-to-hackwithinfy\\\/#primaryimage\",\"url\":\"https:\\\/\\\/codequotient.com\\\/blog\\\/wp-content\\\/uploads\\\/2023\\\/02\\\/HackWithInfy-The-Complete-Guide-New.jpg\",\"contentUrl\":\"https:\\\/\\\/codequotient.com\\\/blog\\\/wp-content\\\/uploads\\\/2023\\\/02\\\/HackWithInfy-The-Complete-Guide-New.jpg\",\"width\":1480,\"height\":774,\"caption\":\"HackWithInfy-The-Complete-Guide\"},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\\\/\\\/codequotient.com\\\/blog\\\/complete-guide-to-hackwithinfy\\\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\\\/\\\/codequotient.com\\\/blog\\\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"HackWithInfy: Everything You Need to Know\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\\\/\\\/codequotient.com\\\/blog\\\/#website\",\"url\":\"https:\\\/\\\/codequotient.com\\\/blog\\\/\",\"name\":\"CodeQuotient\",\"description\":\"Resources to be a better programmer\",\"publisher\":{\"@id\":\"https:\\\/\\\/codequotient.com\\\/blog\\\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\\\/\\\/codequotient.com\\\/blog\\\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-GB\"},{\"@type\":\"Organization\",\"@id\":\"https:\\\/\\\/codequotient.com\\\/blog\\\/#organization\",\"name\":\"CodeQuotient\",\"url\":\"https:\\\/\\\/codequotient.com\\\/blog\\\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-GB\",\"@id\":\"https:\\\/\\\/codequotient.com\\\/blog\\\/#\\\/schema\\\/logo\\\/image\\\/\",\"url\":\"https:\\\/\\\/codequotient.com\\\/blog\\\/wp-content\\\/uploads\\\/2020\\\/12\\\/codequotient-logo.png\",\"contentUrl\":\"https:\\\/\\\/codequotient.com\\\/blog\\\/wp-content\\\/uploads\\\/2020\\\/12\\\/codequotient-logo.png\",\"width\":238,\"height\":104,\"caption\":\"CodeQuotient\"},\"image\":{\"@id\":\"https:\\\/\\\/codequotient.com\\\/blog\\\/#\\\/schema\\\/logo\\\/image\\\/\"},\"sameAs\":[\"https:\\\/\\\/www.facebook.com\\\/codequotient\",\"https:\\\/\\\/x.com\\\/codequotient\",\"https:\\\/\\\/www.linkedin.com\\\/company\\\/codequotient\",\"https:\\\/\\\/www.instagram.com\\\/codequotient\\\/\"]}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"HackWithInfy: Everything You Need to Know - CodeQuotient","description":"All you need to know about HackWithInfy 2024: eligibility criteria, exam dates, syllabus, how to prepare, and more...","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/","og_locale":"en_GB","og_type":"article","og_title":"HackWithInfy: Everything You Need to Know - CodeQuotient","og_description":"All you need to know about HackWithInfy 2024: eligibility criteria, exam dates, syllabus, how to prepare, and more...","og_url":"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/","og_site_name":"CodeQuotient","article_publisher":"https:\/\/www.facebook.com\/codequotient","article_modified_time":"2024-06-21T05:49:39+00:00","og_image":[{"width":1480,"height":774,"url":"https:\/\/codequotient.com\/blog\/wp-content\/uploads\/2023\/02\/HackWithInfy-The-Complete-Guide-New.jpg","type":"image\/jpeg"}],"twitter_card":"summary_large_image","twitter_site":"@codequotient","twitter_misc":{"Estimated reading time":"3 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/","url":"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/","name":"HackWithInfy: Everything You Need to Know - CodeQuotient","isPartOf":{"@id":"https:\/\/codequotient.com\/blog\/#website"},"primaryImageOfPage":{"@id":"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#primaryimage"},"image":{"@id":"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#primaryimage"},"thumbnailUrl":"https:\/\/codequotient.com\/blog\/wp-content\/uploads\/2023\/02\/HackWithInfy-The-Complete-Guide-New.jpg","datePublished":"2021-04-06T08:54:35+00:00","dateModified":"2024-06-21T05:49:39+00:00","description":"All you need to know about HackWithInfy 2024: eligibility criteria, exam dates, syllabus, how to prepare, and more...","breadcrumb":{"@id":"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#breadcrumb"},"inLanguage":"en-GB","potentialAction":[{"@type":"ReadAction","target":["https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/"]}]},{"@type":"ImageObject","inLanguage":"en-GB","@id":"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#primaryimage","url":"https:\/\/codequotient.com\/blog\/wp-content\/uploads\/2023\/02\/HackWithInfy-The-Complete-Guide-New.jpg","contentUrl":"https:\/\/codequotient.com\/blog\/wp-content\/uploads\/2023\/02\/HackWithInfy-The-Complete-Guide-New.jpg","width":1480,"height":774,"caption":"HackWithInfy-The-Complete-Guide"},{"@type":"BreadcrumbList","@id":"https:\/\/codequotient.com\/blog\/complete-guide-to-hackwithinfy\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/codequotient.com\/blog\/"},{"@type":"ListItem","position":2,"name":"HackWithInfy: Everything You Need to Know"}]},{"@type":"WebSite","@id":"https:\/\/codequotient.com\/blog\/#website","url":"https:\/\/codequotient.com\/blog\/","name":"CodeQuotient","description":"Resources to be a better programmer","publisher":{"@id":"https:\/\/codequotient.com\/blog\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/codequotient.com\/blog\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-GB"},{"@type":"Organization","@id":"https:\/\/codequotient.com\/blog\/#organization","name":"CodeQuotient","url":"https:\/\/codequotient.com\/blog\/","logo":{"@type":"ImageObject","inLanguage":"en-GB","@id":"https:\/\/codequotient.com\/blog\/#\/schema\/logo\/image\/","url":"https:\/\/codequotient.com\/blog\/wp-content\/uploads\/2020\/12\/codequotient-logo.png","contentUrl":"https:\/\/codequotient.com\/blog\/wp-content\/uploads\/2020\/12\/codequotient-logo.png","width":238,"height":104,"caption":"CodeQuotient"},"image":{"@id":"https:\/\/codequotient.com\/blog\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/www.facebook.com\/codequotient","https:\/\/x.com\/codequotient","https:\/\/www.linkedin.com\/company\/codequotient","https:\/\/www.instagram.com\/codequotient\/"]}]}},"featured_image_src":"https:\/\/codequotient.com\/blog\/wp-content\/uploads\/2023\/02\/HackWithInfy-The-Complete-Guide-New.jpg","featured_image_src_square":"https:\/\/codequotient.com\/blog\/wp-content\/uploads\/2023\/02\/HackWithInfy-The-Complete-Guide-New.jpg","_links":{"self":[{"href":"https:\/\/codequotient.com\/blog\/wp-json\/wp\/v2\/pages\/361","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/codequotient.com\/blog\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/codequotient.com\/blog\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/codequotient.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/codequotient.com\/blog\/wp-json\/wp\/v2\/comments?post=361"}],"version-history":[{"count":26,"href":"https:\/\/codequotient.com\/blog\/wp-json\/wp\/v2\/pages\/361\/revisions"}],"predecessor-version":[{"id":5630,"href":"https:\/\/codequotient.com\/blog\/wp-json\/wp\/v2\/pages\/361\/revisions\/5630"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/codequotient.com\/blog\/wp-json\/wp\/v2\/media\/3579"}],"wp:attachment":[{"href":"https:\/\/codequotient.com\/blog\/wp-json\/wp\/v2\/media?parent=361"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}