Data Structures & Algorithms In Go

Data Structures & Algorithms books by Hemant Jain is a 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 these books, the examples are solved in various languages like Go, C, C++, Java, C#, Python, VB, JavaScript and PHP.


GitHub Repositories for these books.
https: //github.com/Hemant-Jain-Author

Book's Composition
This book introduces you to the world of data structures and algorithms. Data structures defines the way in which data is arranged in memory for fast and efficient access while algorithms are a set of instruction to solve problems by manipulating these data structures.

Designing an efficient algorithm is a very important skill that all software companies, e.g. Microsoft, Google, Facebook etc. pursues. Most of the interviews for these companies are focused on knowledge of data-structures and algorithms. They look for how candidates use concepts of data structures and algorithms to solve complex problems efficiently. Apart from knowing, a programming language you also need to have good command of these key computer fundamentals to not only qualify the interview but also excel in you jobs as a software engineer.

This book assumes that you are a C language developer. You are not an expert in C language, but you are well familiar with concepts of classes, functions, arrays, pointers and recursion. At the start of this book, we will be looking into Complexity Analysis followed by the various data structures and their algorithms. We will be looking into a Linked-List, Stack, Queue, Trees, Heap, Hash-Table and Graphs. We will also be looking into Sorting, Searching techniques.

In last few chapters, we will be looking into various algorithmic techniques. Such as, Brute-Force algorithms, Greedy algorithms, Divide and Conquer algorithms, Dynamic Programming, Reduction and Backtracking. .


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 & C# Collections
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

《Hemant Jain 的資料結構與演算法書籍》是一系列關於在電腦程式設計中使用資料結構和演算法的書籍。這本書易於理解，並以面試準備為觀點撰寫。在這些書籍中，範例以多種語言解決，包括 Go、C、C++、Java、C#、Python、VB、JavaScript 和 PHP。

這些書籍的 GitHub 存儲庫網址為：https://github.com/Hemant-Jain-Author

書籍結構：
本書將帶您進入資料結構和演算法的世界。資料結構定義了將資料安排在記憶體中以實現快速和高效存取的方式，而演算法則是一組指令，通過操作這些資料結構來解決問題。

設計高效演算法是所有軟體公司（如 Microsoft、Google、Facebook 等）追求的一項非常重要的技能。這些公司的大部分面試都集中在對資料結構和演算法的知識上。他們關注候選人如何使用資料結構和演算法的概念來高效解決複雜問題。除了熟悉一種程式語言外，您還需要對這些關鍵的計算機基礎知識有良好的掌握，不僅能通過面試，還能在軟體工程師的工作中表現出色。

本書假設您是一位 C 語言開發者。您不是 C 語言的專家，但對類、函式、陣列、指標和遞迴的概念非常熟悉。在本書的開始部分，我們將介紹複雜度分析，然後介紹各種資料結構及其演算法。我們將介紹鏈結串列、堆疊、佇列、樹、堆積、雜湊表和圖。我們還將介紹排序和搜尋技術。

在最後幾章中，我們將介紹各種演算法技巧，例如暴力演算法、貪婪演算法、分治演算法、動態規劃、歸納和回溯。

目錄：
第 0 章：如何使用本書
第 1 章：演算法分析
第 2 章：解決演算法設計問題的方法
第 3 章：抽象資料型別和 C# 集合
第 4 章：搜尋
第 5 章：排序
第 6 章：鏈結串列
第 7 章：堆疊
第 8 章：佇列
第 9 章：樹
第 10 章：優先佇列
第 11 章：雜湊表
第 12 章：圖
第 13 章：字串演算法
第 14 章：演算法設計技巧
第 15 章：暴力演算法
第 16 章：貪婪演算法
第 17 章：分治演算法
第 18 章：動態規劃
第 19 章：回溯
第 20 章：複雜度理論