DynamicProgramming Repo - contains handy algorithms, spanning from travelling salesman to async-semaphoreSlim
- Asynchronous ArrayPool Implementation
- ArrayPool Singleton Design
- Asynchronous Aggregate Exceptions
- Async Delegate Implementation
- Custom Collection Implementation
- Deadlock Control via Locks
- Default Interface Implementation
- Effective Async Load with SemaphoreSlim
- Enum HasFlag Method Implementation
- Enum ToString via Switch & nameof()
- Equality Comparison Benchmark
- EqualityComparer.Default.Equals() Benchmark
- Extern Unmanaged Heap Allocation
- Fibonacci via Memoization
- Fibonacci via Span & stackalloc
- Find Min-Max via Tuples
- Foreach Extensions via Tuples
- Function Pointer delegate*<T,T>
- Has Duplicate? via HasSet
- IAsyncDisposable, IDisposable Implementation
- IDisposable with SafeHandle Implementation
- Implicit Operator for Math.Pow(2,3) -> 2^3 = 8
- Job Sequencing & Deadline
- JsonSerializer, All Subjects
- Kestrel WebHostBuilder HTTP/2 Setting
- Knapsack
- Knuth - Morris - Prat
- Longest Common Subsequence
- Magic Square - Odd Size
- Marshalling - Reverse Benchmark
- Marshalling - String Implementation
- Module Initializer & Static Constructor Alternative
- MonitorTryEnter via Lock
- NQueen Problem In Detail
- Operator Overloading Full Implementation
- Parallel Aggregation Technique
- Parallel Factorial Calculation
- Parallel Letter Frequency
- Parallel Prima Numbers
- Pointer Chunk
- Rabin & Karp String Matching
- Record Protected Constructor
- Record Overriding Equals
- Shallow & Deep Copy
- Subset Sum Max
- Travelling Salesman
- Value Equality , Class -> Record Implementation
- ValueTask Benchmark -1_000_000 call-