PYTHON Beginner 무료 트랙 ~18 시간 +350 XP 보상

Python Algorithms & Problem Solving Fundamentals Fundamental Algoritma & Pemecahan Masalah Python

Build rock-solid algorithmic problem-solving intuition with step-by-step visualizations, time complexity breakdowns, and practical coding challenges in Python 3. Bangun intuisi pemecahan masalah algoritmik yang kokoh dengan visualisasi bertahap, analisis kompleksitas waktu, dan tantangan coding terstruktur di Python 3.

코스 강의 계획서 및 모듈실라부스 & 모듈 쿠르수스

Module 1: Complexity, Arrays & Two-Pointer Strategies Modul 1: Kompleksitas, Array & Strategi Two-Pointer

Time/space complexity, Big-O intuition, two-pointer techniques, and recursion fundamentals. Kompleksitas waktu/ruang, intuisi Big-O, teknik two-pointer, dan dasar rekursi.

4 수업펠라하라

1.1 Time & Space Complexity: Big-O Intuition 1.1 Kompleksitas Waktu & Ruang: Intuisi Notasi Big-O

Theory 15 분

1.2 Two-Sum Sorted Array Challenge 1.2 Tantangan Two-Sum pada Array Terurut

Interactive code 20 분

1.3 Recursion Fundamentals & Call Stack Tracing 1.3 Fundamental Rekursi & Pelacakan Call Stack

Theory 15 분

1.4 Palindrome & Anagram Verifier Challenge 1.4 Tantangan Verifikator Palindrom & Anagram

Interactive code 20 분

Module 2: Sorting, Searching & Classic Data Structures Modul 2: Pengurutan, Pencarian & Struktur Data Klasik

Binary search, comparison sorts, stacks, queues, and dictionary hash lookups. Binary search, perbandingan sorting MergeSort/QuickSort, stack, queue, dan hash map.

3 수업펠라하라

2.1 Binary Search & Logarithmic Partitioning 2.1 Binary Search & Partisi Logaritmik

Theory 15 분

2.2 Sorting Algorithms: QuickSort vs MergeSort 2.2 Algoritma Pengurutan: QuickSort vs MergeSort

Theory 15 분

2.3 Stacks, Queues & Hash Maps in Problem Solving 2.3 Stack, Queue & Hash Map dalam Pemecahan Masalah

Theory 15 분

Module 3: Algorithm & Data Structure Cloud Labs Modul 3: Lab Cloud Algoritma & Struktur Data

Building custom stack parsers, binary search engines, merge sort counters, and LRU caches. Membangun parser stack, binary search matriks 2D, penghitung inversi merge sort, dan cache LRU.

5 수업펠라하라

3.1 Custom Stack & Valid Parentheses Parser Lab 3.1 Lab Parser Tanda Kurung Valid Berbasis Stack

Lab 60 분 고립된 연구실

3.2 Binary Search Matrix Lookup Engine Lab 3.2 Lab Engine Pencarian Binary Search Matriks 2D

Lab 60 분 고립된 연구실

3.3 MergeSort Inversion Counter Lab 3.3 Lab Penghitung Inversi MergeSort

Lab 60 분 고립된 연구실

3.4 LRU Cache Simulator Lab 3.4 Lab Simulator Cache LRU (Least Recently Used)

Lab 60 분 고립된 연구실

3.5 Graph Breadth-First Search (BFS) Shortest Path Lab 3.5 Lab Jalur Terpendek Breadth-First Search (BFS) Graf

Lab 60 분 고립된 연구실