R Courses

Put your beginner coding knowledge to test and try to solve this programming challenges, use any language you want, Happy Coding!

Certificate on completion

• 20
• 20

Put your programming problem solving skills to the test using the exercises with different difficulties in this course. Designed for coders with some prior knowledge of the basic syntax in any programming language.

Certificate on completion

• 32
• 31

In this course, you will learn about the Stack data structure, create a Stack from zero using your preferred language, and practice coding challenges with it!

Put your programming problem solving skills to the test using the exercises with different difficulties in this course. Designed for coders with some prior knowledge of the basic syntax in any programming language. This course is an extension of the first Coding Problems

Certificate on completion

• 25
• 24

In this course, you will learn about the Hash Table data structure, create a Hash Table from zero using your preferred language, and practice coding challenges with it!

Data Structures

Certificate on completion

• 14
• 12

In this course, you will learn about the Linked List data structure, create a Linked List from zero using your preferred language, and practice coding challenges with it!

Data Structures

Certificate on completion

• 14
• 6
• 1

In this course, you will learn about the Binary Tree data structure, create a Binary Tree from zero using your preferred language, and practice coding challenges with it!

In this course, you will learn about the Heap data structure (the backbone of priority queues), create a MinHeap from zero using your preferred language, and practice coding challenges with it!

Data Structures

Certificate on completion

• 14
• 6
• 1

In this course, you will learn about the Doubly Linked List data structure, create a Doubly Linked List from zero using your preferred language, and practice coding challenges with it!

Data Structures

Certificate on completion

• 14
• 6
• 1

In this course, you will learn about the Queue data structure, create a Queue from zero using your preferred language, and practice coding challenges with it!

Recursion is an important concept in computer science and a very powerful tool in writing algorithms. In this course, you will use recursion to solve challenges from beginner to advanced. In the end, you will ace this topic.

Certificate on completion

• 15
• 15

Put your programming problem solving skills to learn how to print star patterns range from simple to complex, involving different levels of nested loops, conditional statements, and mathematical calculations.

Are you ready for your next coding interview? Test your knowledge and skills with these challenges and be prepared for your next interview, Happy Coding

In this project, you will create a User Class and practice your object oriented programming skills in a programming language of your choice!

In this course you will create text based playing cards generator using your favorite language, Happy Coding!

Are you ready for your next coding interview? Test your knowledge and skills with these challenges and be prepared. Good luck!

Everything About Bubble Sort

This course will provide ways of thinking and strategies for solving mathematical problems and puzzles using programming.

In this course, you will learn about the Graph data structure, create an undirected graph from zero in your preferred language, and practice coding challenges with it!

Data Structures

Certificate on completion

• 14
• 12

In this course, you will learn about the Trie (prefix tree), create one from zero in your preferred language, and practice coding challenges with it!

Data Structures

Certificate on completion

• 14
• 12

Master Quick Sort, one of the fastest sorting algorithms in practice. Build the partition step, write the full recursive sort in your language of choice, analyze its complexity, and practice with coding challenges.

Data Structures

Certificate on completion

• 9
• 3
• 1
• 52

Master Selection Sort, one of the simplest sorting algorithms. See how it works step by step, build it from scratch in your language of choice, analyze its complexity, and practice with coding challenges.

Data Structures

Certificate on completion

• 9
• 3
• 1
• 54

Master Prim's Algorithm for Minimum Spanning Trees: grow one tree from a start vertex by always adding the cheapest crossing edge. Build it in your language of choice and answer bottleneck-edge and connectivity queries, the counterpart to Kruskal.

Graph Algorithms Courses

Certificate on completion

• 9
• 3
• 1
• 55

Master Counting Sort, a non-comparison algorithm that sorts non-negative integers in linear time by tallying values. Build the counting phase, write the full sort in your language of choice, analyze its O(n + k) complexity, and practice with coding challenges.

Data Structures

Certificate on completion

• 9
• 3
• 1
• 52

