SDE SHEET - A Complete Guide for SDE Preparation Last Updated : 06 Aug, 2025 Comments Improve Suggest changes Like Article Like Report Here is a curated list of the most popular questions among important topics, such as Programming Languages, Data Structure and Algorithms (DSA), CS Subjects, Aptitude, etc, asked in the Software Development Engineer Interviews. This sheet contains a wide range of coding questions from different Data Structures and Algorithms.It covers all the segments round-wise like MCQs, DSA (Coding Questions), CS Subjects, Puzzles, System Design, Projects.It is helpful for both Students and Experienced.Try our free course GfG 160 where we have 160 most asked problems along with well written editorials and video explanations. The course also has 90 bonus problems.Data Structures and Algorithms (250)Below are the list of top problems topic wise:Arrays (21)Find Missing and Repeating elementEasyStock Buy and Sell – Max one Transaction AllowedEasyRemove Duplicates in a Sorted ArrayEasyConvert Array into Zig-Zag fashionEasyFind third largest elementEasyCheck Pair Sum in a Sorted and Rotated ArrayMediumSort an array of 0s, 1s, and 2sMediumRotate Array K timesMediumFind Majority ElementMediumMaximum Subarray Sum – Kadane’s AlgorithmMediumStock Buy and Sell – Multiple Transaction AllowedMediumNext PermutationMediumMaximum Product SubarrayMediumMaximize i*arr[i] among all Rotations of ArrayMediumRearrange Array in Max Min FormMediumFind Smallest Missing Positive NumberMediumMinimum Jumps to Reach EndMediumTrapping Rain WaterHardMaximum Circular Subarray SumHardClosest Palindrome NumberHardStock Buy and Sell – Max 2 Transactions AllowedHardSorting (13)Important Sorting Algorithms: Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort, Cycle Sort, Counting Sort, Bucket Sort, Heap Sort, Radix SortMaximum Meetings in One RoomEasyChocolate Distribution ProblemEasyFind a Pair with the given differenceEasyForm the Largest NumberMediumMerge Two Sorted Arrays Without Extra SpaceMediumCount Inversions of an ArrayMediumMeeting Rooms - IIMediumMerge Overlapping IntervalsMediumMinimum Swaps to SortMediumMinimize the Maximum Difference between the HeightsMediumFind k largest elements in an array (Quick Sort Method)Medium3 Sum – Triplet Sum in ArrayMedium4 Sum - All QuadruplesMediumStrings (14)First Repeated CharacterEasyReverse WordsEasyRoman Number to IntegerEasyCheck AnagramEasyRemove DuplicatesEasyLongest Substring Without Repeating CharactersMediumRabin-Karp AlgorithmMediumZ algorithmMediumLongest Palindromic SubstringMediumLook-and-Say SequenceMediumNumber to English WordsMediumKMP AlgorithmHardMinimum Characters to Add at Front for PalindromeHardSmallest Window Containing All Characters of Another StringHardHashing (15)At least K OccurencesEasyCommon Elements in Two ArraysEasyLongest Subarray with 0 SumMediumCount Distinct Elements In Every Window of Size KMedium4 Sum – Count Quadruplets with Given SumMediumCheck If Array Pair Sums Divisible by kMediumLongest Consecutive SubsequenceMediumCount Subarrays having Sum KMediumLongest Subarray With Sum KMediumLongest Subarray With Sum Divisible By KMediumSort according to an ArrayMediumGroup Anagrams TogetherMediumCount Maximum Points on Same LineHardLFU cacheHard Minimum Window SubstringHardBinary Search (10)Binary Search AlgorithmEasyN-th root of a numberEasySingle Element in a Sorted ArrayMediumSearch in a Sorted and Rotated ArrayMediumSum of Middle Elements of two Sorted ArraysMediumFirst and Last OccurrenceMediumMedian of two Sorted ArraysHardMedian in a Row-wise sorted MatrixHardAllocate Minimum PagesHardAggressive CowsHardMatrix (6)Find the row with maximum number of 1sEasyRotate an Image 90 Degree ClockwiseMediumSpirally traversing a matrixMediumSearch in a Sorted MatrixMediumSet Matrix Rows and Columns to ZeroesMediumMax rectangle in Binary MatrixHardRecursion and Backtracking (13)Find all Unique SubsetsMediumGenerate Sums of all SubsetsMediumTower of HanoiMediumGenerate all Unique PermutationsMediumRat in a MazeMediumCombination Sum (Repeated Selection)MediumCombination Sum II (Single Selection)MediumGenerate all Palindromic PartitionsMediumGenerate Valid IP AddressesMediumWord SearchMediumN-Queen ProblemHardSolve SudokuHardWord BreakHardStack (10)Validate ParenthesesEasyImplement two Stacks in an ArrayMediumThe Stock Span ProblemMediumNext Greater ElementMediumGet Min from StackMediumEvaluation of Postfix ExpressionMediumLongest Valid Parentheses SubstringMediumLargest Rectangular Area in a HistogramHardMaximum of Minimum for Every Window SizeHardImplement K Stacks in an ArrayHardQueue (3)Moving Average from Data StreamEasyDesign Circular QueueMediumStream First Non-repeatingMediumDeque (3)Maximum of all subarrays of size KMediumLongest Subarray with Absolute Difference Less than or Equal to KMediumShortest Subarray with Sum at Least KHardStack + Queue (2)Stack using QueuesEasyQueue using StacksEasyHeap (10)Connect Ropes with Minimum CostEasyImplement Binary HeapMediumRearrange String to Avoid Adjacent DuplicatesMediumKth Largest ElementMediumMerge k Sorted ArraysMediumTop K Frequent ElementsMediumMerge K Sorted Linked ListsMediumKth Smallest Element in MatrixMediumSort a K Sorted ArrayMediumFind Median in StreamHardBit Manipulation (12)Important Bit operations: Set, Clear and Toggle a Bit, Strip Last Set Bit, Count Set BitsK-th Bit is Set or NotEasySwap 2 Numbers using XOREasyCheck if a Number is a Power of 2EasyRightmost Set BitEasyRightmost Different BitEasyToggle Bits in Given RangeEasySingle in CouplesEasyDivision without *, /, or %MediumCount Set Bits from 1 to NMediumGenerate Subsets using Bit ManipulationMediumFind Two Numbers with Odd OccurrencesMediumMaximum Subset XORHardLinked List (16)Find Middle of the Linked ListEasyReverse a Linked ListEasyKth from End of Linked ListEasyPairwise Swap Elements of Linked ListEasySort a linked list of 0s, 1s and 2sMediumRotate a Linked List K timesMediumIntersection in Y Shaped ListsMediumDetect Loop in Linked ListMediumRemove loop in Linked ListMediumFlattening a Linked ListMediumMerge two Sorted Linked ListsMediumAdd Two Numbers Represented as Linked ListMediumPalindrome Linked ListMediumLinked List Group ReverseHardClone a Linked List with Next and Random PointerHardLRU CacheHardBinary Tree (19)Important Traversal: Inorder, Preorder, Postorder, Level OrderLevel Order Traversal in Spiral FormEasyHeight of Binary TreeEasyBalanced Tree CheckEasyCheck Symmetric TreeEasyCheck Identical TreesEasyLeft View of Binary TreeEasyTop View of Binary TreeMediumBottom View of Binary TreeMediumDiagonal Tree TraversalMediumVertical Tree TraversalMediumLCA in Binary TreeMediumTree Boundary TraversalMediumDiameter of a Binary TreeMediumConnect Nodes of LevelsMediumSerialize and Deserialize a Binary TreeMediumConstruct Tree from Inorder & PreorderMediumMaximum Path Sum between 2 NodesMediumMax Path Sum between 2 Leaf NodesHardConvert Binary Tree to Doubly Linked ListHardBinary Search Tree (12)Check for BSTEasyLCA in BSTEasySorted Array to BSTEasyKth Largest Element in BSTEasyCeil in BSTMediumLargest BSTMediumMerge two BST 'sMediumPreorder to BSTMediumPredecessor and Successor in BSTMediumBinary Search Tree IteratorMediumDelete a Node from BSTMediumBalance a Binary Search TreeMediumGreedy (9)Minimize the Sum of ProductEasyLargest Number PossibleEasyMinimum Number of CoinsEasyAssign CookiesEasyGas StationMediumActivity SelectionMediumFractional KnapsackMediumJob SequencingMediumHuffman EncodingHardDynamic Programming (21)Ways to Reach the Nth StairMediumHouse Robber IIMediumCoin Change (Minimum Coins)MediumCoin Change (Count Ways)MediumLongest Common SubstringMediumLongest Increasing SubsequenceMediumLongest Common SubsequenceMedium0 - 1 Knapsack ProblemMediumPartition Equal Subset SumMediumMinimum Insertions to Form PalindromeMediumMaximize The Cut SegmentsMediumMaximum Path Sum in MatrixMediumRod CuttingMediumEgg Dropping PuzzleMediumWord BreakMediumOptimal Strategy For A GameMediumWildcard Pattern MatchingMediumEdit DistanceMediumMatrix Chain MultiplicationHardPalindromic PartitioningHardBoolean ParenthesizationHardGraph (32)DFS of GraphEasyBFS of GraphEasyDetect Cycle in Undirected GraphMediumDetect Cycle in a Directed GraphMediumDetect a Negative CycleMediumTopological SortingMediumShortest Path in Directed Acyclic GraphMediumKahn’s AlgorithmMediumDijkstra AlgorithmMediumBellman-Ford AlgorithmMediumFloyd Warshall AlgorithmMediumPrim’s AlgorithmMediumKruskal’s AlgorithmMediumEuler Path and CircuitMediumHamiltonian Path and CircuitMediumKosaraju’s AlgorithmHardTarjan’s AlgorithmHardBridges in GraphHardArticulation Points in GraphHardDisjoint Set (Union Find Algorithm)HardMother VertexMediumRotten OrangesMediumFlood fill AlgorithmMediumReplace O's with X'sMediumSteps by KnightMediumBipartite GraphMediumNumber of IslandsMediumClone an Undirected GraphMediumM-Coloring ProblemMediumAlien DictionaryHardCircle of StringsHardMinimum Cost PathHardTrie (6)Insert, Search and Delete in TrieMediumLongest Common Prefix of StringsMediumPrefix Suffix StringMediumWord Break (Trie)HardPhone DirectoryHardMaximum XOR SubarrayHardComputer Science Subjects1. Operating SystemAn operating system acts as an intermediary between the user of a computer and computer hardware. The purpose of an operating system is to provide an environment in which a user can execute programs conveniently and efficiently. Below links contains complete Operating System Study Material:Commonly Asked Operating Systems Interview QuestionsLast Minute Notes (LMNs) | Operating SystemsComplete Tutorial on Operating System2. DBMSDatabase is a collection of inter-related data which helps in efficient retrieval, insertion and deletion of data from database and organizes the data in the form of tables, Links, schemas, reports etc. Below Links contains complete DBMS study Material:Commonly Asked DBMS Interview QuestionsCommonly Asked DBMS Interview Questions | Set-2Last Minute Notes (LMNs) | DBMSComplete Tutorial on DBMS3. SQLSQL stands for Structured Query Language. It is a language used to interact with the database, i.e to create a database, to create a table in the database, to retrieve data or update a table in the database. Below Links contains complete SQL study Material:SQL Interview QuestionsSQL Interview Questions | Set-2SQL Interview Questions | Set-3Complete Tutorial on SQL4. Computer NetworksA computer network is a system that connects numerous independent computers in order to share information (data) and resources. The integration of computers and other different devices allows users to communicate more easily. Below Links contains complete Computer Networks study Material:Commonly Asked Computer Networks Interview QuestionsLast Minute Notes (LMNs) | Computer NetworksComplete Tutorial on Computer NetworksPuzzlesPuzzles are one of the ways to check your problem-solving skills. These are tricky questions that let you think logically. Try to solve the 20 most popular puzzles asked in InterviewsProjectsThoroughly revise all the work you have done till now in your projects. The grilling about projects can sometimes be very deep. Also, choose your words before you speak. Mention only those topics where you think you are fine to be grilled upon. If you haven't made a project then take an idea from GfG Projects and start working on these.System DesignSystem Design is the process of designing the architecture, components, and interfaces for a system so that it meets the end-user requirements. System Design for tech interviews is something that can’t be ignored especially for experienced people Almost every IT giant whether it be Facebook, Amazon, Google, or any other ask various questions based on System Design concepts such as scalability, load-balancing, caching, etc. in the interview. Please refer System Design tutorial that will help you to learn and master System Design concepts in the most efficient way from basics to advanced level. Bonus SDE SheetsYou can prepare for several types of interviews here. For instance, if you want to prepare for a Google interview, we have an SDE sheet specifically designed for that purpose. Here we attached the links to the top 5 product based and top 5 Service based preparation SDE Sheets.Product Based Company SDE SheetsService Based Company SDE SheetsFacebook(Meta) SDE SheetWipro SDE SheetAmazon SDE SheetInfosys SDE SheetApple SDE SheetTCS SDE SheetNetflix SDE SheetCognizant SDE SheetGoogle SDE SheetHCL SDE Sheet Comment More infoAdvertise with us Next Article Analysis of Algorithms K kartik Follow Improve Article Tags : DSA Software Development GFG Sheets SDE Sheet Similar Reads Basics & PrerequisitesLogic Building ProblemsLogic building is about creating clear, step-by-step methods to solve problems using simple rules and principles. It’s the heart of coding, enabling programmers to think, reason, and arrive at smart solutions just like we do.Here are some tips for improving your programming logic: Understand the pro 2 min read Analysis of AlgorithmsAnalysis of Algorithms is a fundamental aspect of computer science that involves evaluating performance of algorithms and programs. Efficiency is measured in terms of time and space.BasicsWhy is Analysis Important?Order of GrowthAsymptotic Analysis Worst, Average and Best Cases Asymptotic NotationsB 1 min read Data StructuresArray Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous 3 min read String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut 2 min read Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The 2 min read Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List: 2 min read Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first 2 min read Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems 2 min read Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most 4 min read Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of 3 min read Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this 15+ min read AlgorithmsSearching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input 2 min read Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ 3 min read Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution 14 min read Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get 3 min read Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net 3 min read Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of 3 min read Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit 4 min read AdvancedSegment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree 3 min read Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i 2 min read GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br 2 min read Interview PreparationInterview Corner: All Resources To Crack Any Tech InterviewThis article serves as your one-stop guide to interview preparation, designed to help you succeed across different experience levels and company expectations. Here is what you should expect in a Tech Interview, please remember the following points:Tech Interview Preparation does not have any fixed s 3 min read GfG160 - 160 Days of Problem SolvingAre you preparing for technical interviews and would like to be well-structured to improve your problem-solving skills? Well, we have good news for you! GeeksforGeeks proudly presents GfG160, a 160-day coding challenge starting on 15th November 2024. In this event, we will provide daily coding probl 3 min read Practice ProblemGeeksforGeeks Practice - Leading Online Coding PlatformGeeksforGeeks Practice is an online coding platform designed to help developers and students practice coding online and sharpen their programming skills with the following features. GfG 160: This consists of most popular interview problems organized topic wise and difficulty with with well written e 6 min read Problem of The Day - Develop the Habit of CodingDo you find it difficult to develop a habit of Coding? If yes, then we have a most effective solution for you - all you geeks need to do is solve one programming problem each day without any break, and BOOM, the results will surprise you! Let us tell you how:Suppose you commit to improve yourself an 5 min read Like