Interview Practice with Classic Coding Questions in TypeScript
This course focuses on classic coding questions commonly asked in technical interviews. You will practice implementing algorithms for problems such as searching in a matrix, rotating an array, and finding the longest common prefix. Master these algorithms to strengthen your coding skills and excel in technical interviews.
Lessons and practices
Check if a Matrix is a Toeplitz Matrix
Counting Integers Less than Target in a Sorted Matrix
Find Minimum and Maximum on the Secondary Diagonal of a Square Matrix
Find Row with Target in Sorted Matrix
Reverse Array In-Place Without Using Built-in Methods
Anti-clockwise Array Rotation in TypeScript
Shuffle Array by Moving Every k-th Element to End
Reverse Array in Groups
Rearrange Array to Move Middle Half to Front
Common Characters in Sequence
Longest Common Suffix
Repeated Substring Detection Task
Largest Common Prefix Finder
Efficient Longest Common Prefix Finder
Find the Most Common Substring
Merging Two Sorted Arrays
Remove Common Elements from Two Sorted Arrays
Merge Two Sorted Arrays in Descending Order with Unique Elements
Merge Sorted Arrays Without Using Built-in Sort Functions
Selection Sort Algorithm
Insertion Sort Algorithm Implementation
Merge Sort Implementation in TypeScript
QuickSort Algorithm Implementation in TypeScript
Interested in this course? Learn and practice with Cosmo!
Practice is how you turn knowledge into actual skills.