Data structures allow you to organize code in the most efficient way to help you perform operations effectively. An algorithm is a step-by-step procedure for solving problems, be it solving a computer problem, writing source code, or innovating new programs. With this course, you’ll learn the concepts of data structures and algorithms using JavaScript.
Starting with an introduction to data structures and algorithms, the course takes you through the concept of arrays, where you’ll solve a minesweeper challenge to understand the importance of an array in data structures. Next, you’ll become familiar with lists and discover how Big O helps in describing the complexity of an algorithm. As you advance, you’ll gain insights into stacks, queues, recursion, and trees by solving challenges such as condense, Josephus, palindrome, and Morse code. Toward the end, you’ll get an overview of hash maps and graphs.
By the end of this course, you’ll have developed a solid understanding of data structures and algorithms essential for building reliable software.
The code files are added on the GitHub repository at https://github.com/PacktPublishing/Data-Structures-in-JavaScript-Master…
Distinguish between arrays and lists
Implement list push, grow, remove, and insert
Understand the Big O time-space asymptotic analysis
Find out when to use stacks and trees
Discover the applications of trees in data structure and algorithm
Handle collisions with hash maps