Computer Programming
66 learners
Getting Deep into Complex Algorithms for Interviews with TS
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.
TypeScript
5 lessons
25 practices
3 hours
General Programming and Algorithms
Lessons and practices
Check if a Linked List is a Palindrome
Swapping Nodes in a Singly Linked List
Remove Duplicates from Unsorted Linked List
Rotate Linked List Right by k Places
Cycle Detection in Linked List
Postorder Traversal of Binary Tree
Preorder Traversal of a Binary Tree in TypeScript
Second Smallest Value in Binary Tree
Reverse a Binary Tree in TypeScript
Check if a Binary Tree is a Binary Search Tree
Factorial Calculation Using Dynamic Programming in TypeScript
Climbing Stairs Problem
Minimum Steps to Transform Number
Distinct Coin Change Combinations
Minimal Number of Perfect Squares
Shortest Path in a Network of Cities
Find Vertices Within Distance in a Graph
Shortest Route with Obstacles Using BFS in TypeScript
Shortest Path in a Binary Matrix Using BFS
Knight's Shortest Path on a Chessboard
Generate Distinct Permutations Using Recursion in TypeScript
All String Combinations in TypeScript
Generate All Combinations of Parentheses
Letter Case Combinations in a String
Word Combinations Game
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
