Getting Deep into Complex Algorithms for Interviews with JS
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
Determining if a Linked List is a Palindrome
Swap Nodes in Linked List by Indices
Remove Duplicates from Unsorted Linked List
Rotate Linked List Right by k Places
Detect Cycle in a Linked List
Postorder Traversal of a Binary Tree
Preorder Traversal of Binary Tree
Second Smallest Node in Binary Tree
Reverse a Binary Tree in JavaScript
Binary Search Tree Verification
Factorial Calculation Using Dynamic Programming
Dynamic Programming Climbing Stairs Task
Minimum Steps to Transform Number using Dynamic Programming
Coin Change Problem Using Dynamic Programming
Minimal Number of Perfect Squares
Breadth-First Search for Shortest Path in City Network
Find Vertices Within Given Distance in an Undirected Graph
Shortest Route Calculation Using Breadth-First Search Algorithm
Shortest Path in a Matrix Using BFS
Minimum Knight Moves on a Chessboard
Generating Unique Permutations of an Array
All Character Combinations in a String
Generating Parentheses Combinations
Letter Case Combinations of a String
Advanced Recursion Word Combinations
Interested in this course? Learn and practice with Cosmo!
Practice is how you turn knowledge into actual skills.