# Algorithms in C++: An Interview Refresher (Coderust)

Greedy Algorithms - Solution Review: Connecting n pipes with minimum cost This review provides a detailed analysis of the solution to connect n pipes with the minimum cost. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6332832517455872). Greedy Algorithms - Challenge 4: Find Minimum Number of Platforms Required for a Train Station Given arrival and departure times of trains, calculate the number of platforms required for a train station. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6419092976173056). Greedy Algorithms - Challenge 9: Find the Minimum Spanning Tree of the Given Graph Given an undirected weighted graph, find its minimum spanning tree. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6379991593910272). Greedy Algorithms - Challenge 10: Find Shortest Distance of Each Node from the Source Given a graph and a source node, find the shortest distance between the source node and all the other nodes. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4614482137448448). Dynamic Programming - Solution Review: The 0/1 Knapsack Problem This review provides a detailed analysis of the different ways to solve The Knapsack Problem View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4749983322472448). Divide and Conquer - Introduction to Divide and Conquer with Binary Search This lesson introduces the Divide and Conquer technique of solving a problem using Binary Search in a sorted array View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5717087204933632). Divide and Conquer - Solution Review: Missing Number in Sorted Array This review discusses the solution of the Missing Number in Sorted Array challenge in detail. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5300372744699904). Sorting & Searching - Quicksort Let's now study the famous quicksort algorithm! View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6553473644494848). Dynamic Programming - Challenge 10: Edit Distance Problem Let's solve the famous Edit Distance/Levenshtein Distance problem! View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5581489326522368). Sorting & Searching - Solution Review: Find Duplicates in Array Let's look at the various solutions to find the duplicates in an array View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6456716621250560). Sorting & Searching - Challenge 8: Search Insert Position Let's write a function to find the appropriate position to insert a new element in a sorted array View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5702297361317888). Divide and Conquer - Challenge 2: Peak Element In this lesson, we will find the peak element in a given array, the element that is greater than both of its neighbors. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5750416151150592). Divide and Conquer - Solution Review: Peak Element This review discusses the solution of the Peak Element Challenge in detail. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5674740180058112). Graph Algorithms - Solution Review: Print the Transpose of a Graph In this review lesson, we give a detailed analysis of how to transpose a graph. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4646125241892864). Graph Algorithms - Challenge 5: Print all Paths Between Two Nodes Given a graph, print all paths that exist between two nodes View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4758683047165952). Graph Algorithms - Solution Review: Print all Paths Between Two Nodes This review provides a detailed analysis of the solution to print all paths between two nodes. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5173061491884032). Graph Algorithms - Solution Review: Check if a Graph is Strongly Connected This review provides a detailed analysis of the solution to check whether a graph is strongly connected or not. Divide and Conquer - Solution Review: Shuffle Integers This review discusses the solution of the Shuffle Integers challenge in detail. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5541921705426944). Graph Algorithms - Challenge 9: Check If Given Graph is Bipartite Given an undirected graph, check whether it is Bipartite or not. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6522025625518080). Graph Algorithms - Quiz on Graph Algorithms Let's test your understanding of Graph Algorithms View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6224204103942144). Graph Algorithms - Challenge 10: Topological Sorting of a Graph Given a graph, perform topological sorting of it. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6360825403015168). Greedy Algorithms - Activity Scheduling Problem In this lesson, we go through a simple problem and solve it with the Greedy Approach. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4837239005642752). Divide and Conquer - Challenge 3: Maximum Subarray Sum In this lesson, we will solve the challenge of calculating the maximum sum subarray in a given array. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5657146641350656). Greedy Algorithms - Challenge 5: Help the Policemen Catch the thieves! Given a number of policemen and thieves, calculate the maximum number of thieves that can be caught. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6254257835606016). Greedy Algorithms - Challenge 6: Fractional Knapsack Problem Given weights and values of n items, put these in a knapsack of capacity W. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6754370337112064). Asymptotic Analysis - Useful Formulae In this lesson, we'll study some mathematical formulae that will make calculating time complexity easier! View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6622405118132224). Graph Algorithms - Challenge 6: Check If Graph is Strongly Connected Given a graph, check whether it is strongly connected or not. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6628012667699200). Divide and Conquer - Solution Review: Maximum Subarray Sum This review discusses the solution of the Maximum Subarray Sum Challenge in detail. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5851905299316736). Dynamic Programming - Solution Review: Strings Interleaving Let's analyze the different ways to solve the string interleaving problem View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5240259845554176). Dynamic Programming - Challenge 2: Staircase Problem Let's solve the triple step problem! Otherwise known as the staircase problem! View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5291006528323584). Greedy Algorithms - Quiz on Greedy Algorithms Let's test your understanding of Greedy Algorithms View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4780778305093632). Asymptotic Analysis - Solution Review: Big O of Nested Loop with Addition This review provides a detailed analysis of the time complexity of the Nested Loop with Addition problem! View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4542284878053376). Sorting & Searching - Selection Sort, Bubble Sort, & Insertion Sort Here's an overview of introductory sorting algorithms such as selection sort, bubble sort, and insertion sort. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4617855163170816). Sorting & Searching - Challenge 5: Find Duplicates in Array Write a function to find the duplicates in an array in the most efficient way! View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4528571953446912). Sorting & Searching - Quiz on Sorting & Searching Let's test your understanding of sorting and searching algorithms! View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4954489364676608). Graph Algorithms - Solution Review: Check if Removing Given Edge Creates Components in Graph This review provides a detailed analysis of the solution to remove a given edge from a graph. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6048873606807552). Dynamic Programming - Calculating Fibonnacci Numbers In this lesson, we'll look at the classic method to find the nth Fibonacci number and its time complexity using recurrence relations View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5643772113190912). Dynamic Programming - Introducing Dynamic Programming With Fibonacci Numbers In this lesson, we'll use a dynamic programming technique called memoization to reduce the time complexity of the Fibonacci function. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5659197488234496). Dynamic Programming - Tabulating Fibonacci Numbers Let's tabulate the code to find the nth Fibonacci number now. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6732638071029760). Dynamic Programming - Challenge 1: The 0/1 Knapsack Problem In this challenge, we'll introduce the famous 'knapsack problem' and solve a coding challenge on it. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5257190338199552). Dynamic Programming - Solution Review: The Partition Problem This review provides a detailed analysis of the ways to solve the partition problem View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5365465557762048). Conclusion - Overview A quick rundown of what we learned in the course. Hope you had fun taking this course! View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6255188098678784). Dynamic Programming - Solution Review: Longest Common Substring This review provides a detailed analysis of the different ways to solve the Longest Common Substring problem View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6523827733397504). Dynamic Programming - Challenge 6: Longest Palindromic Subsequence Let's write code to find the longest palindromic subsequence of a given string. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4569402563362816). Asymptotic Analysis - Introduction to Asymptotic Analysis and Big O Asymptotic analysis is a way to classify the running time complexity of algorithms. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5718443082907648). Asymptotic Analysis - Example 2 : Measuring Time Complexity of a Nested Loop Compute the time complexity of a given algorithm with nested loops. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4643243855708160). Algorithmic Paradigms - Greedy Algorithms This lesson introduces the Greedy problem-solving technique. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5430245609963520). Asymptotic Analysis - Solution Review : Nested Loop with Multiplication (Pro) This review provides a detailed analysis of how to solve the Nested Loop with Multiplication challenge View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6430915813179392). Sorting & Searching - Solution Review: Search in a Rotated Array Let's look at a detailed analysis of all the ways to search in a rotated array. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5467963610103808). Asymptotic Analysis - Complexity Measures This chapter will introduce you to the concept of time complexity and the efficiency of computer programs. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5727647063605248). Sorting & Searching - Overview of Sorting Algorithms Here's a quick summary of the time complexity of sorting algorithms. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4969487558246400). Sorting & Searching - Solution Review: Find Two Numbers that Add up to "n" This review provides a detailed analysis of the different ways to solve the previous challenge View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5204340262305792). Sorting & Searching - Challenge 3: Group Anagrams Have questions about Challenge 3: Group Anagrams? Go for it! View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5688544104284160). Sorting & Searching - Challenge 4: Find the Median of Two Sorted Arrays Let's write a function to find the median of two sorted arrays View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5009123663937536). Asymptotic Analysis - Solution Review : Nested Loop with Multiplication (Advanced) This review provides a detailed analysis of how to solve the nested loop with a multiplication problem. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6207429807177728). Graph Algorithms - Solution Review: Check If Given Graph is Bipartite In this review lesson, we give a detailed analysis of the solution to check if the given graph is bipartite or not. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5863445943549952). Asymptotic Analysis - Challenge 6 : Nested Loop with Multiplication (Pro) A pro-level exercise based on Big(O) of an algorithm that involves nested loops where the variables increment with multiplication and addition. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5468851997245440). Greedy Algorithms - Challenge 8: Graph Coloring Given a graph, color it in such a way that no adjacent graphs are the same color. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6289332820246528). Dynamic Programming - Challenge 4: Longest Common Substring Let's write some code to find the longest common substring View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4993289797238784). Dynamic Programming - Challenge 3: The Partition Problem Let's write code to solve the partition problem! View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5204393211199488). Dynamic Programming - Solution Review: Shortest Common Supersequence This review provides a detailed analysis of the different ways to solve the shortest common supersequence problem View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5489892203167744). Sorting & Searching - Searching Algorithms Let's study some famous and important searching algorithms including binary search! View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5572515831218176). Asymptotic Analysis - Challenge 4 : Nested Loop with Multiplication (Advanced) A little advanced exercise based on the Big(O) of an algorithm that involves nested loops where the variables increment with multiplication. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5317533655629824). Sorting & Searching - Challenge 10: Dutch National Flag Problem Have questions about Challenge 10: Dutch National Flag Problem? Go for it! View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6019628671172608). Graph Algorithms - Solution Review: Print all Connected Components of a Graph This review provides a detailed analysis of the solution to print all connected components of a graph. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4998830170832896). Asymptotic Analysis - Solution Review: Big O of Nested Loop with Multiplication This review provides a detailed analysis of how to solve the Big (O) of Nested Loop with Multiplication Challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6647362770436096). Greedy Algorithms - Challenge 1: Counting Money! Given infinite quarters, dimes, nickels and pennies, calculate the minimum number of coins to represent a number V. Implement the solution in C++ and see if your code runs successfully! View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5046585039781888). Sorting & Searching - Challenge 1: Find Two Numbers that Add up to "n" Have questions about Challenge 1: Find Two Numbers that Add up to "n"? Go for it! View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6281240464326656). Graph Algorithms - Introduction to Graph Algorithms and Implementation In this lesson, we learn about graphs and how we represent them. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5700680429862912). Sorting & Searching - Solution Review: Count Element Occurrence Here is a detailed analysis of the different ways to count the frequency of a number in a sorted array of integers View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5623888438362112). Greedy Algorithms - Solution Review: Largest Number with Given Number of Digits and Sum of Digits In this review, we give a detailed analysis of the solution to the previous challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6259927192436736). Sorting & Searching - Challenge 9: Sparse Search Given a sorted array of strings interspersed with empty strings, find the index of a given string. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5654471860289536). Graph Algorithms - Solution Review: Depth First Graph Traversal In this review, we learn how to write code for the Depth-First Traversal of a Graph View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6602786110177280). Greedy Algorithms - Solution Review: Graph Coloring This review provides a detailed analysis of the solution to the graph coloring problem. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4722020770119680). Introduction - Who This Course Is For Intended audience and pre-requisites for this course View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5496969470410752). Graph Algorithms - Challenge 1: Implement Breadth First Graph Traversal Implement Breadth First Graph Traversal. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6171341478690816). Sorting & Searching - Challenge 6: Search in Sorted Matrix Given a target, tell whether it is present in the matrix or not. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4954262167617536). Sorting & Searching - Challenge 7: Count Element Occurrence Have questions about Challenge 7: Count Element Occurrence? Go for it! View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4791150382678016). Graph Algorithms - Solution Review: Calculate the Number of Nodes in a Given Graph Level This review provides a detailed analysis of the different ways to calculate the number of nodes in an undirected graph level. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6724105246081024). Sorting & Searching - Solution Review: Find the Median of Two Sorted Arrays In this review lesson, we give a detailed analysis of the solution to find the median of two sorted arrays. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5746070359375872). Greedy Algorithms - Solution Review: Kruskal’s Solution to Minimum Spanning Tree In this review, we give a detailed analysis on finding the minimum spanning tree of the given graph using Kruskal's solution. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5534229418999808). Introduction - Learning Outcomes A brief summary of what you would learn in this course View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4689995782684672). Greedy Algorithms - Solution Review: Prim's Solution to Minimum Spanning Trees In this review, we give a detailed analysis on finding the minimum spanning tree of the given graph using Prim's solution. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5227790179762176). Greedy Algorithms - Solution Review: Counting Money This review provides a detailed analysis of the different ways to solve the counting money challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4736460181733376). Greedy Algorithms - Solution Review: Find the Shortest Distance of Each Node from the Source This review provides a detailed analysis of the solutions to find the shortest distance of each node from the source. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4535594862510080). Greedy Algorithms - Solution Review: Find the Egyptian Fraction This review provides a detailed analysis of how to convert a fraction to a series of Egyptian Fractions View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5320767296241664). Sorting & Searching - Merge Sort From this lesson on, we'll study some key sorting algorithms that are used in real-life projects—the first of which is merge sort! View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4871921537646592). Sorting & Searching - Solution Review: Search Insert Position Let's look at a detailed analysis of the different ways to find the position to insert an element at in an array View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6175241644539904). Asymptotic Analysis - Challenge 3: Big O of Nested Loop with Multiplication Compute the Big(O) of an algorithm that involves nested loops where the variables increment with multiplication. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4544671739019264). Asymptotic Analysis - Example 1: Measuring Time Complexity of a Simple Loop In this lesson, we are going to learn how to compute the running time complexity of an algorithm that involves loops. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4815433121136640). Dynamic Programming - Challenge 7: The Coin Change Problem Let's solve a coding challenge on the different ways to represent a given number of cents. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5928587511201792). Graph Algorithms - Challenge 3: Calculate the Number of Nodes in a Given Graph Level Given a graph, calculate the number of nodes in an undirected graph level. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5770275285106688). Dynamic Programming - Challenge 8: Egg Dropping Problem Let's solve the famous egg dropping problem! View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5764766352015360). Graph Algorithms - Challenge 7: Print all Connected Components in a Graph Given an undirected graph, find all connected components in a graph. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5615173479956480). Dynamic Programming - Solution Review: Egg Dropping Problem Have questions about Solution Review: Egg Dropping Problem? Go for it! View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6448830792859648). Divide and Conquer - Pascal's Triangle This lesson discusses another problem that falls under the paradigm of divide and conquer algorithms: Pascal's Triangle. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6248391839318016). Divide and Conquer - Solution Review: Euclidean Algorithm This review discusses the solution of the Euclidean Algorithm Challenge in detail. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6633915496267776). Dynamic Programming - Solution Review: Coin Change Problem This review provides a detailed analysis of the different ways to solve The Coin Change Problem View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4534966253780992). Divide and Conquer - Challenge 1: Euclidean Algorithm In this lesson, we will introduce the Euclidean Algorithm for calculating the greatest common divisor and solve a challenge on it. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5677161188950016). Dynamic Programming - Solution Review: The Edit Distance Problem This review provides a detailed analysis of the ways to solve the famous Edit Distance problem. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4755219625803776). Greedy Algorithms - Challenge 2: Connecting n pipes with minimum cost Given n pipes, find the minimum cost of connecting them. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6353690086604800). Dynamic Programming - Quiz on Dynamic Programming Here's a quiz to test your dynamic programming skills! View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4521156927291392). Divide and Conquer - Challenge 7: Closest Pair of Points In this lesson, we will solve a challenge on finding the closest pair of points in Euclidean space. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6333155344646144). Divide and Conquer - Challenge 8: Missing Number in Sorted Array In this lesson, we will solve a challenge on finding the missing number in a sorted array. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5258073490849792). Conclusion - Where to Go from Here Thank you for taking our course! View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4760010594713600). Divide and Conquer - Challenge 9: Binary Search on Singly Linked List In this lesson, we will solve the challenge of performing Binary Search on Singly Linked List. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6105577543434240). Divide and Conquer - Challenge 10: Shuffle Integers In this lesson, we will solve a challenge on shuffling an array of 2n integers without using extra space. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4517705988177920). Appendix: Auxiliary Source Code - STL Classes This lesson provides you with the helper STL classes used throughout the course View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5559600965222400). Appendix: Auxiliary Source Code - Linked List This lesson provides you with the helper Linked List class used in our challenge lessons. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4683246979776512). Appendix: Auxiliary Source Code - Graph This lesson provides you with the helper Graph class used in our challenge lessons. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4652856730714112). Divide and Conquer - Solution Review: Merge a Number of Sorted Arrays This review discusses the solution of the Merge Sorted Arrays challenge in detail. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6403741622206464). Divide and Conquer - Challenge 4: Merge a Number of Sorted Arrays In this lesson, we will solve the challenge of merging the sorted subarrays (an essential part of merge sort). View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5733493980004352). Divide and Conquer - Solution Review: Find Closest Number This review discusses the solution of the Find Closest Number challenge in detail. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6348595919847424). Divide and Conquer - Solution Review: Binary Search on Singly Linked List This review discusses the solution of the Binary Search on Singly Linked List challenge in detail. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4838505417015296). Divide and Conquer - Quiz on Divide and Conquer This short quiz will test your knowledge on what you have learned in the previous chapters about divide and conquer approach. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5634022537428992). Appendix: Auxiliary Source Code - Array Functions Here is the code that we have used for several arrays. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4680652886638592). Appendix: Auxiliary Source Code - Binary Search Tree Have questions about Appendix: Auxiliary Source Code - Binary Search Tree? Go for it! Divide and Conquer - Solution Review: Collect Coins in Minimum Steps This review discusses the solution of the Collect Coins in Minimum Steps challenge in detail. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5873507172876288). Divide and Conquer - Solution Review: Closest Pair of Points This review discusses the solution of the Closest Pair of Points challenge in detail. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5692002626699264). Graph Algorithms - Solution Review: Breadth First Graph Traversal In this review, we will learn how to write code for the Breadth-First Traversal of a Graph. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5672943531065344). Algorithmic Paradigms - Brute Force This lesson gives a gentle introduction to the Brute Force paradigm using Linear Search in an unsorted array. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5708072068579328). Asymptotic Analysis - Other Common Asymptotic Notations and Why Big O Trumps Them This lesson covers the various asymptotic notations for algorithms and why it's a good idea to use Big O instead of other notations. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5787794322489344). Asymptotic Analysis - Challenge 1: Big O of Nested Loop with Addition Compute the Big O complexity of an algorithm that involves nested loops, specifically where the variables increase with addition. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5980122421133312). Algorithmic Paradigms - Dynamic Programming Here is a quick introduction to the Dynamic Programming paradigm! View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4551870540414976). Algorithmic Paradigms - Divide and Conquer Have questions about Divide and Conquer? Go for it! View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5132352516784128). Graph Algorithms - Challenge 2: Implement Depth First Graph Traversal Given a graph, print its depth-first graph traversal. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5485890468052992). Greedy Algorithms - Solution Review: Find Minimum Number of Platforms Required for a Train Station This review provides a detailed analysis of the solutions to find the number of platforms required for a train station. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5312004422107136). Asymptotic Analysis - Challenge 5 : Nested Loop with Multiplication (Complex) A more complex exercise based on the Big(O) of an algorithm that involves nested loops where the variables increment with multiplication. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6443433562472448). Asymptotic Analysis - Solution Review: Big O of Nested Loop with Subtraction This review provides a detailed analysis of how to solve the Big (O) of Nested Loop with Subtraction challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4593207889362944). Dynamic Programming - Solution Review: Staircase Problem This review contains a detailed analysis of the different ways to solve the Staircase Problem. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5122140560949248). Greedy Algorithms - Challenge 3: Find the Egyptian Fraction Given a positive fraction, break it down into its Egyptian fractions. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6655175718600704). Dynamic Programming - Challenge 9: Strings Interleaving Let's write code to find out if a given string is the result of interleaving two other strings View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6119189704081408). Divide and Conquer - Challenge 5: Collect Coins in Minimum Steps In this lesson, we will find out the minimum number of steps it takes to collect coins using a given array that is the height of vertically stacked coins. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5745976507629568). Asymptotic Analysis - Challenge 2: Big O of Nested Loop with Subtraction Compute the Big(O) of an algorithm that involves nested loops where the variables decrement with subtraction. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5264907824005120). Sorting & Searching - Solution Review: Sparse Search In this review lesson, we give a detailed analysis of the solutions to solve the sparse search problem. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6139693072646144). Asymptotic Analysis - Solution Review : Nested Loop with Multiplication (Complex) A more complex exercise based on the Big(O) of an algorithm that involves nested loops where the variables increment with multiplication and addition. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5305015906336768). Dynamic Programming - Challenge 5: Shortest Common Superstring Given two strings, let's write a function to find their shortest common supersequence View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5796938106535936). Dynamic Programming - Memoizing Fibonacci Numbers In this lesson, we are going to reduce the time complexity of the Fibonacci code we wrote using a dynamic programming technique called memoization View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6653166076559360). Asymptotic Analysis - Complexity Quiz: Test your understanding of Complexity The top ten most commonly asked interview questions about Complexity Measure will be covered in this lesson in the form of a quiz. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5769143762550784). Graph Algorithms - Challenge 4: Print the Transpose of a Graph Given a graph, find its transpose. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4655326001364992). Graph Algorithms - Solution Review: Topological Sorting of a Graph This review provides a detailed analysis of the solution to perform topological sorting of a graph. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5883717249662976). Greedy Algorithms - Challenge 7: Largest Number with Given Number of Digits and Sum of Digits Given the number of digits and the sum of the digits, find the largest number that can be created. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4608447104417792). Asymptotic Analysis - Common Complexity Scenarios This lesson summarizes our discussion of complexity measures and includes some commonly used examples and handy formulae to help you with your interview. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4606388472905728). Sorting & Searching - Challenge 2: Search in a Rotated Array Let's write a function to search in a sorted and rotated array View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5094816851427328). Sorting & Searching - Solution Review: Dutch National Flag Problem In this review lesson we give a detailed analysis of the solutions for the Dutch National Problem. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5370057817325568). Sorting & Searching - Solution Review: Group Anagrams Here's a detailed analysis on how to solve the Group Anagrams problem View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5328022167093248). Sorting & Searching - Solution Review: Search in Sorted Matrix This review lesson gives a detailed analysis of the solutions to search a target in a sorted matrix. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5248820789116928). Dynamic Programming - Solution Review: Longest Palindromic Subsequence This review provides a detailed analysis of the different ways to solve the Longest Palindromic Subsequence Problem View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6383090245042176). Greedy Algorithms - Solution Review: Help the Policemen Catch the thieves! This review provides a detailed analysis of the solution to the catching thieves problem. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5694968301617152). Greedy Algorithms - Solution Review: Fractional Knapsack Problem This review provides a detailed analysis of the solution to the fractional knapsack problem. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/5326522015547392). Divide and Conquer - Challenge 6: Find The Closest Number In this lesson, we will solve a challenge on finding the closest number to a given number in an array. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/6011358443208704). Graph Algorithms - Challenge 8: Check if Removing Given Edge Creates Components in Graph Given a graph and an edge, check whether removing that edge creates components in the graph. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5745541363269632/4966325858336768).