Master Merge Sort, the classic divide and conquer algorithm. Build the merge step, write the full recursive sort in your language of choice, analyze its O(n log n) complexity, and practice with coding challenges.

Data Structures

Certificate on completion

• 9
• 3
• 1
• 52

Simple yet powerful algorithm. Learn how to efficiently arrange elements, understand time complexity, and enhance your sorting skills. Dive in now!

Are you ready for your next coding interview? Test your knowledge and skills with these challenges and be prepared for your next interview, Happy Coding

Are you ready for your next coding interview? Test your knowledge and skills with these challenges and be prepared. Good luck!

Master Kruskal's Algorithm for Minimum Spanning Trees. Build union-find, grow an MST by adding the cheapest cycle-free edge in your language of choice, and answer connectivity and bottleneck-edge queries.

Graph Algorithms Courses

Certificate on completion

• 9
• 3
• 1
• 57

Master Depth-First Search, a fundamental way to explore a graph. Build the adjacency lookup, write an iterative DFS in your language of choice, analyze its O(V + E) complexity, and use it to count and measure connected components.

Graph Algorithms Courses

Certificate on completion

• 9
• 3
• 1
• 54

Master Heap Sort, the array-based binary heap turned into a sorting algorithm. Build the sift-down step, write the full sort in your language of choice, analyze its O(n log n) time and O(1) space, and practice with coding challenges.

Data Structures

Certificate on completion

• 9
• 3
• 1
• 54

Are you ready for your next coding interview? Test your knowledge and skills with these challenges and be prepared for your next interview, Happy Coding

Are you ready for your next coding interview? Test your knowledge and skills with these challenges and be prepared for your next interview, Happy Coding

Are you ready for your next coding interview? Test your knowledge and skills with these challenges and be prepared, did you finished the last packs? Happy Coding!

Are you ready for your next coding interview? Test your knowledge and skills with these challenges and be prepared. Good luck!

Master the Bellman-Ford algorithm: single-source shortest paths that work with negative edge weights, plus negative-cycle detection. Build a relaxation pass, the full algorithm in your language of choice, and answer distance and cycle queries.

Graph Algorithms Courses

Certificate on completion

• 9
• 3
• 1
• 54

Master Dijkstra's Algorithm, the greedy single-source shortest-path method for graphs with non-negative weights. Read weighted edges, build the full distance computation in your language of choice, and answer point-to-point and farthest-vertex queries.

Graph Algorithms Courses

Certificate on completion

• 9
• 3
• 1
• 54

Master Radix Sort, a non-comparison algorithm that sorts non-negative integers digit by digit. Build the stable counting-sort pass, write the full sort in your language of choice, analyze its linear-time behavior, and practice with coding challenges.

Data Structures

Certificate on completion

• 9
• 3
• 1
• 55

Learn how to efficiently manipulate and transform data using R's built-in functions, base packages and supported packages. Topics include subsetting, merging, reshaping, and aggregating data.

Certificate on completion

• 14
• 42

In this course, you will learn about the AVL Tree data structure, build a self-balancing binary search tree from zero in your preferred language, and practice coding challenges with it!

Data Structures

Certificate on completion

• 16
• 6
• 1

Master Topological Sort, the ordering of a directed acyclic graph so every edge points forward. Compute in-degrees, build an order with Kahn's algorithm in your language of choice, detect cycles, and find the longest path in a DAG.

Graph Algorithms Courses

Certificate on completion

• 9
• 3
• 1
• 55

Master Breadth-First Search, the layer-by-layer graph traversal behind shortest paths. Build the neighbor lookup, write an iterative BFS with a queue in your language of choice, and use it to find shortest-path distances in unweighted graphs.

Graph Algorithms Courses

Certificate on completion

• 9
• 3
• 1
• 54

Are you ready for your next coding interview? Test your knowledge and skills with these challenges and be prepared for your next interview, Happy Coding!

Are you ready for your next coding interview? Test your knowledge and skills with these challenges and be prepared, did you finished the last packs? Happy Coding!