Data Structures & Algorithms Using JavaScript

Book Description

This book is about the usage of data structures and algorithms in computer programming.

Designing an efficient algorithm to solve a computer science problem is a skill of Computer programmer. This is the skill which tech companies like Google, Amazon, Microsoft, Adobe and many others are looking for in an interview.

This book assumes that you are a JavaScript language developer. You are not an expert in JavaScript language, but you are well familiar with concepts of references, functions, arrays and recursion. In the start of this book, we will be revising the JavaScript language fundamentals that will be used throughout this book. We will be looking into some of the problems in arrays and recursion too.

Then in the coming chapter, we will be looking into complexity analysis. 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. We will be looking into sorting, searching techniques.

Then we will be looking into algorithm analysis, we will be looking into brute force algorithms, greedy algorithms, divide and conquer algorithms, dynamic programming, reduction, and backtracking.

In the end, we will be looking into the system design that 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: Introduction – Programming Overview
Chapter 2: Algorithms Analysis
Chapter 3: Approach To Solve Algorithm Design Problems
Chapter 4: Abstract Data Type & Javascript Collections
Chapter 5: Searching
Chapter 6: Sorting
Chapter 7: Linked List
Chapter 8: Stack
Chapter 9: Queue
Chapter 10: Tree
Chapter 11: Priority Queue
Chapter 12: Hash-Table
Chapter 13: Graphs
Chapter 14: String Algorithms
Chapter 15: Algorithm Design Techniques
Chapter 16: Brute Force Algorithm
Chapter 17: Greedy Algorithm
Chapter 18: Divide-And-Conquer, Decrease-And-Conquer
Chapter 19: Dynamic Programming
Chapter 20: Backtracking And Branch-And-Bound
Chapter 21: Complexity Theory And Np Completeness
Chapter 22: Interview Strategy
Chapter 23: System Design

中文：

书名：Data Structures & Algorithms Using JavaScript

这本书是关于数据结构和算法在计算机编程中的使用。

设计有效的算法来解决计算机科学问题是计算机程序员的一项技能。这是谷歌、亚马逊、微软、Adobe和其他许多科技公司在面试中寻找的技能。

本书假定您是一名JavaScript语言开发人员。您不是JavaScript语言方面的专家，但您非常熟悉引用、函数、数组和递归的概念。在本书的开头，我们将复习在本书中将使用的JavaScript语言基础。我们还将研究数组和递归中的一些问题。

然后在下一章中，我们将研究复杂性分析。然后将研究各种数据结构及其算法。我们将研究链表、堆栈、队列、树、堆、哈希表和图形。我们将研究排序、搜索技术。

然后我们将研究算法分析，我们将研究蛮力算法、贪婪算法、分而治之算法、动态规划、归约和回溯。

最后，我们将研究系统设计，为解决面试中的设计问题提供系统的方法。

目录表

Chapter 0: How To Use This Book
第1章：简介&编程概述
Chapter 2: Algorithms Analysis
第三章：解决算法设计问题的方法
第4章：抽象数据类型和Java脚本集合
第5章：搜索
第六章：分类
第7章：链表
第8章：堆栈
第9章：排队
第十章：树
第11章：优先级队列
第12章：哈希表
Chapter 13: Graphs
Chapter 14: String Algorithms
Chapter 15: Algorithm Design Techniques
Chapter 16: Brute Force Algorithm
Chapter 17: Greedy Algorithm
第十八章：分而治之、减少与征服
Chapter 19: Dynamic Programming
Chapter 20: Backtracking And Branch-And-Bound
Chapter 21: Complexity Theory And Np Completeness
Chapter 22: Interview Strategy
第23章：系统设计