Algoritmos

Aprenda os fundamentos de Algoritmos, um pilar da ciência da computação e programação. Este Roteiro de Aprendizagem abrangente foi concebido para iniciantes e oferece um caminho claro para dominar a resolução de problemas algorítmicos. Os Cursos de Algoritmos incluídos cobrem tópicos essenciais como estruturas de dados, design de algoritmos e análise de complexidade. Através de exercícios práticos não-em-vídeo e desafios de codificação num ambiente interativo, os alunos desenvolvem habilidades de pensamento crítico e experiência prática na implementação de algoritmos eficientes.

79 Skills|1 Course

Início Rápido com Algoritmos

Python

Este curso oferece inúmeros desafios de codificação interativos para ajudá-lo a compreender e implementar algoritmos rapidamente. Os desafios foram projetados por Donne Martin e estão disponíveis no repositório GitHub donnemartin/interactive-coding-challenges.

Concluído 0 de 90 Labs

Arrays e Strings

Permutation Check of String Pairs

Solving the Two Sum Problem

Compress String Using Python

Implement Hash Table with Key-Value Operations

Find Differing Character in Strings

Implement Fizz Buzz in Python

String Compression Challenge

Reverse String In-Place Programming

Unique Character String Validation

Determine String Rotation in Computer Science

Efficient Array-Backed Priority Queue Implementation

Listas Encadeadas

Linked List Data Structure

Reverse Order Number Addition in Python

Partition Linked List Around Value

Deleting Middle Node in Python Linked List

Find Loop Start

Kth To Last Elem

Removing Duplicates in Linked Lists

Palindrome Detection in Linked Lists

Pilhas e Filas

Implementing Multiple Stacks Using Array

Sorting Stack Using Additional Stack

Set of Stacks

Implement O(1) Stack with Push, Pop, Min

Implementing Queue Using Linked List

Concise Introduction to Stacks

Queue From Stacks

Grafos e Árvores

Breadth-First Search Graph Traversal Algorithm

Graph Shortest Path

Depth-First Traversal of Binary Trees

Balanced Binary Tree in Python

Binary Tree Lowest Common Ancestor

Graph Data Structure Fundamentals

Trie Data Structure for String Storage

Bst Second Largest

Graph Build Order

Min Heap Binary Tree Introduction

Determine Binary Tree Height

Binary Search Tree In-Order Successor

Depth-First Search on Directed Graphs

Inverting Binary Tree Technique

Breadth-First Traversal Binary Tree

Minimal Height Binary Search Tree

Graph Shortest Path Unweighted

Graph Path Exists

Validating Binary Search Tree

Binary Search Tree Implementation in Python

Tree Level Lists

Ordenação e Busca

Rotated Array Search

Efficient Merge Sort Algorithm Implementation

Search Sorted Matrix

Efficient Quick Sort Algorithm

Sorting with Selection Algorithm

Merge Sorted Arrays into One

Missing Integer in Array

Anagram Sorting Array

Efficient Insertion Sort Algorithm

Radix Sort: Efficient Integer Sorting Algorithm

Recursão e Programação Dinâmica

Fibonacci Sequence Programming Tutorial

Max Profit K

Longest Inc Subseq

Solving the Towers of Hanoi Problem

Generating All Permutations of Input String

N Pairs Parentheses

Coin Change Ways

Longest Common Subsequence

Exploring Step Climbing with Python

Knapsack Problem Optimization Techniques

Coin Change Min

Generating Power Sets in Python

Unbounded Knapsack Optimization Problem

Longest Substr K Distinct

Optimizing 2x2 Matrix Multiplication

Identifying Magic Indexes in Arrays

Python Challenge: Longest Common Substring

Optimal Coin Change Solution

Robot Grid Path Planning

Matemática e Probabilidade

Primality Test in Python

Integers Manipulation Python

Subtracting Integers Without Arithmetic Operators

Efficient List Operations in Python

Generate Prime Numbers

Determine Power of Two in Python

Manipulação de Bits

Bit Manipulation Operations in Python

Efficient Bit Manipulation for Odd-Even Swap

Maximizing Longest Sequence of Ones

Bits To Flip

Insert M Into N

Find Next Largest Smallest Binary Numbers

Binary Representation of Real Numbers

Implementing Line Drawing Algorithm