Data Structures and Algorithms II

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

Ver perfil del educUper

Carlos Raul espera por ti

Lo que vas a aprender

Hazte premium y desbloquea todo el contenido. Los precios están en USD (dólares americanos).

Fortalecerás tus habilidades de programación con 1609 preguntas y respuestas sobre EDA II.

Disfrutarás de 70 lecciones GRATIS y podrás continuar el curso eligiendo uno de nuestros planes.

Podrás estudiar en tus ratos libres, desde cualquier sitio, con 3974 explicaciones didácticas .

Tendrás las herramientas para resolver de forma ingeniosa diversos problemas reales .

Fortalecerás tu capacidad de análisis y abstracción con 5273 ejercicios dinámicos

Serás capaz de crear softwares más eficiente optimizando recursos.

En sólo 3 meses podrás completar este curso.

Hazte premium y desbloquea todo el contenido. Los precios están en USD (dólares americanos).

Fortalecerás tus habilidades de programación con 1609 preguntas y respuestas sobre EDA II.

Disfrutarás de 70 lecciones GRATIS y podrás continuar el curso eligiendo uno de nuestros planes.

Podrás estudiar en tus ratos libres, desde cualquier sitio, con 3974 explicaciones didácticas .

Tendrás las herramientas para resolver de forma ingeniosa diversos problemas reales .

Fortalecerás tu capacidad de análisis y abstracción con 5273 ejercicios dinámicos

Serás capaz de crear softwares más eficiente optimizando recursos.

En sólo 3 meses podrás completar este curso.

Contenido del curso

Entrevistas

Searching

Fibonacci Search

Linear Search Iterative

Linear Search Recursive

Exponential Search

Interpolation Searching Algorithm

Binary Search Iterative

Uniform Binary Search

Substring Searching Algorithm

Jump Search

Sorting

Insertion Sort – 1

Library Sort

Insertion Sort – 2

Strand Sort

Selection Sort

Cocktail Sort

Bubble Sort

Comb Sort

Merge Sort

Gnome Sort

Bogosort

In-place Merge Sort

Sleep Sort

Bottom-Up Mergesort

Pigeonhole Sort

Quicksort – 1

Quicksort – 2

LSD Radix Sort

Quicksort – 3

MSD Radix Sort

Quicksort using Random Sampling

Counting Sort

Quicksort using Median-of-Three Partitioning

Bucket Sort (Uniform Keys)

Shell Sort – 1

Bead Sort

Pancake Sort

Shell Sort – 2

Heapsort – 1

Odd-Even Sort

Heapsort – 2

Stooge Sort

Permutation Sort

Introsort

Recursive Bubble Sort

Timsort

Binary Insertion Sort

Cubesort

Binary Tree Sort

Recursive Insertion Sort

Tree Sort

Cycle Sort

Graph Search

Best First Search

Depth First Search

Non-recursive Depth First Search

Branch and Bound

Breadth First Search

Minimum Spanning Tree

Minimum Spanning Tree

Prim’s Algorithm

Kruskal’s Algorithm

Shortest Path

Floyd-Warshall Algorithm

Dijkstra’s Algorithm

Bellman-Ford Algorithm

Matching

Maximum Bipartite Matching

Minimum Cut

Recursion

Fractional Knapsack Problem

Huffman Code

Page Replacement Algorithms

Topological Sorting

Co-ordinate Compression

Square Root Decomposition

Quickselect

Miscellaneous

Challenge 2

String Matching

Rabin-Karp Algorithm

Quick Search Algorithm

Number Theory

Generating Combinations

Euclid’s Algorithm

Strassen’s Algorithm

Generating Partitions

Generating Subsets

Pseudorandom Number Generators

Generating Permutations

Inclusion-Exclusion Principle

Computational Geometry

Line Point Distance

Quickhull

Closest Pair Problem

Chan’s Algorithm

Cross Product

Flow Networks

Stable Marriage Problem

Maximum Flow Problem

Minimum Cut

Edge Coloring

Vertex Coloring

Chromatic Number

Graph Coloring

Bipartite Graph

Complete Bipartite Graph

Properties of Bipartite Graphs

Bipartite Graphs

Stack Reversal using Recursion

Recursion

Factorial using Recursion

Recursive Selection Sort

Fibonacci using Recursion

Largest and Smallest Number in an Array using Recursion

Largest and Smallest Number in a Linked List using Recursion

Sum of n Natural Numbers using Recursion

Search an Element in an Array using Recursion – 1

GCD and LCM using Recursion – 1

Length of a String using Recursion

GCD and LCM using Recursion – 2

Search an Element in an Array using Recursion – 2

Search an Element in a Linked List using Recursion

Sum of Digits of a Number using Recursion

Power of a Number using Recursion in Logn Time

String Reversal using Recursion

Towers of Hanoi using Recursion

Decimal to Binary Conversion using Recursion

Length of a Linked List using Recursion

Master’s Theorem – 1

Master’s Theorem – 2

Matrix Multiplication using Recursion

Backtracking

Dynamic Programming

Longest Common Subsequence

Longest Palindromic Subsequence

Fibonacci using Dynamic Programming

Coin Change Problem

Edit Distance Problem

Maximum Sum of Continuous Subarray – 1

Wagner-Fischer Algorithm

Catalan Number using Dynamic Programming

Maximum Sum of Continuous Subarray – 2

Assembly Line Scheduling

Kadane’s Algorithm

Minimum Insertions to form a Palindrome

Longest Increasing Subsequence

Maximum Sum Rectangle in a 2D Matrix

Rod Cutting

Balanced Partition

Minimum Number of Jumps

0/1 Knapsack Problem

Dice Throw Problem

Matrix-chain Multiplication

Counting Boolean Parenthesizations

Cryptography

Subset Sum Problem

Hamming Code

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

Set Partition Problem

Hamiltonian Path Problem

Complexity Classes & NP Complete

First-in, First-out Algorithm (FIFO)

Optimal Page Replacement Algorithm