Computer Programming
205 learners
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.
C#
5 lessons
25 practices
3 hours
Computer Science Fundamentals
Lessons and practices
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
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
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
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
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
Meet Cosmo:
The smartest AI guide in the universe
Our built-in AI guide and tutor, Cosmo, prompts you with challenges that are built just for you and unblocks you when you get stuck.
Join the 1M+ learners on CodeSignal
Be a part of our community of 1M+ users who develop and demonstrate their skills on CodeSignal
