Data Structures and Algorithms Using Swift

“Data Structures & Algorithms using Swift” is a part of series of books about the usage of Data Structures and Algorithms in computer programming. The book is easy to follow and is written for
interview preparation point of view. In various books, the examples are solved in various languages like Go, C, C++, Java, C#, Python, Swift, Ruby, VB, JavaScript and PHP.

GitHub Repositories

https: //github.com/Hemant-Jain-Author

Book’s Composition

This book is designed for interviews so in Chapter 0, various preparation plans are proposed. Then in chapters 1, a brief introduction of the programming language and concept of recursion is explained. A number of problems based on recursion and array are explained.

Then in the coming chapter, we will be looking into complexity analysis. Then we will be looking into Sorting & Searching techniques.

Then will look into the various data structures and their algorithms. We will be looking into a Linked List, Stack, Queue, Trees, Heap, Hash Table and Graphs.

Then we will be looking into algorithm analysis, we will be looking into Brute Force algorithms, Greedy algorithms, Divide & Conquer algorithms, Dynamic Programming, and Backtracking.

In the end, we will be looking into System Design, which will give a systematic approach for solving the design problems in an Interview.

Table of Contents

Chapter 0: How to use this book.

Chapter 1: Algorithms Analysis

Chapter 2: Approach to solve algorithm design problems

Chapter 3: Abstract Data Type

Chapter 4: Searching

Chapter 5: Sorting

Chapter 6: Linked List

Chapter 7: Stack

Chapter 8: Queue

Chapter 9: Tree

Chapter 10: Priority Queue

Chapter 11: Hash-Table

Chapter 12: Graphs

Chapter 13: String Algorithms

Chapter 14: Algorithm Design Techniques

Chapter 15: Brute Force Algorithm

Chapter 16: Greedy Algorithm

Chapter 17: Divide & Conquer

Chapter 18: Dynamic Programming

Chapter 19: Backtracking

Chapter 20: Complexity Theory

Chapter 21: Interview Strategy