Infosys Assessment Mail Received? Complete Test Guide for Aug 1 & 2 | Pattern, DSA & 10-Day Plan

[00:00:02]Hi all, I'm D and I welcome you to Decode's YouTube channel. Infosys has started resuming its hiring for 2025 and 2026 batch. Initially, those of you received mails regarding deferred email for um for this particular hiring of 2025 2026 have started getting their virtual coding assessment mails that is scheduled for August 1 and August 2. So uh this coding round is going to happen and for this I'm just going to give you the pattern cutff and what kind of topics you need to prepare along with a 10day preparation strategy. So watch this video till the last to get benefited from this and like this video because that will be really useful for me and motivate me to put more videos and also share this video with your friends who are also preparing. Let me show you my YouTube channel which is Decodes. The purpose of this channel is to be useful for others who are all preparing for their interviews so that they can get to the next steps of their lives. My channel covers from uh hiring update, hiring announcement till onboarding update. Whatever is in like between that um aptitude assessment, round one, communication assessment, coding rounds, uh technical interview, HR interview, manageable interview and everything, every delays and everything I update. So make sure you subscribe to my channel. Don't forget and share this channel with your friends too. Now let's get into this video without further delay. Now what exactly happened was for 2025 2026 batch 2 uh the hiring was paused. So so many of you received your deferred email. I even covered a separate video on this like round one is uh deferred. Okay let me yeah round one deferred results still pending like a month ago. So 17th May many of you uh attended like uh like attended and uh you were waiting for your results and this is what has happened. They told you that they will give the results within a week or something but then the round was completely deferred. Hiring was deferred because of using AI flagism cheating stuffs like that. So this is an integrity issue. So now they have started sending out their mails again for August 2 and August 2. Many of you have your rounds and today is July 22nd.

[00:02:08]So we get we have a roughly 9 to 10 days. So I will talk everything about it. So what is the uh exactly the eligibilities? B, B, M, M tech all streams about six CGP are eligible and three roles are hired DSC and SP, L1, L2 and L3. Now let's look at the exam pattern. So the exam pattern specifically is that you will have for now you this is like the offline um hiring right? So round one you'll have a round one which will be an online virtual coding assessment. Okay, let me just pull out the draw button. Fine. Now you have an online assessment. So that is going to be the round one which is going to be online assessment followed by that round two will be an in-person assessment coding both are coding rounds in person coding round and followed by that you will have a round three that is interview technical interview this is for off-ampus in case of on campus what you will have is round one that is a coding test that is inerson coding ing test.

[00:03:15]Round two will be interview. We all know this. Okay, I just wanted to brush this one up. Now you will be having 3 hours.

[00:03:23]Mostly four questions will be given correct easy, medium, hard and complex.

[00:03:30]And you will be expected to solve three from this. Okay? Or you might be given easy, medium, hard. That's all. And you'll be expected to solve three. Okay?

[00:03:40]Now let's look at the markup. Typical mark split up would be something like this. Uh this is just um you know based on previous pattern I can say if you solve one easy question you will get like 20 marks for medium 30 and for hard 50 marks. Now what is a cutff type you will be having each question cutff and overall cutff. So um so let us look at the cutff now. Okay. So when you are attending the examination the login window will be open for only 15 minutes.

[00:04:09]So log in early and don't wait. Now um topic or pattern that is usually covered here is for easy question it will be basic data structures like arrays string logic and that will be aptitude flavored coding. What is aptitude flavored?

[00:04:24]Aptitude flavored in the sense like have you encountered an aptitude question?

[00:04:27]How would that be? Right? You'll have many aptitude question right solving those aptitude related mathematical question using this uh data structures and algorithms. Medium level would be greedy and the hard level would be dynamic programming. But so so uh it can be two types basic data structures like strings, arrays something like that and then greedy and then dp it can be something like this or you can also get instead of just string and array you can also get link list. Okay and then you can get graph or you can get trees. It doesn't you know stop with string or array in this basic DS problem. You can also get linked graph and tree related problem. Okay.

[00:05:17]And you can also uh expect only gradient DP. Okay. Fully greedy DP and then uh graph something like that. So don't only prepare gradient DP also focus on this data structures is what I would say. So basic data structure such as string arrays and then for medium to hard like graph trees link lists greedy DP all of this you need to prepare. Now what are all the languages supported are that C, C++, Java, Python C, C, Java, Python and you can pick your language and start and the platform will be wingspan and this is the system requirements. Um now cut off by role. Okay. So, DAC uh so you have easy, medium, hard and complex, right? For DASC role, solving one EC fully and attempting medium is just enough. Okay, the coding bar is set to moderate. Don't have to worry about that. For DAC, one AC question and just attempt the medium question just like the basic test has passed. Now for S, this is for DS. Now for SPL1 rule what is the case is that for uh SPL1 role you need to solve the easy medium questions cleanly that is the basic hard question yeah this will give you an advantage but that is fine you can just attempt the hard question and for SPL2 level role easy medium and hard partially or optimally solved so for L1 role you can just solve easy medium fully that means you'll get L1 ro just just partial basic test for The hard question for L2 role optimally given hard level like optimally solved hard partially solved and for L3 level if you solve all three of this very good and uh even if you are able to attempt the complex question you will get L3 rule. This is the cutff that I want to discuss. Now let us look at the syllabus. We have core DSA correct.

