https://github.com/francedot/csharp-ds
A collection of Data Structures and Algorithms for preparing to coding interviews.
https://github.com/francedot/csharp-ds
algorithms csharp data-structures graph heap leetcode linked-list priority-queue tree trie union-find
Last synced: 4 months ago
JSON representation
A collection of Data Structures and Algorithms for preparing to coding interviews.
- Host: GitHub
- URL: https://github.com/francedot/csharp-ds
- Owner: francedot
- License: mit
- Created: 2020-09-13T19:53:24.000Z (over 4 years ago)
- Default Branch: master
- Last Pushed: 2021-10-23T14:53:00.000Z (over 3 years ago)
- Last Synced: 2024-12-29T07:04:40.946Z (4 months ago)
- Topics: algorithms, csharp, data-structures, graph, heap, leetcode, linked-list, priority-queue, tree, trie, union-find
- Language: C#
- Homepage:
- Size: 119 KB
- Stars: 17
- Watchers: 2
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# CSharp Data Structures & Algorithms
*It's not only the count of solved problems on LeetCode*
#### A collection of Data Structures and Algorithms for preparing to coding interviews.
# Data Structures
* [**Hash Set**](./src/CSharp.DS/HashSet/README.md)
* [**Linked List**](./src/CSharp.DS/LinkedList/README.md)
* [**Queue**](./src/CSharp.DS/Queue/README.md)
* [**Stack**](./src/CSharp.DS/Stack/README.md)
* [**Union Find (Disjoint Set)**](./src/CSharp.DS/UnionFind/README.md)
* [**Heap**](./src/CSharp.DS/Heap/README.md)
* [**Cache**](./src/CSharp.DS/Cache/README.md)
* [**Graph**](./src/CSharp.DS/Graph/README.md)
* [**N-ary Tree**](./src/CSharp.DS/Tree/N-ary/README.md)
* [**Binary Tree**](./src/CSharp.DS/Tree/Binary/README.md)
* [**Trie**](./src/CSharp.DS/Tree/Trie/README.md)
* [**Segment Tree**](./src/CSharp.DS/Tree/SegmentTree/README.md)
# Algorithms
* [**Backtracking**](./src/CSharp.Algo/Backtracking/README.md)
* [**Binary Search**](./src/CSharp.Algo/BinarySearch/README.md)
* [**Bits Manipulation**](./src/CSharp.Algo/BitsManipulation/README.md)
* [**Combinatorics**](./src/CSharp.Algo/Combinatorics/README.md)
* [**Design**](./src/CSharp.Algo/Design/README.md)
* [**Dynamic Programming**](./src/CSharp.Algo/DynamicProgramming/README.md)
* [**Games**](./src/CSharp.Algo/Games/README.md)
* [**Intervals**](./src/CSharp.Algo/Intervals/README.md)
* [**Math**](./src/CSharp.Algo/Math/README.md)
* [**Order Statistics**](./src/CSharp.Algo/OrderStatistics/README.md)
* [**Prefix/Suffix**](./src/CSharp.Algo/PrefixSuffix/README.md)
* [**Searching**](./src/CSharp.Algo/Searching/README.md)
* [**Sliding Window**](./src/CSharp.Algo/SlidingWindow/README.md)
* [**Sorting**](./src/CSharp.Algo/Sorting/README.md)
* [**Stack**](./src/CSharp.Algo/Stack/README.md)
* [**Strings**](./src/CSharp.Algo/Strings/README.md)
* [**Trie**](./src/CSharp.Algo/Trie/README.md)