TypeScript Programming Reference. Sharpen your TypeScript sword working with String, Array, Sorting & Searching algorithms & more.
When writing TypeScript code, understanding strings, arrays, sorting, binary trees, etc are the bread and butter. In this article, I will cover my top and most used expressions when writing TS code.
By the end of this article you will be able to write code to handle; Palindrome, isogram, stable and unstable sorting algorithm, half-interval search, bubble sort, insertion sort, merge sort algorithm, quicksort algorithm, binary search algorithm, and more.
Why
There too many to list and yes, you could do a google search when you need these expressions, however having them all in one list that you can reference at any time, is useful and make sure your code is consistent.
That’s why I created a reference that I am using myself and sharing with you.
How can you sharpen your sword?
I broke down this article into four modules;
- String
- Array
- Sorting
- Searching
When it comes to TS you don’t need to run your code in your IDE, you can also use the TS playground —…