[00:07:14]I told you about the core data structures that is arrays, strings and then what and all um topics to cover is array manipulation, string manipulation, traversal, two pointer technique, sliding window technique and then searching sorting algorithms uh binary search variance and all the searching sorting algorithms everything and then recursion backtracking is very important also. Now apart from these arrays and strings don't stop with arrays and strings you can also focus on limb list single w reversal cycle detection stacks and cues trees like uh binary search tree BS traversal high diameter problems these are all very important basics that will help you solve the easy questions and then you have graph BFS DFS cycle detection shortest path basics very very important graphs um greedy algorithms intervaluling activity selection dynamic programming 1D D 2DP NAPSAC family subsequence problems hashings hashing is also very important guys time and space complexity analysis so so you need to solve this optimally with good time and space complexity if you're aiming for L1 and L2 level roles you need to be good in time complexity optim optimization now supplementary this is for interview but that is like in the end you don't have to worry about it right now we'll talk about the interview in a separate video now topics by difficulty what to actually grind so I've given you the syllabus first of all like what actually infosys tests. This is the first part.

[00:08:41]Second part is topic by difficulty. How can you study the syllabus based on difficulty level and then we can talk about the 10day preparation strategy for beginners and then who are all in the intermediate level and who are all in the advanced level. Now easy questions.

[00:08:56]Let's talk about the EC like you have array basics.

[00:09:00]Maximum minimum subarray uh array rotation duplication string basics are very like very simple simple ones palendrome anagrams reversal basic search linear binary searching basic math pattern or problems stack or cube based problems. This is like you need to have 100% solve rate here. You need to be very very thorough extremely thorough in this. Don't um waste your time like don't lose your time in here because easy you need to solve it optimally and at optimal time. Now for medium you can solve um your aim should be to solve fully like cadence algorithm maximum subarism. So this was a previous year infosys question greedy activity selection jobuling minimum platform these are all previous year question guys. So I just picked out what to prepare based on the previous year patterns only sliding window longer substring without repeat subarray some problem. So even if you go to my channel also I have covered these questions some of these questions not fully but some of these questions I have covered go to the playlists and you can go to the infosys view playlist and now uh here you can see here let me go down climbing stairs dynamic programming brute force to optimal okay and then I have also covered algorithm brute better optimal approach and what else I have covered maximum minimum maximize bitwise or after klings better and optimal solution correct so if you're uh like preparing you can just consider going through these questions also I've covered from brute better to optimal and I've also covered previous questions as well you can just go through my playlist okay um and then um you have linked list manipulations right add two numbers reverse in groups detect or remove cycle binary trees um level order height LCA questions Graph number of islands detect cycle two pointer problems. Three some container with most what are directed undirected graphs. This is the medium kind of uh topics. And for difficult questions hard dynamic programming very very very important 0 by one knapsack LCS longest palendroic substring and then edit distance coin change shortest path topological sort matrix chain multiplication DP on trees. Okay. DP on um another data structure sliding window plus DP hybrids. What do they do is if I correctly uh understand this they will combine two things. So you would have known sliding window and two pointers and algorithms like that and you would know DP and they would combine these two and give you this question at the hard level. Okay. So this is how I want you to prepare. So sliding and DP alone will be enough for you to solve easy questions and medium questions. But for hard questions, it is hybrid. Okay.

[00:11:59]And then uh 2D partition, 3D partition for DP segment uh trees. Segment is also very important and advanced data structures.

[00:12:08]So it is pretty rare but still it is good to prepare if you are advanced in DSA. So let's look at the 10day prep strategy for beginners, intermediates and advanced. The beginners is all those people who have not done much DSA in their uh like in their coding journey.

[00:12:24]You know a language, you know basic loops. So you know one language, you're comfortable with that language and you know basic loops and you know how to solve simple questions. Okay. So what I want you to do is pick one language and then revise the syntax of that particular language because you're going to use that language to solve a problem means you need to be revised with the syntax. So if you're picking a language revise the collections STLs basics data structure basics of that and to get um used to that language solve five easy array problems. Five easy array problems you can try and solve and then this is for day one. This is what I wanted to do for day one. On day two you can focus on strings fully strings five to six problems pattern romanag reversal substring problem so that you get really thorough.

[00:13:18]So like whatever question they might give me I'll be able to solve strings.

[00:13:22]You don't have to be 100% sure because since it's just starting out just try to be at least 60% sure that is enough for this level. And then the day three would be searching and sorting algorithms. I wanted to focus on linear search binary search bubble sort quick sort insertion sort merge sort all the concepts not implementation heavy but just the concepts. Now recussion basics on day four very very useful for simple backtracking sub subsets and factorial.

