Infosys Biggest Hiring 🚀 | 25 Days Complete Plan for SP & DSE

Added: 2026-05-07

[00:00:01]Hello everyone, welcome or welcome back.

[00:00:03]This is Manisha. So as we all know Infosys has announced their SPDAC hiring for 2026 batch. So in this video we are going to discuss the complete preparation guide on how to do it in 25 days and to bring to your advice we have already launched a course for Infosys SP and DAC. So in this course we are going to cover in 25 days all your DSA. Now as we all know the level of questions for Infosys is a bit high right it's not the same as other companies. So that is why it matters that we take everything in a sequential uh approach and I have covered the whole schedule for your um understanding in this video. Right. So the day wise plan is also given over here. If you take a look that from day one starting from array basics to day 25 we'll do revision with hard problems before that DP graphs trees PhD everything would be covered okay so as you can see the price of the course is also very minimal as you guys have asked that 500 rupees uh to keep the course price that is exactly what we have kept as you guys have asked in the comment section okay so and also everything every single code will be covered in Java C++ ++ and Python all of the three languages. So no matter in what language you code you can come attend the class.

[00:01:29]These will be live classes uh every day you can come to the class listen to the class. If you have any doubts you can ask me directly in the class itself.

[00:01:38]That is what the beauty of a live class is. If you are unable to attend the live class, you will also get the recording of the class, the PPT of the class. You can watch the recording and again next day when you come to the live class if you have any doubt regarding the previous class you can ask me in the live class itself. Okay. So in another way it's a doubt clearing class as well.

[00:01:59]It's a teaching class as well. Anything you don't understand you can ask me directly there but please explain to me this again. Okay. So now let's see the device plan and what we need to cover over here. Okay. So now as we all know Infosys asks some highlevel questions before that what is the salary package well Infosys offers a very attractive salary package like so it ranges from 6.25 to five plus 7 75,000 bonus. So almost 7 lakhs to 21 lakhs peranom. It depends on the amount of questions you solve, how you perform in the interview, how you give in your offline assessment.

[00:02:37]Those are the things it depends on.

[00:02:38]Okay. There are two roles mainly. One is SP and another one is DAC digital specialist engineer. But like SP also has three different roles in it. One is an L1 training which has 10 lakhs peranom plus one lakh joining bonus.

[00:02:53]Then there is 16 LPA. Then there is 21 LPA and then there is digital specialist engineer. Okay. So now let's see what are the types of questions mainly asked in Infosys. Now some people might say that Infosys only asks DP, graphs and trees. But if you're solving a DP, how can you not use array? you have to use array in so that's what we will see in the next um part of the video as well that why I have put array strings hashmaps backtracking recursion these things as well because without these things you cannot solve a DP question you cannot solve a heap graphs question trees question because everything would be mixed they are not going to give you direct questions from DPNL okay so these are the common topics asked in infosys these are array and string sliding window and two pointers often combined with DP hashing. Binary search be used everywhere in every answer. Recursion and backtracking without which you cannot solve mostly any of the higher level problems. Link list sack Q trees BST important graphs also they ask now heap is important and dynamic programming it is something very important. Okay, dynamic programming is very important over here. Now [clears throat] important now let's see the pattern which we are going to follow now something important to crack in infosys spdac is you cannot memorize the questions okay if you memorize the question then the question which you have memorized only that you'll be able to answer you cannot study only the shortcuts because Some questions you won't be able to answer by using shortcut. For example, if I tell you that okay you see that take the maximum profit then that will be greedy but in some cases greedy is not going to solve your question. Okay in some cases using greedy you cannot solve the question. So then what to do? That is why memorizing questions and memorizing the shortcuts won't help you. So what you have to do?

[00:05:08]You have to understand the patterns, practice consistently and build strong problem solving skills. And these things when we are going to do in that 25day crash course. Okay. In that 25 day crash course, we are going to do these things.

[00:05:24]Okay. Now, why you must learn all the data structures first? array, string, link, stack, Q everything you have to learn before you jump into trees, graphs and DP. Many students make that critical mistake that they jump directly to trees, graphs and DP because that is what emphasis asks. But that is not emphasis asks only. They combine it with other data structures and you cannot use trees, graphs and DP without understanding the previous data structures which is why strong basics we need to have here. Okay, strong basics we need to take care of. So we'll start from basic to advanc over here in this course. Right?

[00:06:10]Right approach why now why we need the other things where are the other data structure is used. Sliding window is used in strings and dp in strings anything you do you need to use a sliding window. lining into a two-pointter approach, right? Hashing it is used everywhere in all of the problems. In any string problem, in anything you use, you need hashing.

[00:06:33]Binary search is used for optimization techniques. Stack and cues, it is used in trees and graphs. Without stack and without stack especially, you cannot retrieve most of the answers.

