This coursework is designed for you to get a solid understanding of data structures and algorithms. This coursework assumes that you have knowledge in coding, but it does not assume that you have knowledge around LinkedLists, Binary Trees, Sorting algorithms or related. Therefore, it is designed to build up your skills in these topics from level zero.
- Each exercise could take you up to 1 hours. Total duration estimation is 30 hours.
- These solutions are written in Python 3 (the only Python version that should be used) and in Go, but you will be able (and strongly advised) to use your language of preference if you ever decide to go for an interview.
| Domain | Challenge | Solution | |||
|---|---|---|---|---|---|
| Python | Go | ||||
| Data Structures | A Very Big Sum | AVeryBigSum.py | AVeryBigSum.go | ||
| Data Structures | Design PDFViewer | DesignPDFViewer.py | DesignPDFViewer.go | ||
| Data Structures | Left Rotation of an array | LeftRotation.py | LeftRotation.go | ||
| Data Structures | Sparse Arrays | SparseArrays.py | SparseArrays.go | ||
| Data Structures | Insert Node at a given position in a Linked List | InsertListNode.py | InsertListNode.go | ||
| Data Structures | A Linked List has a Cycle | HasCycleList.py | - | ||
| Stacks and Queues | Balanced Brackets | BalancedBrackets.py | BalancedBrackets.go | ||
| Stacks and Queues | Queue using two Stacks | QueueTwoStacks.py | QueueTwoStacks.go | ||
| Hash and Maps | Ice Cream Parlor | IceCreamParlor.py | - | ||
| Sorting Algorithms | Insertion Sort | InsertionSort.py | InsertionSort.go | ||
| Sorting Algorithms | Quick Sort | QuickSort.py | QuickSort.go | ||