0% completed

All LessonsFree Lessons (4)

Overview

Introduction to the Course

Number Theory

Greatest Common Divisor (Euclid's Algorithm)Check Prime Number Sieve of Eratosthenes Sieve of Eratosthenes - Optimized Find Prime Factors of a Number Extended Euclid's Algorithm Modular Multiplicative Inverse Using EEA Chinese Remainder Theorem Euler Phi's Function Lucas Theorem

Course Assessment

Number Theory

Divide and Conquer

Binary Search Implementation of Binary Search First and Last Occurrence of an Element Painter's Partition Problem

Greedy Algorithms

Introduction to Greedy Algorithms Activity Scheduling Problem Biased Standing Problem Load Balancer Problem Defense of a Kingdom Problem Greedy Knapsack Problem Greedy Knapsack Problem - Implementation

Course Assessment

Greedy Algorithms

Recursion and Backtracking

Introduction to Recursion & Backtracking

Multiplication Without Using * Operator

Quick Sort - Implementation

Convert Digits to Strings

Phone Keypad Problem

All Possible Subsequences of a String

N - Queens Problem

N - Queens Problem - Implementation

Rat in a Maze Problem

Sudoku Solver - Hard Problem

Course Assessment

Recursion and Backtracking

Dynamic Programming

Introduction to Dynamic Programming Minimum Steps to One Problem Minimum Steps to One Problem - Solution Using Top-Down DP Minimum Steps to One Problem - Solution Using Bottom-Up DP Minimum Coin Change Problem Minimum Coin Change Problem - Solution Using DP Wine and Maximum Price Problem Wine and Maximum Price Problem - Solution Using DP Longest Common Subsequence Problems Involving Grids - 1 Problems Involving Grids - 2 Problems Involving Grids - 3 Problem Involving Grids - 4 Longest Increasing Subsequence Building Bridges Problem - Solution Using LIS Shortest Common Supersequence of Two Strings Edit Distance Problem 0 - 1 Knapsack Problem 0 - 1 Knapsack Problem - Optimized Solution Rod Cutting Problem Rod Cutting Problem - Solution Using DP Longest Palindrome Subsequence Longest Palindrome Subsequence - Solution Using DP

Graphs

Introduction to Graphs Graph Representation Adjacency List Representation - Implementation Graph Traversal - Breadth-First Search Breadth-First Search - Implementation Cycle Detection Using Breadth-First Search Graph Traversal - Depth-First Search Topological Sorting Using DFS Find the Number of Connected Components in a Graph What Are Minimum Spanning Trees?Minimum Spanning Tree - Kruskal's Algorithm Minimum Spanning Tree - Prims's Algorithm Dijkstra's Algorithm

Bonus Lessons

Introduction to Bit-masking Find the Unique Number Introduction to Segment Trees Where to Go Next ?

Practice Mock Interview

Competitive Programming - Crack Your Coding Interview, C++/

...

/

Quick Sort

Quick Sort

Use Recursion to implement Quick Sort.

We'll cover the following...

- Solution: Recursive approach

R## Problem statement Quick Sort is a Divide and Conquer algorithm. It is the third sorting algorithm that we are going to discuss to perform sorting of an array of numbers.

Solution: Recursive approach

This sorting algorithm picks an element as a pivot and partitions the given array around the picked pivot. There are many different versions of Quick ...