[00:06:45]Recursion is used for is it is the base for DP. In DP without recursion, nothing would happen. back backtracking you know we used recursion there so that is why this course is very important because it follows the foundation code and then we go to the advanced and the mixed problems mixed including all the data structures okay now comes the most important part of the video what we'll do in this 25 days what will be our schedule so as I said we'll come from array two trees graphs dps everything will become In ar the day one there will be no introduction class directly we'll jump to studying only because we don't want to waste our time. Every class should be fruitful because we have less time at hand. Okay. So that's why we need to make the purchase fast.

[00:07:39]Day one we are going to cover the array basics array traversal and patterns.

[00:07:44]Then cadence algo we are going to cover buy and sell profit logic. Okay. And we are going to do practice problems based on that also. We are going to take lead code problems as well. So keep that in mind. Medium to hard problems we are going to take on lead code one by one.

[00:08:02]And all of the three programming languages we are going to cover. Okay.

[00:08:13]all Java, Python, C++, all three languages will be covered. Okay. So this is the main point and it doesn't mean that I will just show you the code. I will explain you the code in all of the three languages. Okay.

[00:08:44]Now let's go to day two. Day two we are going to do the prefix prefix array concept. Range sum queries and sub array sum optimization. So all the subarrays prefixes these things we are going to see how to solve sub arrays.

[00:09:00]Now comes the techniques two pointers sliding window. Day three we are going to do two pointer problems. Okay. How to do palindrum checking using two pointers. How to use opposite direction pointers? One fast pointer, slow pointer, area maximization logic. How can we implement using the two-pointer approaches? And every day we are going to do problem solving only. So this is going to be a problem solving class.

[00:09:25]This is not going to be a definition of array, definition of stack class. Okay, these are going to be problem solving classes. Of course, I will give you a basic first if you in case you don't know. But the whole class is not going to be of that definition thing kind of thing. Okay, we are going to do problem solving because once you start solving the problems, that's how you will learn.

[00:09:45]You need hands-on problem solving without which you won't be able to learn. Okay, day four we are going to do sliding window and mind me when I say this right. Two pointers and sliding window these concepts are important in array later used in higher data structure as well. later used in higher data structure as well.

[00:10:10]Okay, without sliding windows these things two-pointter approach you cannot do other data structure problems as well. That's why solving these problems are also important. Fixed size window, variable size window, substring without repetition how to do this using sliding window we are going to. So once you know two pointer sliding window becomes easier that's why I've kept in two days.

[00:10:34]Okay.

[00:10:36]Now let's see day five hashing frequency counting hashmap optimization top K frequency logic these problems these kind of uh how to approach these kind of problems these things we are going to see in day five day six starts our higher logic kind of advanced topics start from day six we are starting the advanced topics greedy Greedy by choice, interval shoulduling, sorting plus greedy, how to do these kind of problems, how to approach it, how to identify when to use the greedy approach, when to avoid it, when you can use something else instead of tab. Those things we will start. Okay. Day six is going to be about greedy. Day seven, binary search. It will be an easy session but we are going to tackle some hard problems there to see how we can apply binary search but binary search is not going to be the main event in the these problems because binary search only helps you optimize a problem. They are not going to ask you any problem which directly implements binary search as its main criteria. Binary search is only used for optimization. Binary search is not the kind of the main event of the problem. Okay. because problems are not going to come that easy.

[00:12:01]Then binary search advanced problems here are what what we are going to learn why binary search is important in higher level problems important session. Okay, day nine is going to be about recursion.

[00:12:20]Recursion is very important. All of the higher problems mostly need recursion.

[00:12:25]Basics of recursion. Recursion tree, how to use power and Fibonacci logic simple problem and then coding problems. We're going to take every day there will be coding problem. Right? After recursion, we need to learn backtracking because those are related subset generation, permutation uh generation and decision tree approach. How to do these kind of problems? How to tackle these kind of um logics in the code? That is what we are going to see.

[00:12:53]Then we are coming to strings. Strings is very important. Why? Because whenever you see a hard problem, if there is a problem in numbers, then it becomes easy. The moment strings come into picture, it becomes a little difficult.

[00:13:09]Why? Because taking input becomes difficult.

[00:13:13]Dividing the string maybe becomes difficult. Doing any kind of operation with a string or character becomes difficult because any operation you're doing you usually do it on integers.

[00:13:25]But the moment string comes we have to divide it in some other logic right. So that's why we are taking strings and it is a relatively easy topic after we are done with recursion backtracking those things we are going to come back to string but here also we will be using recursion backtracking all of those logics. So anagram we'll be doing grouping strings we'll be doing and hashing a strings we'll be doing okay link list basics to advanced everything we will cover how to traverse a link list how to reverse a link list how to find the middle node in a link list now here comes the slow fast pointer slow fast important concept okay then in link list advanc How to detect a cycle, merging of lists and pointer manipulation. All of these three are important. So this class is also important.

[00:14:25][clears throat] Okay. Then comes the stack uh basics like parenthesis, valid parenthesis, parenthesis matching, monotonic stack, basics of stack first we are going to learn. Then we come to Q and DQ. Q using stacks. how to do DQ operations and sliding window maximization. Now in these two just in case in exam you get anything related to stack and Q problem is ultimately going to go inside maybe a DP approach or a greedy approach that kind of problem but you might be required to use a stack or a Q that way the problem might be given. So the basics of stack and Q is needed for higher DS like array only. Okay, got it.

