External: Coursera Courses ↗ · Coursera

Open Course on External: Coursera

Free to audit · Opens on External: Coursera

Algorithms, Part I

Coursera · Intermediate ·⚡ Algorithms & Data Structures ·4mo ago

Skills: Algorithm Basics90%

Key Takeaways

Covers algorithms and data structures with Java implementations

Original Description

This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Part I covers elementary data structures, sorting, and searching algorithms. Part II focuses on graph- and string-processing algorithms. All the features of this course are available for free. People who are interested in digging deeper into the content may wish to obtain the textbook Algorithms, Fourth Edition (upon which the course is based) or visit the website algs4.cs.princeton.edu for a wealth of additional material. This course does not offer a certificate upon completion.

Watch on External: Coursera ↗ (saves to browser)

AI explanation not available for this lesson yet

This lesson is still being prepared for the AI tutor. In the meantime, explore lessons that are ready.

Browse explainer-ready lessons →

More on: Algorithm Basics

View skill →

Middle of the Linked List - Leetcode 876 - Python

Middle of the Linked List - Leetcode 876 - Python

Interval Scheduling Greedy Algorithm: Python

Interval Scheduling Greedy Algorithm: Python

Aladdin Persson

Shortest Distance After Road Addition Queries I - Leetcode 3243 - Python

Shortest Distance After Road Addition Queries I - Leetcode 3243 - Python

Algorithms: Solve 'Recursive Staircase' Using Recursion

Algorithms: Solve 'Recursive Staircase' Using Recursion

Advanced Data Structures in Java

Advanced Data Structures in Java

Binary Search Tree Code

Binary Search Tree Code

Related Reads

DSA Patterns That Actually Make You Think #5 — Two Pointers: Solving Two Problems with One Pass

Learn to solve two problems with one pass using the two pointers technique in DSA patterns

Medium · Programming

10 Graph Algorithms in 10 Minutes

Learn 10 basic graph algorithms in a short introduction with examples and visualizations

Medium · Data Science

Selection Sort Explained With a Bookshelf Story (With Code)

Learn how selection sort works using a relatable bookshelf analogy and implement it with code

Dev.to · Krunal Kanojiya

LeetCode Journal # 1

Improve coding skills by practicing LeetCode problems daily, starting with problem 1512

Dev.to · Fatima Qaisar

Find the Median in a Data Stream (Two Heaps Trick)