Problem Solving in Data Structures & Algorithms Using Java: Programming Interview Guide

Problem Solving in Data Structures & Algorithms Using Java: Programming Interview Guide

<b>"Problem Solving in Data Structures & Algorithms"</b> 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 <b>interview preparation</b> point of view. In various books, the examples are solved in various languages like Go, C, C++, Java, C#, Python, VB, JavaScript and PHP.<br /><br /><br /><br /><br /><br /><b>GitHub Repositories</b><br /><br />https://github.com/Hemant-Jain-Author<br /><br /><br /><br /><br /><b>Book’s Composition</b><br /><br />This book is designed for interviews so in Chapter 0, various preparation plans are proposed. <br />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.<br /><br /><br />Then in the coming chapter, we will be looking into complexity analysis. Then we will be looking into Sorting & Searching techniques.<br /><br /><br />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. <br /><br /><br />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.<br /><br /><br />In the end, we will be looking into System Design, which will give a systematic approach for solving the design problems in an Interview.<br /><br /><br /><br /><b>Table of Contents</b><br /><br />Chapter 0: How to use this book.<br /><br />Chapter 1: Introduction - Programming Overview<br /><br />Chapter 2: Algorithms Analysis<br /><br />Chapter 3: Approach to solve algorithm design problems<br /><br />Chapter 4: Abstract Data Type<br /><br />Chapter 5: Searching<br /><br />Chapter 6: Sorting<br /><br />Chapter 7: Linked List<br /><br />Chapter 8: Stack<br /><br />Chapter 9: Queue<br /><br />Chapter 10: Tree<br /><br />Chapter 11: Priority Queue<br /><br />Chapter 12: Hash-Table<br /><br />Chapter 13: Graphs<br /><br />Chapter 14: String Algorithms<br /><br />Chapter 15: Algorithm Design Techniques<br /><br />Chapter 16: Brute Force Algorithm<br /><br />Chapter 17: Greedy Algorithm<br /><br />Chapter 18: Divide & Conquer<br /><br />Chapter 19: Dynamic Programming<br /><br />Chapter 20: Backtracking<br /><br />Chapter 21: Complexity Theory<br /><br />Chapter 22: Interview Strategy<br /><br />Chapter 23: System Design<br />