C# Courses
44 Free Interactive Courses
Browse every C# course on Coddy. Each course runs in your browser with AI-assisted hints, real exercises, and a certificate on completion.
Beginner Challenges - Practice Basic Concepts
PopularPut 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
Coding Problems
PopularPut 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
Stack - Data Structures Series #1
PopularIn 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!
- 13
- 6
- 1
AVL Tree - Data Structures Series #10
PopularIn 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!
Certificate on completion
- 16
- 6
- 1
Star Pattern Bootcamp
PopularPut 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.
- 30
- 28
Coding Problems: Volume 2
PopularPut 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
Hash Tables - Data Structures Series #4
PopularIn 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!
Certificate on completion
- 14
- 12
Linked List - Data Structures Series #5
PopularIn 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!
Certificate on completion
- 14
- 6
- 1
Interview Coding Challenges - Pack I
PopularAre you ready for your next coding interview? Test your knowledge and skills with these challenges and be prepared. Good luck!
- 3
- 3
Binary Tree - Data Structures Series #3
PopularIn 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!
- 13
- 5
- 1
Queue - Data Structures Series #2
PopularIn 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!
- 12
- 5
- 1
Prim's Algorithm - Graph Algorithms
PopularMaster 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.
Certificate on completion
- 9
- 3
- 1
- 55
Bubble Sort
PopularEverything About Bubble Sort
- 11
- 10
Graphs - Data Structures Series #9
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!
Certificate on completion
- 14
- 12
Mathematical Riddles
This course will provide ways of thinking and strategies for solving mathematical problems and puzzles using programming.
- 20
- 18
Topological Sort - Graph Algorithms
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.
Certificate on completion
- 9
- 3
- 1
- 55
Counting Sort - DSA Series
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.
Certificate on completion
- 9
- 3
- 1
- 52
Doubly Linked List - Data Structures Series #6
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!
Certificate on completion
- 14
- 6
- 1
Dijkstra's Algorithm - Graph Algorithms
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.
Certificate on completion
- 9
- 3
- 1
- 54
Merge Sort - DSA Series
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.
Certificate on completion
- 9
- 3
- 1
- 52
User Class - OOP Project
In this project, you will create a User Class and practice your object oriented programming skills in a programming language of your choice!
- 8
- 1
- 2
Interview Coding Challenges - Pack II
Are you ready for your next coding interview? Test your knowledge and skills with these challenges and be prepared. Good luck!
- 3
- 3
Recursion Challenges - Master The Recursive Thinking
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
Quick Sort - DSA Series
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.
Certificate on completion
- 9
- 3
- 1
- 52
Heaps & Priority Queues - Data Structures Series #7
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!
Certificate on completion
- 14
- 6
- 1
Interview Coding Challenges - X
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
- 3
- 3
Bellman-Ford Algorithm - Graph Algorithms
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.
Certificate on completion
- 9
- 3
- 1
- 54
Breadth-First Search - Graph Algorithms
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.
Certificate on completion
- 9
- 3
- 1
- 54
Heap Sort - DSA Series
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.
Certificate on completion
- 9
- 3
- 1
- 54
Selection Sort - DSA Series
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.
Certificate on completion
- 9
- 3
- 1
- 54
Tries - Data Structures Series #8
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!
Certificate on completion
- 14
- 12
Kruskal's Algorithm - Graph Algorithms
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.
Certificate on completion
- 9
- 3
- 1
- 57
Depth-First Search - Graph Algorithms
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.
Certificate on completion
- 9
- 3
- 1
- 54
Radix Sort - DSA Series
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.
Certificate on completion
- 9
- 3
- 1
- 55
Insertion Sort - DSA Series
Simple yet powerful algorithm. Learn how to efficiently arrange elements, understand time complexity, and enhance your sorting skills. Dive in now!
- 9
- 3
- 1
Interview Coding Challenges - Pack III
Are you ready for your next coding interview? Test your knowledge and skills with these challenges and be prepared. Good luck!
- 3
- 3
Basics of Classes and Objects in C#
In this course, you will learn about the basics of object oriented programming (OOP) in C#, the class and the object!
Certificate on completion
- 12
Strings and Arrays in C#
In this course, you will learn about strings and arrays in C# and will have a chance to practice your knowledge.
- 14
- 18
Interview Coding Challenges - Pack VII
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
- 3
- 3
Interview Coding Challenges - Pack IV
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!
- 3
- 3
Interview Coding Challenges - Pack IX
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
- 3
- 3
Interview Coding Challenges - Pack VIII
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
- 3
- 3
Interview Coding Challenges - Pack VI
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!
- 3
- 3
Interview Coding Challenges - Pack V
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!
- 3
- 3