✅ This sign for complete all properties and methods for the class.
✔️ This sign for new features in C# 12
Welcome to the DSA in CSharp repository! This project is dedicated to providing comprehensive resources and code examples for mastering Data Structures and Algorithms (DSA) using C# 12 and .NET 8.
- Comprehensive Coverage: Includes all major data structures and algorithms.
- Modern C#: Utilizes the latest features of C# 12 and .NET 8.
- Practical Examples: Real-world examples to help you understand and implement DSA concepts.
- Interview Preparation: Essential for cracking coding interviews and coding rounds.
- Introduction
- Basic Data Structures
- Advanced Data Structures
- Algorithms
- Additional Topics
- C# Specific Collections
- Pointers in C#
- Contributing
- License
This repository aims to be a one-stop resource for learning and mastering Data Structures and Algorithms in C#. Whether you're preparing for interviews or looking to enhance your coding skills, you'll find valuable content here.
- Arrays
- ArrayList
- List
- Strings
- Pointers
- Linked Lists
- Stacks
- Queues
- Trees
- Heaps
- Graphs
- Hashing
- Sorting Algorithms
- Searching Algorithms
- Dynamic Programming
- Greedy Algorithms
- Backtracking
- Divide and Conquer
- Bit Manipulation
- Mathematical Algorithms
- String Algorithms
- Geometric Algorithms
- Randomized Algorithms
- Generic Collections
- Non-Generic Collections
- Concurrent Collections
- Immutable Collections
- Declaration and Initialization
- Dereferencing and Address-of Operators
- Pointer Arithmetic
- Unsafe Code Blocks
- Fixed Statement for Pinning Objects
| Data Structure | Description | Complexity (Average) |
|---|---|---|
| Array | Collection of elements | O(1) for access |
| Linked List | Sequence of nodes | O(n) for access |
| Stack | LIFO (Last In, First Out) structure | O(1) for push/pop |
| Queue | FIFO (First In, First Out) structure | O(1) for enqueue/dequeue |
| Tree | Hierarchical structure | O(log n) for search |
| Graph | Set of nodes connected by edges | O(V+E) for traversal |
| Hash Table | Key-value pairs | O(1) for search |
We welcome contributions! Please read our Contributing Guidelines for more details.
This project is licensed under the Siksha 'O' University, IIT Bombay License - see the LICENSE file for details.
!Happy Coding 🚀