Log in Register

Steps to start the course with Carlos Raul

1

Share your information

Insert the email with which you signed up in the app or will be signing up, and complete the payment using your debit or credit card.

+

+

2

Unlock all content

After completing the payment, you will receive a confirmation email and the course will be unlocked in the app.

+

+

3

Start Learning

Take at least 10 mins of your day to complete one lesson from the teacher and practice with our engaging learning activities.

Ready for the next step?

Buy Now

EducUp

Start the course

from EducUp's App

EducUp

Carlos is a Senior Software Engineer and startup founder who loves building and impacting people’s lives using technology and innovation.

View profile of educuper

EducUp

Carlos Raul is waiting for you

What you will learn

Become premium and unlock all the content. Prices are in USD (American dollars).

You will strengthen your coding skills with 1609 questions and answers on Data Structure and Algorithms II.

You will enjoy 70 FREE lessons and you will be able to continue the course by choosing one of our plans.

You will be able to study in your free time, from anywhere, with 3974 didactic explanations.

You will have the tools to ingeniously solve a variety of real-world problems.

You will strengthen your analysis and abstraction skills with 5273 dynamic exercises.

You will be able to create more efficient software by optimizing resources.

In just 3 months you should be able to complete this course.

Become premium and unlock all the content. Prices are in USD (American dollars).

You will strengthen your coding skills with 1609 questions and answers on Data Structure and Algorithms II.

You will enjoy 70 FREE lessons and you will be able to continue the course by choosing one of our plans.

You will be able to study in your free time, from anywhere, with 3974 didactic explanations.

You will have the tools to ingeniously solve a variety of real-world problems.

You will strengthen your analysis and abstraction skills with 5273 dynamic exercises.

You will be able to create more efficient software by optimizing resources.

In just 3 months you should be able to complete this course.

EducUp

Take a diagnostic of the course!

EducUp

Course Content

Challenge 1

Searching

Fibonacci Search

Fibonacci Search

Fibonacci Search

Linear Search Iterative

Linear Search Iterative

Linear Search Iterative

Linear Search Recursive

Linear Search Recursive

Linear Search Recursive

Exponential Search

Exponential Search

Exponential Search

Interpolation Searching Algorithm

Interpolation Searching Algorithm

Interpolation Searching Algorithm

Binary Search Iterative

Binary Search Iterative

Binary Search Iterative

Uniform Binary Search

Uniform Binary Search

Uniform Binary Search

Substring Searching Algorithm

Substring Searching Algorithm

Substring Searching Algorithm

Jump Search

Jump Search

Sorting

Library Sort

Library Sort

Insertion Sort – 1

Insertion Sort – 1

Insertion Sort – 1

Insertion Sort – 2

Insertion Sort – 2

Insertion Sort – 2

Strand Sort

Strand Sort

Selection Sort

Selection Sort

Cocktail Sort

Cocktail Sort

Comb Sort

Comb Sort

Bubble Sort

Bubble Sort

Merge Sort

Merge Sort

Gnome Sort

Gnome Sort

In-place Merge Sort

In-place Merge Sort

In-place Merge Sort

Bogosort

Bogosort

Sleep Sort

Sleep Sort

Bottom-Up Mergesort

Bottom-Up Mergesort

Bottom-Up Mergesort

Pigeonhole Sort

Pigeonhole Sort

Pigeonhole Sort

Quicksort – 1

Quicksort – 1

Quicksort – 2

Quicksort – 2

LSD Radix Sort

LSD Radix Sort

Quicksort – 3

Quicksort – 3

MSD Radix Sort

MSD Radix Sort

Quicksort using Random Sampling

Quicksort using Random Sampling

Quicksort using Random Sampling

Counting Sort

Counting Sort

Quicksort using Median-of-Three Partitioning

Quicksort using Median-of-Three Partitioning

Quicksort using Median-of-Three Partitioning

Bucket Sort (Uniform Keys)

Bucket Sort (Uniform Keys)

Bucket Sort (Uniform Keys)

Shell Sort – 1

Shell Sort – 1

Bead Sort

Bead Sort

Pancake Sort

Pancake Sort

Shell Sort – 2

Shell Sort – 2

Heapsort – 1

Heapsort – 1

Odd-Even Sort

Odd-Even Sort

Heapsort – 2

Heapsort – 2

Stooge Sort

Stooge Sort

Introsort

Introsort

Permutation Sort

Permutation Sort

Permutation Sort

Recursive Bubble Sort

Recursive Bubble Sort

Recursive Bubble Sort

Timsort

Timsort

Cubesort

Cubesort

Binary Insertion Sort

Binary Insertion Sort

Binary Insertion Sort

Recursive Insertion Sort

Recursive Insertion Sort