[00:13:47]This is the basic for DP and everything.

[00:13:49]Don't forget recussion. And I also told about linked list. Just focus on the easy to medium problems for linked list stacks and cues. Fine.

[00:13:59]Traversal, reversal, insert or delete, valid parenthesis, next greater element and for just focus on the understanding the data structure and solving two to three problems for each day for the day five and day six. Day seven what I would suggest is intro to greedy. Solve the greedy problems. uh greedy uh theory plus problems activity selection simple interval problems to DP also on day eight uh climbing stairs house robber basic napsack concept just understand the idea don't chase hard questions to solve them because you're just starting out don't forget that day nine try to give a full mock test and one easy one medium and one hard and a three hard timer and review your mistakes so if you follow this 10day preparation strategy you can solve one easy problem and just try to attempt one median this is what I'm guessing okay you'll be able to do that and um also getting selected for DSC DS is kind of possible if you follow this now because we've covered link list also we have covered array strings link list tax and cues and we've covered these so if you will get one question from this and if you get one question from greedy DP medium level you can solve it and revise weak areas day nine should be mock lighter vision sleep Now on day eight like 9 and 10 last students don't study any new topics.

[00:15:20]This is for the basic levels and for intermediate if you're targeting L1 and L2 role and you are already comfortable with um you know solving you've solved 100 plus questions already in your lifetime like a coding journey and you can solve EC plus medium comfortably and your goal should be what is that AC plus medium comfortably and attempt a hard question for DSC role EC should be 100% you should be able to complete it fully and medium just attempt it without panic should be enough to attempt that is for the beginner track DSC or even SPL1 role for SPL1 and L2 role what I want to do is AC plus medium you should solve it fully hard just attempt with brute force so what I want you to focus on is arrays and string advanced on day one and day two all the cadence prefix sums cadans prefix sums two pointers all of these questions pattern matching longest palendrome substring root plus optimized and then linked Add to numbers, reverse and K groups, cycle detection, trees, graphs. These are also very important. All traversals, high diameter, LCA, BFS, number of island, cycle detection, both directed and undirected graphs. And also greedy deep dive. You might already know DP greedy everything, right? So I wanted to do the deep dive. Deep dive is like the medium to hard level of problems. Okay, greedy deep dive and DP deep dive and uh like uh jobuling, minimum, fractional, coin change, all of these problems. Some of these problems I've covered in my videos. Go watch it. And then on day eight, give mock test day nine. I want you to review the mistake you did on day eight and uh like redo some hard DP problems from scratch without any hint.

[00:17:05]Just try it out. This is for hard, right? And day 10 just light revision.

[00:17:10]This is for the medium advanced. If you're trying to attempt all three optimally including hard clean edge case everything then for a day this is the one I want you to follow. So first um without any preparation day one just put a timed contest three questions 3 hour and understand what mistakes you did what time you took for each question how your thinking was and then go on grinding advanced DP advanced graph um greedy and DP hybrids very very important guys advanced DP advanced graph greedy plus DP hybrid this these are all the example questions you you don't have to stop with this one okay this is the same one for this also So you don't have to stop with these three questions. You can go on and on and on and cover it and try to optimize the old solutions.

[00:18:01]Take five problems you solve with brute force early and resolve at optimal complexity. So for this this is all about doing advanced problems and pro giving optimized solutions segmentaries on day six advanced structures and then another mock test on day seven 3 hours aim to solve fully um and uh just just don't attempt not just attempting you need to solve fully speed drilling on day eight meaning to build speed six to eight medium problems back to back under 15 to 20 minute each to build speed okay and then you can to mix it revision on day 9 reattempt every problem you got wrong across the 10 days and day 10 just revise no heavy coding nothing get full sleep daily you need to be getting full sleep but still this will be useful for the advanced people and what I want you to focus on is uh you you need to give as many mock test as possible and then uh review each mock test where you did the mistake and how much time you took to solve and how um speed how fast you can solve and speed drilling is very very important. You can just try it out.

[00:19:09]This is like my suggestion.

[00:19:12]So um this is all about this video you guys. So I've covered 10day prep strategy like topics by difficulty. So this is not if this is not okay for you, you can just go on with easy for two day 3 days, medium 3 days, hard 3 days.

[00:19:27]Simple, you would have covered everything. And uh yeah, so I just wanted to talk about this. I'll cover like in the upcoming videos let's talk more about what questions to cover on each thing so that it'll be useful for you. So all the best way preparation you've got 9 to 10 days more and most importantly do not use AI to uh do the quotes you will get rejected okay try to prepare in the 10 days and try to solve if you use AI you will mostly get rejected this is what happened and that is why the hiring was also deferred do not do that all the best for preparation I'll see you in another video till then take care and bye-bye thank you so much for watching