This repository contains common concepts and algorithms used in code interviews
The purpose of this is to provide an extensive and descriptive approach for others to use when learning these topics
Each implementation will be fully commented to detail what is happening at each stage of processing
The table below is a reflection of what is currently implemented in this repository
| Category | Algorithm/ Concept | Implemented |
|---|---|---|
| Sorting | Bubble sort | Y |
| Sorting | Insertion sort | Y |
| Sorting | Merge sort | Y |
| Sorting | Quick sort | Y |
| Sorting | Heap sort | N |
| Sorting | Selection sort | Y |
| Searching | Linear search | Y |
| Searching | Binary search | Y |
| Data structures | Linked list | Y |
| Data structures | Stack (Array and Linked List) | N |
| Data structures | Queue (Array and Linked List) | N |
| Data structures | Hash Table | N |
| Data structures | Tree | N |
| Data structures | Graph | N |
| Other | Recursion | Y |
| Other | Bit manipulation | N |