An array is a collection of items stored at contiguous memory locations. The idea is to store multiple items of the same type together.
Idea of Dynmaic Array : One limitation of arrays is that they're fixed size, meaning you need to specify the number of elements your array will hold ahead of time. A dynamic array expands as you add more elements. So you don't need to determine the size ahead of time.
A linked list is a dynamic data structure. The number of nodes in a list is not fixed and can grow and shrink on demand. Any application which has to deal with an unknown number of objects will need to use a linked list. Linked Lists that addresses some of the limitations of arrays. Types of linked lists : singly linked list, doubly linked list and Circular Linked Lists
| # | Title | Solution | Difficulty | Companies |
|---|---|---|---|---|
1. | Linear Data Structure | |||
2. | Arrays and its Basic Operations (Insert, Delete and Search) | |||
3. | Dynamic Arrays and Amortized Analysis | |||
4. | Structure and Properties of Linked List | |||
5. | Singly, Doubly, and Circular Linked Lists | |||
6. | Basic Operations on Linked-list : Traverse, Insert, Delete and Search | |||
7. | Example 1 : Reverse linked list | EASY | Microsoft Amazon | |
8. | Example 2 : Middle of the Linked List | EASY | ||
9. | Example 3 : Odd even linked List | MEDIUM | ||
10. | Example 4 : Remove Duplicates from Sorted List | MEDIUM | Microsoft VMWare | |
11. | Example 5 : Sort List - Merge Sort | HARD | Amazon Google | |
12. | Comparison : Array vs Linked List |