Problem Solving in Data Structures & Algorithms Using Java

by Hemant Jain

Mr. Hemant Jain has worked as a Software Architect at O9 Solutions India. He has over 15 years of experience as a Software Engineer, prior to O9 Solutions he had worked with Adobe Systems India Pvt. Ltd. Noida, Microsoft India R&D Pvt. Ltd. Hyderabad and other software companies. He holds a degree of B.Tech (Honors) in information technology from Indian Institute of Information Technology- Allahabad.

Mr. Hemant Jain had authored various books on "Data Structures & Algorithms".
These books are recommended as text book for relevant courses in many institutes A&M University Central Texas USA.Dublin Technological University Ireland.Lincoln University UK.Bebe's-Bolyai University Romania.Al-Zautoonah University of Jordan.Institute of Graduate Studies & Research Alexandria University, Egypt.Savitribai Phule University Pune, India.IK Gujral Punjab Technical University, India.Mandsaur University, Madhya Pradesh, India.Mahatma Gandhi University, Kottayam, India.CHRIST (Deemed to be University), Pune Lavasa, India.Bharati Vidyapeeth Deemed To Be University,Pune, India.
About The This textbook provides in depth coverage of various Data Structures and Algorithms.Concepts are discussed in easy to understand manner.Large number of diagrams are provided to grasp concepts easily.Time and Space complexities of various algorithms are discussed.Helpful for interviews preparation and competitive coding. Large number of interview questions are solved.Java solutions are provided with input and output.Guide you through how to solve new problems in programming interview of various software companies.
GitHub Repositories for these books.


Table of Contents
Chapter 0: About this book.
Chapter 1: Algorithms Analysis
Chapter 2: Approach to solve algorithm design problems
Chapter 3: Abstract Data Type & Java 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

587 pages, Kindle Edition

Published October 31, 2022