Getting Deep into Complex Algorithms for Interviews with C#

In this course, you'll delve deeply into algorithms and data structures, which are key topics in technical interviews. You'll tackle problems involving linked lists, binary trees, dynamic programming, and graph algorithms. Understanding these advanced topics will equip you with the tools needed to solve complex problems efficiently.

Lessons and practices

Lesson 1: Linked List Operations in C#

Palindrome Linked List Task

Swapping Nodes in a Singly Linked List

Remove Duplicates from Linked List

Rotate a Linked List to the Right by K Places

Detect Cycle in a Linked List

Lesson 2: Binary Tree Traversals in C#

Binary Tree Postorder Traversal Implementation Task

Preorder Traversal of a Binary Tree in C#

Find the Second Smallest Value in a Binary Tree

Reverse the Binary Tree in C#

Is Binary Search Tree Validation

Lesson 3: Dynamic Programming Basics in C#

Factorial Calculation Using Dynamic Programming

Climbing Stairs Using Dynamic Programming

Minimum Steps to Reach a Number Using Dynamic Programming

Coin Change Problem

Finding Minimal Number of Perfect Squares

Lesson 4: Graph Algorithms Implementation in C#

Shortest Path in a City Network Using BFS

Finding Vertices Within a Given Distance Using BFS

Shortest Route Using BFS Algorithm

Shortest Path in a Matrix Using BFS

Chess Knight Minimum Moves Calculation

Lesson 5: Advanced Recursion Techniques in C#

Generate Distinct Permutations Using Backtracking

Generate All Character Combinations Recursively in C#

Generate Valid Parentheses Combinations Using Recursion

Letter Case Permutations Task

Word Combinations Using Recursion

Interested in this course? Learn and practice with Cosmo!

Practice is how you turn knowledge into actual skills.