* Cantinho Satkeys

Refresh History
  • j.s.: dgtgtr a todos  49E09B4F
    18 de Janeiro de 2026, 16:02
  • FELISCUNHA: ghyt74   49E09B4F  e bom fim de semana  4tj97u<z
    17 de Janeiro de 2026, 11:18
  • JPratas: try65hytr Pessoal  2dgh8i k7y8j0 yu7gh8
    16 de Janeiro de 2026, 04:50
  • j.s.: try65hytr a todos  49E09B4F 49E09B4F
    15 de Janeiro de 2026, 19:29
  • FELISCUNHA: ghyt74  pessoal   49E09B4F
    15 de Janeiro de 2026, 11:51
  • j.s.: try65hytr a todos
    13 de Janeiro de 2026, 19:09
  • FELISCUNHA: ghyt74  pessoal  4tj97u<z
    13 de Janeiro de 2026, 10:48
  • cereal killa: 2dgh8i  1j6iv5
    12 de Janeiro de 2026, 20:15
  • cereal killa: try65hytr pessoal  2dgh8i  classic
    12 de Janeiro de 2026, 20:00
  • FELISCUNHA: dgtgtr   49E09B4F  e bom fim de semana  4tj97u<z
    10 de Janeiro de 2026, 12:21
  • asakzt: Managing database versions with Liquibase and Spring Boot
    10 de Janeiro de 2026, 11:35
  • tita: Musica Box Pop
    09 de Janeiro de 2026, 12:18
  • FELISCUNHA: ghyt74  pessoal   4tj97u<z
    08 de Janeiro de 2026, 11:01
  • j.s.: try65hytr a todos  49E09B4F
    07 de Janeiro de 2026, 20:37
  • TWT: Interaction Design Specialization
    07 de Janeiro de 2026, 07:38
  • FELISCUNHA: ghyt74  pessoal   4tj97u<z
    05 de Janeiro de 2026, 10:33
  • Alberto: The Alan Parsons Project
    05 de Janeiro de 2026, 05:29
  • Alberto: The Alan Parsons Project
    05 de Janeiro de 2026, 05:29
  • FELISCUNHA: dgtgtr   49E09B4F  e bom fim de semana  4tj97u<z
    03 de Janeiro de 2026, 12:26
  • JPratas: try65hytr Pessoal Continuação de
    02 de Janeiro de 2026, 19:42

Autor Tópico: Complete Algorithms Complexity and Big O Notation Course  (Lida 186 vezes)

0 Membros e 1 Visitante estão a ver este tópico.

Offline mitsumi

  • Sub-Administrador
  • ****
  • Mensagens: 129146
  • Karma: +0/-0
Complete Algorithms Complexity and Big O Notation Course
« em: 07 de Abril de 2021, 11:13 »

MP4 | Video: h264, 1280x720 | Audio: AAC, 44.1 KHz, 2 Ch
Genre: eLearning | Language: English + srt | Duration: 16 lectures (1h 57m) | Size: 582.2 MB
From beginner to professional in 2 hours!

What you'll learn:
Algorithm Time and Space Complexity Evaluation
Big O Notation
Interview Coding Tasks Review
Time Complexity Cases
Time Complexities Comparison
Mathematical Comparison of Functions
Typical Complexities Evaluation
log N Complexity
Strings and Complexity Evaluation
Recursive Algorithms Complexity
Amortized Analysis
Space Complexity

Requirements
Basic programming skills (you need to know how to write an "if-else" clause and a "for" loop)

Description
To develop effective code, each developer needs to know how to evaluate the complexity of the algorithms.

The course "Big O Notation. Algorithms Complexity Evaluation." in simple language explains the mathematics behind the complexity of algorithms, cases of complexity, the complexity of recursion, strings, amortized analysis and space complexity. In addition we solve 15 examples, some of which are found in interviews on Google, Facebook, Amazon.

We have reworked many books and articles to the most effective for perception and understanding form. As a result this course is independent by its nature and does not require studying of any additional materials. Basic programming skills is the only requirement to understand the course!

Important note: you can always pause the video and process into every aspect of the material in detail!

Who this course is for
Beginners who want to understand from scratch to professional what complexity evaluation is
Developers of any level who want to pass an interview at companies such as Google, Facebook, Apple
Developers who want to learn how to write effective code
Beginner developers curious about time complexity evaluation and Big O Notation


Download link:
Só visivel para registados e com resposta ao tópico.

Only visible to registered and with a reply to the topic.

Links are Interchangeable - No Password - Single Extraction