[00:15:30]Day 16 we are going to cover trees. Now comes the important part for infosys. Very important.

[00:15:43]Very important.

[00:15:45]Here we are going to cover the tree basics, depth calculation, tree comparison. After that we are going to do the traverse. As you know we are giving more time to trees. Now see 3 days we are giving to three in order traversal level order traversal that is BFS recursive and iterative both we are going to see important class because many kinds of problem we are going to tackle after that we are going to dive into BST how to validate whether it's a BST or not lowest common ancestor in what okay ordered property these things we are going to learn in day 18.

[00:16:29]Day 19 we are going to go for priority cube. K largest element running medium problem solving. This is going to be about heap.

[00:16:40]So heap is always used for always usually combined with DP greedy. That is where you'll see heap the most because why after greedy we learn he because there are concepts like max mean he which helps us in greedy problem solving. Okay. Then we are going to go to graphs. Graphs basics to advanced. We are going to cover grid graph based problems, BFS, DFS, connected components, traversal techniques, how to traverse a graph, how to read a graph, how like basically be familiar with the syntax. Then topological sort, DFS, multisource, dependency resolution, these kind of things we are going to see.

[00:17:38]This is advanced graph problems.

[00:17:48]hard problems. Okay, these are going to be hard problems.

[00:17:55]Then we come to DP. Now, by the time we come to DP, we would have already covered DP. Okay, by the time we reach here, we would have mastered DP already and DP is a favorite for infosys. Okay, DP is Infosys's favorite topic as we service.

[00:18:34]They ask a lot of questions from DP.

[00:18:36]Mostly maximum questions are based on DP. So just like just like array is a favorite part of DSA. Every data structure is based on array. Similarly for emphasis DP is their favorite part.

[00:18:49]Everything they based on DP only. Okay.

[00:18:52]So how to use recursive recursion in DP memorization concept tabulation these things we are going to see in the first day. Then in the advanced DP we are going to see the LIS unbounded NAPSAC normal NAPSAC also we are going to see state transition optimization and also with constraints we are going to see okay after day 23 we are going to do some advanced miscellaneous this kind this section is going to be miscellaneous problem solving okay miscellaneous problems and revision and doubt solve.

[00:19:34]Okay.

[00:19:38]2.0 prefix sum greedy array optimization multiattern problems. These are very important like multiple times emphasis of these things. Okay. Day 25 we are going to do some division and hard problems. Doubt solving lru graph dsf bfs advanced and kind of a revision or how to tackle things. How to identify keywords in each problem. Right? How to identify keywords?

[00:20:06]How to identify keywords? Those things we are going to see how to identify keywords to basically solve a particular problem using one technique. How to identify if you want to use DP or not. How to identify if you want to use greedy or not. Those things we are going to see here. Okay.

[00:20:29]Now what this 25day plan will do is it will help you master all your important DSA patterns. Solve medium to hard problems confidently. Be fully prepared for Infosys SPDSC obviously and think like an interviewer.

[00:20:47]Now something important right I want to tell you why this course.

[00:20:57]See, Infosys asks you a very high level problems, right?

[00:21:04]Once you know about Infosys, once you can solve Infosys problems, if you are able to crack it right, then companies like TCS, Cognizant, Essentia, Delight, Cap Jim, these things become very easy. Okay, these things also become very easy because once you have done the concepts of DSA well and you keep revising those things again and again these things become easy. The only thing you have to do more for TCS cognent as these things is aptitude that you already have done previously as well.

[00:21:59]Okay.

[00:22:01]So yes, this is a one-stop course for all your DSA problem solving practicing.

[00:22:05]This is only going to be about problem solving. So whoever is interested in coding, we invite you. Please come purchase this course for your own benefit. Make a small investment. We are starting the classes very soon. So it's advisable that you purchase this course today only because so that you can connect with me live, right? And so that you can ask your doubts like okay. So yes that was all for today's video only 523 rupees go and purchase the course this is the schedule again I'll just brief it day one will be array basis day two prefix sum day three pointer day four sliding window day five hashing day six greedy day seven binary search basic day eight binary search advanced day nine recursion day 10 backtracking day 11 strings day 12 link list basic day 13 link list advanced Day 14 stack. Day 15 Q and DQ. Day 16 trees. Day 17 tree traversals or all the other concepts of trees. Day 18 will be DST. Day 19 heaps.

[00:23:10]Day 20 graphs basic. Then 21 graphs advanced. Then we come to DP. But by that time DP would have already been covered.

[00:23:18]Day 22 would be DP basics and day 23 would be DP advanced. Okay. Now day uh 24 all the miscellaneous problems and day 25 division doubts solving whatever doubts you have how to identify problems like kind of like a oneshot video right okay so yeah that was all for today's video thank you so much I wish you all the