The Algorithms - TypeScript

The Algorithms - TypeScript is a repository containing various implementations of algorithms and data structures written in TypeScript. It is intended for demonstrative and educational purposes.

Note: These implementations are not intended for production use. For performance-critical or security-sensitive applications, use dedicated, optimized libraries instead. The project does not guarantee API stability.

The repository contains bit manipulation implementations including:

• Add Binary: Adds two binary numbers.
• Is Power Of 2: Checks if a number is a power of 2.
• Is Power Of 4: Checks if a number is a power of 4.
• Log Two: Calculates the base-2 logarithm.

The repository contains graph algorithm implementations including:

• Bellman Ford
• Bipartite Graph
• Dijkstra
• Floyd Warshall
• Johnson
• Kosajaru
• Kruskal
• Prim
• Tarjan

The repository contains backtracking implementations including:

• All Combinations Of Size K: Generates all possible combinations of a specific size.
• Generateparentheses: Generates all combinations of well-formed parentheses.

The repository contains cipher implementations including:

• Xor Cipher: An implementation of the XOR cipher.

The repository contains dynamic programming implementations including:

• Coin Change: Solves the coin change problem.
• Knapsack: Implements the knapsack problem.
• Lcs: Implements the Longest Common Subsequence algorithm.

The repository provides various data structure implementations categorized by type:

Disjoint Set

• Disjoint Set

Heap

• Heap

List

• Doubly Linked List
• Linked List
• Singly Linked List

Map

• Hash Map
• Map

Queue

• Array Queue
• Circular Queue
• Linked Queue
• Queue
• Stack Queue

Set

• Hash Map Set
• Map Set
• Set

Stack

• Linked List Stack
• Stack

Tree

• Binary Search Tree

Tries

• Tries

The repository provides several search algorithm implementations for finding elements within data structures:

• Binary Search
• Interpolation Search
• Jump Search
• Linear Search
• Sentinel Search

The repository contains a wide variety of mathematical algorithm implementations, including:

• Basic Arithmetic & Properties: Absolute Value, Aliquot Sum, Armstrong Number, Digit Sum, Factorial, Greatest Common Factor, Is Divisible, Is Even, Is Leap Year, Is Odd, Is Palindrome, Is Square Free, Lowest Common Multiple, Number Of Digits, Perfect Cube, Perfect Number, Perfect Square, Pronic Number, Signum, Square Root, and Ugly Numbers.
• Number Theory: Euler Totient, Prime Factorization, Primes, Sieve Of Eratosthenes, and Zellers Congruence.
• Sequences & Series: Fibonacci, Juggler Sequence, Pascals Triangle, and Hexagonal Numbers.
• Conversions & Geometry: Binary Convert, Degrees To Radians, Radians To Degrees, and Hamming Distance.
• Statistics & Linear Algebra: Calculate Mean, Calculate Median, Gaussian Elimination, and Matrix Multiplication.

The repository includes miscellaneous utility algorithms:

• Is Sorted Array: Checks if an array is sorted.
• Parse Nested Brackets: Parses nested bracket structures.
• Shuffle Array: Randomly shuffles the elements of an array.

The repository provides various sorting algorithm implementations:

• Comparison-based Sorts: Bogo Sort, Bubble Sort, Cycle Sort, Gnome Sort, Heap Sort, Insertion Sort, Merge Sort, Quick Sort, Selection Sort, Shell Sort, Swap Sort, and Tree Sort.
• Non-comparison Sorts: Counting Sort.
• Selection Algorithms: Quick Select.