# C#
To run the `.cs` file, kindly use [.Net Finddle](https://dotnetfiddle.net/)

## Arrays
- [Single Number](src/Arrays/single-number.cs)

## Dynamic Programming
- [Longest Common Subsequence](src/Dynamic-Programming/longest-common-subsequence.cs)

## Number Theory
- [Big Mod Algorithm](src/Number-Theory/big-mod.cs)
- [Sieve of Eratosthenes](src/Number-Theory/sieve-of-eratosthenes.cs)
- [Bitwise Sieve of Eratosthenes](src/Number-Theory/bitwise-sieve-of-eratosthenes.cs)

## Sorts
- [Bubble Sort](src/Sorts/bubble-sort.cs)
- [Insertion Sort](src/Sorts/insertion-sort.cs)
- [Selection Sort](src/Sorts/selection-sort.cs)
- [Counting Sort](src/Sorts/counting-sort.cs)
- [Merge Sort](src/Sorts/merge-sort.cs)

## Strings
- [Palindrome](src/Strings/palindrome.cs)
- [Trie](src/Strings/trie.cs)
- [Character Limit](src/Strings/character-limit.cs)

## Search
- [Binary Search](src/Search/binary-search.cs)
- [Linear Search](src/Search/linear-search.cs)
- [Minima Maxima](src/Search/minima-maxima.cs)

## Maths
- [Abundant Number](src/Maths/abundant-number.cs)
- [Naismith's Rule](src/Maths/naismith-rule.cs)

## Queues
- [Queue Implementation Using Two Stacks](src/Queues/queue-implementation-using-two-stacks.cs)

## Recursion
- [Factorial](src/Recursion/factorial.cs)

## Graph
- [Breadth First Search](src/Graph/breadth-first-search.cs)
- [Depth First Search](src/Graph/depth-first-search.cs)
- [Kruskals Algorithm to Find Minimum Spanning Tree](src/Graph/kruskals-algorithm.cs)
- [Dijkstras Algorithm to Find Shortest Path](src/Graph/dijkstra.cs)
- [Floyd Warshalls Algorithm to Find All Pair Shortest Path](src/Graph/floyd-warshall-algorithm.cs)