Recursive Insertion Sort

Binary Tree Sort

Binary Tree Sort

Binary Tree Sort

Tree Sort

Tree Sort

Cycle Sort

Cycle Sort

Graph Search

Best First Search

Best First Search

Best First Search

Depth First Search

Depth First Search

Depth First Search

Non-recursive Depth First Search

Non-recursive Depth First Search

Non-recursive Depth First Search

Branch and Bound

Branch and Bound

Branch and Bound

Breadth First Search

Breadth First Search

Breadth First Search

Minimum Spanning Tree

Minimum Spanning Tree

Minimum Spanning Tree

Minimum Spanning Tree

Minimum Spanning Tree

Prim’s Algorithm

Prim’s Algorithm

Prim’s Algorithm

Kruskal’s Algorithm

Kruskal’s Algorithm

Kruskal’s Algorithm

Shortest Path

Floyd-Warshall Algorithm

Floyd-Warshall Algorithm

Floyd-Warshall Algorithm

Dijkstra’s Algorithm

Dijkstra’s Algorithm

Dijkstra’s Algorithm

Bellman-Ford Algorithm

Bellman-Ford Algorithm

Bellman-Ford Algorithm

Matching

Maximum Bipartite Matching

Maximum Bipartite Matching

Maximum Bipartite Matching

Minimum Cut

Minimum Cut

Recursion

Fractional Knapsack Problem

Fractional Knapsack Problem

Fractional Knapsack Problem

Huffman Code

Huffman Code

Page Replacement Algorithms

Page Replacement Algorithms

Co-ordinate Compression

Co-ordinate Compression

Co-ordinate Compression

Topological Sorting

Topological Sorting

Topological Sorting

Quickselect

Quickselect

Square Root Decomposition

Square Root Decomposition

Square Root Decomposition

Miscellaneous

Challenge 2

String Matching

String Matching

Rabin-Karp Algorithm

Rabin-Karp Algorithm

Rabin-Karp Algorithm

Quick Search Algorithm

Quick Search Algorithm

Quick Search Algorithm

Number Theory

Generating Combinations

Generating Combinations

Generating Combinations

Euclid’s Algorithm

Euclid’s Algorithm

Euclid’s Algorithm

Strassen’s Algorithm

Strassen’s Algorithm

Strassen’s Algorithm

Generating Partitions

Generating Partitions

Generating Partitions

Generating Subsets

Generating Subsets

Generating Subsets

Pseudorandom Number Generators

Pseudorandom Number Generators

Pseudorandom Number Generators

Generating Permutations

Generating Permutations

Generating Permutations

Inclusion-Exclusion Principle

Inclusion-Exclusion Principle

Inclusion-Exclusion Principle

Computational Geometry

Computational Geometry

Line Point Distance

Line Point Distance

Line Point Distance

Quickhull

Quickhull

Closest Pair Problem

Closest Pair Problem

Closest Pair Problem

Chan’s Algorithm

Chan’s Algorithm

Chan’s Algorithm

Cross Product

Cross Product

Flow Networks

Stable Marriage Problem

Stable Marriage Problem

Stable Marriage Problem

Maximum Flow Problem

Maximum Flow Problem

Maximum Flow Problem

Minimum Cut

Edge Coloring

Edge Coloring

Vertex Coloring

Vertex Coloring

Vertex Coloring

Chromatic Number

Chromatic Number

Chromatic Number

Graph Coloring

Bipartite Graph

Bipartite Graph

Bipartite Graph

Complete Bipartite Graph

Complete Bipartite Graph

Complete Bipartite Graph

Properties of Bipartite Graphs

Properties of Bipartite Graphs

Properties of Bipartite Graphs

Bipartite Graphs

Bipartite Graphs

Stack Reversal using Recursion

Stack Reversal using Recursion

Stack Reversal using Recursion

Recursion

Recursion

Factorial using Recursion

Factorial using Recursion

Factorial using Recursion

Recursive Selection Sort

Recursive Selection Sort

Recursive Selection Sort

Fibonacci using Recursion

Fibonacci using Recursion

Fibonacci using Recursion

Largest and Smallest Number in an Array using Recursion

Largest and Smallest Number in an Array using Recursion

Largest and Smallest Number in an Array using Recursion

Largest and Smallest Number in a Linked List using Recursion

Largest and Smallest Number in a Linked List using Recursion

Largest and Smallest Number in a Linked List using Recursion

Sum of n Natural Numbers using Recursion

Sum of n Natural Numbers using Recursion

Sum of n Natural Numbers using Recursion

Search an Element in an Array using Recursion – 1

Search an Element in an Array using Recursion – 1

Search an Element in an Array using Recursion – 1

GCD and LCM using Recursion – 1

