<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[Stories by Aman Chopra on Medium]]></title>
        <description><![CDATA[Stories by Aman Chopra on Medium]]></description>
        <link>https://medium.com/@amanchopra64?source=rss-6ee282dd2783------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/0*4ZITDyrKmQPyI-GG.jpg</url>
            <title>Stories by Aman Chopra on Medium</title>
            <link>https://medium.com/@amanchopra64?source=rss-6ee282dd2783------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Thu, 19 Nov 2026 18:52:46 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@amanchopra64/feed" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[A guide for Behavioral interview round]]></title>
            <link>https://medium.com/@amanchopra64/my-interactions-with-many-students-preparing-and-giving-interviews-have-made-me-realise-that-8be7e859d608?source=rss-6ee282dd2783------2</link>
            <guid isPermaLink="false">https://medium.com/p/8be7e859d608</guid>
            <category><![CDATA[interview-tips]]></category>
            <category><![CDATA[behaviour]]></category>
            <category><![CDATA[interview]]></category>
            <category><![CDATA[leadership]]></category>
            <dc:creator><![CDATA[Aman Chopra]]></dc:creator>
            <pubDate>Sun, 30 Jan 2022 21:37:06 GMT</pubDate>
            <atom:updated>2022-01-30T21:39:14.594Z</atom:updated>
            <content:encoded><![CDATA[<p>My interactions with many students preparing and giving interviews have made me realise that students do not prepare enough for behavioural questions in general. They treat these categories of questions as secondary but fail to realise that a good leadership answer can change the interviewers perspective towards them as a prospective new hire. A good response can be a decisive factor if there is confusion in the mind of interviewers regarding your technical prowess. It is extremely important to realise that apart from assessing the technical abilities, the interviewers also assess your ability to understand the culture and the values of the company. They want to see how you tackle different situations and how well you can gel into the company as a prospective employee. Hence, this category demands a thorough preparation. While this seems like a wastage of time at first, the benefits are immense. A good preparation of only about a week can prepare you for the long term. Once you get a knack for answering these questions, not enough practise is required to maintain this skill, and you can ace the leadership round of pretty much every company. Companies like Amazon stress too much on their leadership principles. In fact, for interns, the final round is more of a behavioural than a technical round. Hence, good preparation is required.</p><p>A general mindset of students is to know just the intricacies of the projects they have worked on in college and the company and knit a story during the interview. While that is a plausible approach, the resultant answers are usually not well structured and fail to impress the interviewers. To them, instead of the technologies and the intricacies of the project, the approach, the mindset, and the learnings are far more important, which we as interviewees sometimes fail to address. I agree that there are so many different types of leadership questions that it is virtually impossible to prepare for all such questions. But the good news is, <a href="https://leetcode.com/discuss/study-guide/1691931/beginners-guide-on-interview-preparation">just like DSA</a>, we can segregate these questions into categories and then smartly target those categories. I will be talking about some patterns that I have seen, some tips I have found useful, and then address how to structure your answers.</p><p><strong>The categories:</strong></p><ul><li><strong>Data</strong>: Many times, the interviewer wants to know how you handle the data. Data is unarguably one of the major factors to devise solutions, and the interviewer wants to know how your decision making is affected by different amounts of data. Your approach when you have say, a large amount of data, just enough data, or not enough data available tells a lot about your problem-solving skills. While answering such questions, you need to make sure that you leverage the data to come up with a robust and scalable solution that does not exploit much of the company’s resources. You should talk about general trends, observations, insights, and outliers.<br><strong>Related questions</strong>:</li><li>An approach you took when you had enough data available.</li><li>An approach you took when you had less data available.</li><li>A choice you made when there were multiple solutions available.</li><li>A time when you leveraged data to develop a solution.</li><li><strong>Decision</strong>: This category includes questions where you have to take key decisions based on different situations. Those decisions can be instinctive, quick, risky, etc. The interviewer wants to know how you handle pressure and take important decisions when a lot is at stake. Make sure your decisions are sound, scalable, and have solid data backing.<br><strong>Related questions</strong>:</li><li>A time when you took a quick/instinctive decision and succeeded.</li><li>A time when you took a risky decision and failed.</li><li><strong>Innovation and hard work</strong>: This is a general category of positive questions where the interviewer wants to know more about how you think and how curious you are to learn more about new technologies and culture. Curiosity drives innovation which along with hard work improves your chances of succeeding at a company. It would be great if you have some projects where you have solved a problem using a not so usual approach and solved a pain point of the customers. The qualities you want to show while answering such questions are curiosity, hard work, inquisitiveness, and modesty.<br><strong>Related questions</strong>:</li><li>A time when you devised a simple solution to a complex problem.</li><li>A time when you raised the bar.</li><li>A time when you solved a pain point.</li><li>A time when you influenced a change by asking questions.</li><li>A time when you invented something.</li><li>A time when you did more than what was required.</li><li>A time when you did something for customer satisfaction.</li><li><strong>Deadline</strong>: It is a very important category of questions. Working in a company, deadlines keep the engineers on their toes. Many times to fulfil the deadlines, the quality of the code might get compromised. Sometimes a last-minute bug or a late dependency resolution results in a deadline shift. Instead of playing the blame game, you need to take ownership of the mistakes and ensure that the customer impact is minimal. Some viable reasons for missing the deadlines are late dependency resolution, short-term sacrifices for long-term gain like developing a scalable and a more robust solution, an insufficient case study resulting in incorrect time estimates. An important aspect of this category is learnings. What steps did you take to mitigate the damage (for instance, keeping the manager in the loop instead of informing him at the last moment that the deadline might be missed), and what measures did you take so that such a thing is never repeated. How you learnt from your mistakes and grew as an engineer is something you should address.<br><strong>Related questions:</strong></li><li>A time when you missed a deadline</li><li>A time when you had to shift a deadline.</li><li><strong>Mistakes</strong>: It is a category of negative questions that should be answered with care. Just like the deadline category, you should take ownership of the mistakes committed and focus more on how you mitigated the damage. Ensure that the customer impact is minimal. You can also talk about why the approach you took seemed right then and what went wrong. Understanding where you went wrong and the steps you took to avoid such mistakes from happening in the future is crucial.<br><strong>Related questions</strong>:</li><li>A time when you made a mistake.</li><li>A time you used the wrong approach when there was a better one.</li><li>Something you did you thought was right, but it failed.</li><li><strong>Motivation</strong>: Just like innovation, it is a positive category of questions that in a way is coupled with innovation. While innovation is mostly about your tangible impact on the project, motivation is more about your physiological impact on the team. You can motivate others around you by being a leader or even an intern. Having a sense of empathy, collaboration, taking initiative, helping fellow employees, and leading by example are some of the qualities you should try to portray while answering such questions. In this category, apart from projects, you can also talk about organising team-bonding activities to improve the cohesion between team members.<br><strong>Related questions</strong>:</li><li>A time when you took an initiative.</li><li>A time when you lead a project.</li><li>A time when you boosted the morale of the team.</li><li>A situation where you used external client/organizations plugin/adapter, which was faulty.</li><li><strong>Conflict</strong>: Conflicts are a common phenomenon in any group project. There might be conflicts about work division, who committed a mistake, conflicts about technology choice, and designs. It is important to resolve the conflicts as soon as possible in the most practical way taking into account the well being of the project and eventually the customer. We need to understand that it’s not a personal battle between engineers about who is right but what’s best for the company. Many times, there is no correct answer, but an answer that suits a particular situation in the best possible way. A balance between the company’s resources and customer satisfaction needs to be established.<br><strong>Related questions</strong>:</li><li>A time when you handled a crisis.</li><li>A time when you resolved a group conflict.</li></ul><p><strong>The approach</strong>:</p><p>First of all, it seems intimidating to come up with situations/ stories/ projects for so many different questions I have mentioned above. What you need to understand is that you only need to be thorough with 3–4 projects you have worked upon in your company/ college. Most of the categories can be addressed by talking about a single example. For instance, describing the same project, you can talk about innovation, raising the bar, or say missing the deadline. It is always better to talk about different projects answering different questions as most companies will not ask more than three questions. Other questions would be the follow-ups. You just need to decide which project fits the best in the above categories. For all the questions, you need to be well-versed with the situations/ projects you would be talking about, and everything else would be easy following the category guidelines I have mentioned above and the structure and tips I would be writing below. Try to incorporate the company’s ideologies, principles, and values in your answers. It is a bonus to know how the company’s goals are aligned with yours.</p><p>Coming to the structure, all of us might have heard about the STAR method of answering leadership questions promoted by Amazon. I believe that, with minor tweaks, it is a very structured way of answering leadership questions irrespective of the company.<br>The STAR methodology:</p><ul><li><strong>Situation</strong>: Like first impressions, the beginnings are important. A good beginning acts as a hook and decide how the rest of your answer unfolds. A good beginning immediately grabs the interviewer’s attention which increases his involvement, which in turn boosts your confidence while answering. I should mention that students are not very good at describing their projects. You need to understand that there are a plethora of software technologies and domains. Hence, it is hard to be well-versed with everything even for the interviewers. Since you have worked extensively in a particular domain, it does not mean the interviewer has the required expertise in it as well. Students rush into the technicalities of the project instead of discussing the managerial aspects of it. In this part, we should address why the project started, why the project was important, what was your role in the project, and what was the impact of the project. After that, you start setting the pretext. Depending on the question, start talking about say the scope of innovation, a situation where a morale boost of the team was required, a situation where you needed to abide by the deadline or a key decision was to be made.</li><li><strong>Task</strong>: The tasks are just like the JIRA tasks. In this part, you need to talk about what was needed to be done and not how. Focus on your tasks and not that of the entire team. Focus on the goals needed to be accomplished in order to address what was asked in the question.</li><li><strong>Action</strong>: In this section, you talk about the “how”. How the task was completed and what actions you took. In this section, you talk about the technical details of your tasks. You also talk about how your technical and personal actions impacted the team and the project. Again focus on your actions and not that of the team’s.</li><li><strong>Result</strong>: In this section, you talk about the quantitative and qualitative results of your actions. How your actions given a particular situation impacted the project. Talk about the accomplishments, the metrics and the consequences of your actions.</li><li><strong>Conclusion</strong>: To me, conclusions are the second most important part after the beginning. This is where you want to leave a lasting positive impact on the interviewer. You essentially wrap up your answer and try to show your positive outlook towards the entire situation as a whole. Both positive and negative situations pose a scope for learning and you should discuss it with the interviewer. While positive situations reinforce your faith in the right process, facing negative situations with the right mindset helps you grow as an engineer and as a person.</li></ul><p><strong>Important tips</strong>:</p><ul><li>Properly structure your answers. Like a good essay, your answers should have a beginning, a middle, and an end. The STAR format can be thought of as the SBI approach. You first talk about the <strong>Situation</strong>, followed by your <strong>Behaviour</strong> towards it, concluded by the <strong>Impact</strong>.</li><li>Focus on the details. Be as descriptive as possible. Include who was involved, the specifics of the project, and key metrics.</li><li>Focus on “I”. You want to talk more about your ideas, approach, solutions, skills than that of the team as a whole.</li><li>Don’t shy away from failures. Take ownership of the mistakes committed and focus on the learnings.</li><li>If the interviewer is asking follow-ups, listen carefully as to what specifics they want to know.</li><li>Be clear about what you expect from that particular company, and how it will help you achieve your goals. Identify the values and results that resonate with you.</li></ul><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=8be7e859d608" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[A guide on coding interview preparation]]></title>
            <link>https://medium.com/@amanchopra64/a-guide-on-coding-interview-preparation-456e54c09523?source=rss-6ee282dd2783------2</link>
            <guid isPermaLink="false">https://medium.com/p/456e54c09523</guid>
            <category><![CDATA[study-plan]]></category>
            <category><![CDATA[interview-preparation]]></category>
            <category><![CDATA[coding]]></category>
            <dc:creator><![CDATA[Aman Chopra]]></dc:creator>
            <pubDate>Sun, 30 Jan 2022 21:31:31 GMT</pubDate>
            <atom:updated>2022-01-30T21:31:31.413Z</atom:updated>
            <content:encoded><![CDATA[<p>Hello! I am a C++ Programmer and I am posting my approach towards the internship interview preparation which might help students looking for a plan to start their Data Structures and Algorithms preparation.</p><p><strong>The approach:</strong></p><p>I think the most important step is to understand the intricacies of the language being chosen. For instance, as a C++ programmer, one should be well-versed with pointers, the standard template library, the understanding of the internal implementation and operational complexities of the common containers like set, map, vector, etc.</p><p>There are a lot of questions in leetcode and it seems intimidating at first as to how to choose the problems and what approach should be taken. Honestly, sometimes it takes a lot of time to solve a problem, and without a basic understanding and practice of the concepts used, it becomes increasingly difficult to solve questions which sometimes result in a loss of confidence. I recommend understanding the general patterns of the questions along with practicing the prominent questions belonging to those patterns before trying to solve similar questions on your own if you are a beginner. I will be talking about a few patterns that I have observed and studied along with the prominent questions following those patterns which might help solidify the concepts. These prominent questions are frequently asked in Companies like Meta, Amazon, Linkedin, Adobe, Citrix, Okta, MathWorks, etc. Understanding the approach to those questions with the help of the discussion forums and then solving similar questions on your own might be a better way.</p><p><strong>The patterns and techniques:</strong></p><p><a href="https://hackernoon.com/14-patterns-to-ace-any-coding-interview-question-c5bb3357f6ed">14 Patterns to Ace Any Coding Interview Question</a> talks about the important coding patterns but I am adding some related questions, identification, and techniques to better approach these problems.</p><p><strong>Sliding window</strong>: One of the most important patterns that might be useful in solving the string and array problems. A combination of sliding window and an unordered set is usually very powerful. The left and right pointers constitute the boundary of the window and we slide them after processing the current window. The new window usually contains most of the elements from the previous window, so instead of recalculating the new result, we process the result of the new window using the previous result, the items removed, and the items added. I recommend solving <a href="https://leetcode.com/problems/longest-substring-without-repeating-characters/">Longest Substring Without Repeating Characters</a> to start with. Once you get the hang of these questions, I recommend solving <a href="https://leetcode.com/problems/minimum-window-substring/">Minimum Window Substring</a>. If you can understand the solution to this problem, I think you should be able to solve most of the sliding window questions.</p><p><strong>Two pointers</strong>: In this approach, we try to iterate the array or string from two different positions to find the solution. Everyone might have used this approach to solve the palindrome problem in which case we increment and decrement the left and right pointers respectively after processing. There are a few questions in which we increment or decrement only one pointer based on the condition to arrive at the solution. The prominent questions from this category are <a href="https://leetcode.com/problems/3sum/">3Sum</a>, and <a href="https://leetcode.com/problems/container-with-most-water/">Container With Most Water</a>. The two-pointer approach is also useful while solving the problem <a href="https://leetcode.com/problems/palindromic-substrings/">Palindromic Substrings</a> in which case we expand from the middle.</p><p><strong>Prefix sum</strong>: This is a powerful technique for questions regarding integer subarrays. It is useful for range queries and its combination with unordered_map is usually very helpful. You should try solving the question <a href="https://leetcode.com/problems/subarray-sum-equals-k/">Subarray Sum Equals K</a> to get the hang of questions involving prefix sum. Another challenging question which I love from this pattern is <a href="https://leetcode.com/problems/count-subarrays-with-more-ones-than-zeros/">Count subarrays with more ones than zeros</a>.</p><p><strong>Merge intervals</strong>: It is a popular category of questions where we usually sort all the intervals first and then merge them based on the constraints of the questions. Prominent questions from this category are <a href="https://leetcode.com/problems/merge-intervals/">Merge Intervals</a>, and <a href="https://leetcode.com/problems/interval-list-intersections/">Interval List Intersections</a>.</p><p><strong>Modified Binary Search</strong>: Whenever we see a sorted array or a question where we need not visit every element and can discard ranges, binary search should come into mind. While it seems like an easy concept, there are some amazing questions, which although not obvious, can be solved using Binary Search. Prominent questions from this category are <a href="https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/">Find First and Last Position of Element in Sorted Array</a>, <a href="https://leetcode.com/problems/find-peak-element/">Find Peak Element</a>, and <a href="https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/">Capacity To Ship Packages Within D Days</a>.</p><p><strong>Monotonic</strong>: It is not a very well known concept but seemingly O(n²) range queries questions can be solved in O(n) using monotonic stack. The concept is simple, the monotonic stack contains elements either in increasing or decreasing order. Any time this property is not followed, we do some operations depending on the question, in order to maintain this property. Prominent questions from this category are <a href="https://leetcode.com/problems/next-greater-element-ii/">Next Greater Element II</a>, and <a href="https://leetcode.com/problems/daily-temperatures/">Daily Temperatures</a>.</p><p><strong>Recursion</strong>: One of the most important and useful concepts which in different ways is used to solve many coding questions. It is used in most of the tree questions, questions like permutations, subset generation, questions where all the solutions need to be generated/ printed. Aditya Verma has a playlist on recursion which I believe is a nice place to start with. I will be talking about some of the famous techniques to approach recursion problems. I should mention that all the below techniques follow a simple principle of trying to generate all possible solutions and check if they satisfy the constraints of the problem.</p><p><strong>Backtracking</strong>: It is an incremental approach where we try to arrive at the solution bit by bit. At any point, if we believe that the current set of combinations cannot possibly arrive at the solution, we take a step back (discard it) and try again. The general pattern is to have a base condition and then run a loop to try and generate possible combinations and recur inside the loop in a depth-first manner. Prominent questions which can be solved using backtracking are <a href="https://leetcode.com/problems/combination-sum/">Combination Sum</a>, <a href="https://leetcode.com/problems/letter-combinations-of-a-phone-number/">Letter Combinations of a Phone Number</a>, and <a href="https://leetcode.com/problems/permutations/">Permutations</a>.</p><p><strong>Input/Output</strong>: For this technique, understanding the recursion tree is important. Every recursion problem has an input and one or more outputs which becomes the input for the next recursion call. Thinking questions from a perspective of the recursion tree and generating inputs and outputs accordingly might be helpful. Aditya Verma has beautifully talked about this pattern and its related questions. Prominent questions which can be solved using this technique are <a href="https://leetcode.com/problems/subsets/">Subsets</a>, and <a href="https://leetcode.com/problems/generate-parentheses/">Generate Parentheses</a>.</p><p><strong>DFS</strong>: When we think of DFS, we generally think of graphs. Questions involving 2D matrices where we have to traverse in all the directions to arrive at a solution also constitutes one of the important categories of questions solved by the DFS approach. In this approach, we first check the validity of the current cell, process it if it’s valid and recurse in the other directions. I recommend understanding the approach of <a href="https://leetcode.com/problems/number-of-islands/">Number of Islands</a>, <a href="https://leetcode.com/problems/longest-increasing-path-in-a-matrix/">Longest Increasing Path in a Matrix</a>, <a href="https://leetcode.com/problems/word-search/">Word Search</a>, and <a href="https://leetcode.com/problems/pacific-atlantic-water-flow/">Pacific Atlantic Water Flow</a> to get the hang of DFS questions that are usually asked in the interviews.</p><p><strong>Stack</strong>: Whenever we see a question regarding parathesis and evaluation of expressions, using a stack is usually the way to go. <a href="https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/">Minimum Remove to Make Valid Parentheses</a> is a nice question to start in this domain. Other good questions that can be solved using stack are <a href="https://leetcode.com/problems/basic-calculator/">Basic Calculator</a> and <a href="https://leetcode.com/problems/basic-calculator-ii/">Basic Calculator ||</a>.</p><p><strong>Heaps</strong>: Anytime we see a question involving the kth element (closest, smallest, largest), we should think about using Priority Queues or the QuickSelect algorithm. The regular solution involving sorting is naive and using heap is more efficient in these questions. While the heap solution is accepted in most of the interviews, QuickSelect is the most optimal solution. We should try to be well versed with this solution, which follows the ideology of the QuickSort algorithm. TECH DOSE is an awesome YouTube channel that has explained the QuickSelect algorithm well. We should also try to understand why the average case time complexity of QuickSelect is O(n) where n is the input size. Prominent questions which can be solved using QuickSelect are <a href="https://leetcode.com/problems/k-closest-points-to-origin/solution/">K Closest Points to Origin</a> and <a href="https://leetcode.com/problems/kth-largest-element-in-an-array/">Kth Largest Element in an Array</a>.<br>Prominent questions solved using heaps are <a href="https://leetcode.com/problems/meeting-rooms-ii/">Meeting Rooms ||</a>, <a href="https://leetcode.com/problems/merge-k-sorted-lists/">Merge k Sorted Lists</a>, and <a href="https://leetcode.com/problems/find-median-from-data-stream/">Find Median from Data Stream</a> which uses two heaps. Using heaps is a powerful technique and we should try to understand how we can solve the above questions using heaps and at the same time identify the pattern. One question that I like which can be solved using heaps is <a href="https://leetcode.com/problems/swim-in-rising-water/">Swim in Rising Water</a>. Solving this surely improves confidence and clears the concepts. We should also be well versed with using comparators with heaps. This is very important from an implementation perspective as depending on the question we might push pair or objects into the heap.</p><p><strong>Linked list</strong>: I think questions about linked lists are more implementation based than logic-based. You should try to be proficient with altering links, deleting nodes and traversing linked lists. It is important to understand the internal implementation and what is happening from the memory point of view. For C++ programmers, mycodeschool is an amazing YouTube channel that explains the pointers along with the Data Structures pretty well. Fast and slow pointer technique (where the slow pointer say goes to the next node and the fast pointer say goes to the next’s next node) is usually useful to detect merge points in two linked lists and to detect cycle in a linked list. I think if you can understand and implement <a href="https://leetcode.com/problems/reverse-nodes-in-k-group/">Reverse Nodes in k-Group</a> and <a href="https://leetcode.com/problems/copy-list-with-random-pointer/">Copy List with Random Pointer</a> without extra space, your linked list is solid.</p><p><strong>Trees</strong>: To start trees, do some basic tree questions including traversal (pre, in, post, level) to get the hang of it. <a href="http://cslibrary.stanford.edu/110/BinaryTrees.html">Binary Trees — Stanford CS Education Library</a> has a list of 15 basic binary tree questions with Java and C++ solutions which according to me serves as a nice place to start. I am not listing prominent tree questions as I think we should strive to do as many binary tree questions as possible. The level order traversal using queues can be a baseline to solve many questions like <a href="https://leetcode.com/problems/binary-tree-right-side-view/">Binary Tree Right Side View</a> and <a href="https://leetcode.com/problems/populating-next-right-pointers-in-each-node/">Populating Next Right Pointers in Each Node</a>.<br>I watched a few of the Aditya Verma videos on Trees and one of the things that I have learned from his videos is to solve the tree recursion problems in three steps. This I think is a very useful way of solving questions where you do not have any idea as to how to start the question and solve it as a whole. The first step is the base condition where you think about the base cases, things like what would happen if the tree is empty etc. The second step is the hypothesis where you usually write two recursive statements to get the answer from the left and the right subtrees. You may assume that it is returning the correct answer from both the subtrees. You may also assume it like a Black box which will return us the correct answer from both the subtrees. Now, the final step is induction. Here, you think that you are at a current node and you have the answers from its left and right subtrees. Now, the question is reduced to just a single node where given you have the answers from left and right subtrees, how will you use those to return the answer from that particular node? Thinking questions from this perspective and getting the hang of it by understanding questions like <a href="https://leetcode.com/problems/diameter-of-binary-tree/">Diameter of Binary Tree</a> and then approaching new questions with this technique might be helpful.</p><p><strong>Graphs</strong>: From my interview experience, I have observed that questions regarding shortest paths, Minimum Spanning Tree, and Strongly Connected Components are rarely asked. Hence, we should just be theoretically well aware of algorithms like Dijkstra’s, Bellman-Ford, Floyd Warshall, Prim’s, Kruskal’s and concepts like relaxation. I believe Abdul Bari sir has a good playlist on YouTube regarding the same. We should concentrate more on DFS, BFS, cycle detection, and topological sort (where to calculate a particular answer, we need to first calculate the answer of its components using linear ordering). Prominent questions from this category are <a href="https://leetcode.com/problems/clone-graph/">Clone Graph</a>, <a href="https://leetcode.com/problems/alien-dictionary/">Alien Dictionary</a>, <a href="https://leetcode.com/problems/accounts-merge/">Accounts Merge</a>, and <a href="https://leetcode.com/problems/word-ladder/">Word Ladder</a> which can be solved using BFS.</p><p><strong>Trie</strong>: Trie is a useful data structure in solving questions that involve word autocomplete and suggestions. I believe one should be well versed with its structure and operations like insert and search. Delete operation in the trie is not frequently asked. The prominent question from this category is <a href="https://leetcode.com/problems/word-search-ii/">Word Search II</a>.</p><p><strong>Dynamic Programming</strong>: It is usually considered one of the most intimidating topics. I think Aditya Verma’s playlist on Dynamic Programming has somewhat made life easier. What I loved about the 50 videos playlist was that instead of explaining how so many different problems can be approached, he has bifurcated most of the prominent DP problems into three parent categories of 0–1 Knapsack, Longest Common Subsequence, and Matrix Chain Multiplication. Besides that, he starts every problem with the intuitive approach of recursion followed by Memoisation(top-down DP) and finally Tabulation(bottom-up DP). His playlist surely makes DP less intimidating and improves the understanding of DP in general. I recommend watching all of the 50 videos. There are many prominent DP questions which I am sure most of us have heard but two of my favourite questions which can be solved using Memoisation are <a href="https://leetcode.com/problems/word-break/">Word Break</a>, and <a href="https://leetcode.com/problems/longest-string-chain/">Longest String Chain</a>.</p><p><strong>Important notes:</strong></p><p>Identification of the problems comes with practice. If you start following this article and then solve similar questions on your own, I believe that you will have a planned approach to most of the new problems you would see.</p><p>Arrays and Strings are more important than Dynamic Programming for most companies. Companies like Meta do not even ask Dynamic Programming. Hence, I recommend targetting Arrays and Strings properly before moving towards Dynamic Programming.</p><p>There are a lot of topics like Segment trees, AVL trees, Fenwick trees, and Disjoint sets which I have not covered as they are somewhat advanced and are rarely asked in the internship interviews.</p><p>There are a lot of other techniques like Greedy and Bit Manipulation which I have not covered. Greedy is mostly intuitive and questions requiring Bit Manipulation are rarely asked. I recommend going through the chapter on Bit Manipulation from Cracking the Coding Interview book if you are interested.</p><p>Sometimes when you have to calculate and manipulate an array in place, remember that you can traverse the array or string backwards as well. I recommend solving <a href="https://leetcode.com/problems/product-of-array-except-self/">Product of Array Except Self</a> to better understand what I am trying to say here.</p><p>According to me TECH DOSE is a good YouTube channel which you can refer to understand most of the questions I have linked above. Python Programmers can refer to the channel NeetCode.</p><p>As the next step, you should start solving the Top frequently asked company-specific leetcode questions of Apple, Microsoft, Amazon, Facebook, and Google in this particular order. Many questions would be common. I am sure once you have solved these questions, you will feel supremely confident going into the interviews.</p><p>These techniques are just like the weapons in your armoury. You will still need to practice how and where to use them. Practice hard, and do not give up. This article only covers DSA but you also need to prepare OS and Networks for companies like Citrix and Cisco. A good understanding of OOP and low-level design is also important. You can find my detailed article on how to answer behavioural questions <a href="https://leetcode.com/discuss/interview-question/1729926/A-guide-for-Behavioral-round">here</a>.<br>Happy Coding!</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=456e54c09523" width="1" height="1" alt="">]]></content:encoded>
        </item>
    </channel>
</rss>