GCD and LCM using Recursion – 1

GCD and LCM using Recursion – 1

Length of a String using Recursion

Length of a String using Recursion

Length of a String using Recursion

GCD and LCM using Recursion – 2

GCD and LCM using Recursion – 2

GCD and LCM using Recursion – 2

Search an Element in an Array using Recursion – 2

Search an Element in an Array using Recursion – 2

Search an Element in an Array using Recursion – 2

Search an Element in a Linked List using Recursion

Search an Element in a Linked List using Recursion

Search an Element in a Linked List using Recursion

Sum of Digits of a Number using Recursion

Sum of Digits of a Number using Recursion

Sum of Digits of a Number using Recursion

Power of a Number using Recursion in Logn Time

Power of a Number using Recursion in Logn Time

Power of a Number using Recursion in Logn Time

String Reversal using Recursion

String Reversal using Recursion

String Reversal using Recursion

Towers of Hanoi using Recursion

Towers of Hanoi using Recursion

Towers of Hanoi using Recursion

Decimal to Binary Conversion using Recursion

Decimal to Binary Conversion using Recursion

Decimal to Binary Conversion using Recursion

Length of a Linked List using Recursion

Length of a Linked List using Recursion

Length of a Linked List using Recursion

Master’s Theorem – 1

Master’s Theorem – 1

Master’s Theorem – 1

Master’s Theorem – 2

Master’s Theorem – 2

Master’s Theorem – 2

Matrix Multiplication using Recursion

Matrix Multiplication using Recursion

Matrix Multiplication using Recursion

Backtracking

Dynamic Programming

Dynamic Programming

Dynamic Programming

Longest Common Subsequence

Longest Common Subsequence

Longest Common Subsequence

Longest Palindromic Subsequence

Longest Palindromic Subsequence

Longest Palindromic Subsequence

Fibonacci using Dynamic Programming

Fibonacci using Dynamic Programming

Fibonacci using Dynamic Programming

Coin Change Problem

Coin Change Problem

Coin Change Problem

Edit Distance Problem

Edit Distance Problem

Edit Distance Problem

Maximum Sum of Continuous Subarray – 1

Maximum Sum of Continuous Subarray – 1

Maximum Sum of Continuous Subarray – 1

Wagner-Fischer Algorithm

Wagner-Fischer Algorithm

Wagner-Fischer Algorithm

Catalan Number using Dynamic Programming

Catalan Number using Dynamic Programming

Catalan Number using Dynamic Programming

Maximum Sum of Continuous Subarray – 2

Maximum Sum of Continuous Subarray – 2

Maximum Sum of Continuous Subarray – 2

Assembly Line Scheduling

Assembly Line Scheduling

Assembly Line Scheduling

Kadane’s Algorithm

Kadane’s Algorithm

Kadane’s Algorithm

Minimum Insertions to form a Palindrome

Minimum Insertions to form a Palindrome

Minimum Insertions to form a Palindrome

Longest Increasing Subsequence

Longest Increasing Subsequence

Longest Increasing Subsequence

Maximum Sum Rectangle in a 2D Matrix

Maximum Sum Rectangle in a 2D Matrix

Maximum Sum Rectangle in a 2D Matrix

Rod Cutting

Rod Cutting

Balanced Partition

Balanced Partition

Balanced Partition

Minimum Number of Jumps

Minimum Number of Jumps

Minimum Number of Jumps

0/1 Knapsack Problem

0/1 Knapsack Problem

0/1 Knapsack Problem

Dice Throw Problem

Dice Throw Problem

Dice Throw Problem

Matrix-chain Multiplication

Matrix-chain Multiplication

Matrix-chain Multiplication

Counting Boolean Parenthesizations

Counting Boolean Parenthesizations

Counting Boolean Parenthesizations

Cryptography

Subset Sum Problem

Subset Sum Problem

Subset Sum Problem

Hamming Code

Hamming Code

P, NP, NP-hard, NP-complete Complexity Classes

P, NP, NP-hard, NP-complete Complexity Classes

P, NP, NP-hard, NP-complete Complexity Classes

Set Partition Problem

Set Partition Problem

Set Partition Problem

Hamiltonian Path Problem

Hamiltonian Path Problem

Hamiltonian Path Problem

Complexity Classes & NP Complete

Complexity Classes & NP Complete

First-in, First-out Algorithm (FIFO)

First-in, First-out Algorithm (FIFO)

First-in, First-out Algorithm (FIFO)

Optimal Page Replacement Algorithm

Optimal Page Replacement Algorithm

Optimal Page Replacement Algorithm

Download our app

Choose one of the stores

Choose one of the stores

en

Course Categories

Personal Finance

Contact US

Miami, Florida US.

hello@educup.io