srsandy / data-structures-and-algorithms-in-java-2nd-edition-by-robert-lafore

Solutions of Data Structures and Algorithms in Java 2nd Edition by Robert Lafore. Adding practice problems and solutions.

DSA-in-JAVA

Data Structures and Algorithms in Java

 

Solutions of Data Structures & Algorithms in Java 2nd Edition by Robert Lafore Buy here

Other Practice Problems : here

Java Methods that can help you code quicker and better: here (Open for contributions and corrections)

Index

• Chapter-02: Arrays

  • LowArray
  • HighArray
  • OrderedArray
  • Programming Practice 2.1 2.2 2.3 2.4 2.5 2.6

• Chapter-03: Simple Sorting

  • Bubble Sort
  • Insertion Sort
  • Selection Sort
  • Programming Practice 3.1 3.2 3.3 3.4 3.5 3.6

• Chapter-04: Stack and Queue

  • Stack
  • Reversing a Word
  • Delimiter Matching
  • Queue
  • Circular Queue
  • Deque
  • Priority Queues
  • Infix to Postfix
  • Programming Practice 4.1 4.2 4.3 4.4 4.5

• Chapter-05: Linked List

  • Linked List
  • Double-Ended List
  • Sorted List
  • Doubly Linked List
  • Reverse DoubleLinkedList
  • Programming Practice 5.1 5.2 5.3 5.4 5.5 5.6

• Chapter-06: Recursion

  • Anagrams
  • BinarySearch
  • Factorial
  • Mergesort
  • Tower of Hanoni
  • Triangular Number
  • Knapsack
  • Programming Practice 6.1 [6.2] 6.3 6.4 [6.5]

• Chapter-07: Advance Sorting

  • Shell Sort
  • Partition Array
  • Quick Sort
  • Programming Practice 7.1

• Chapter-08: Binary Trees

  • Binary Tree Implementation

You like it ?

• Don't forget to Start and Watch the repo

Contributing

Feel free to contribute .. 😄

1. Fork it!
2. Commit.
3. Push.
4. Submit a pull request 🙂

Requests, Improvements, Issues

If you found a mistake, or want improvemenents are needed feel free to submit a new issue.

data-structures-and-algorithms-in-java-2nd-edition-by-robert-lafore's Issues

Solve Programming practices of Chapter 7 (Advance Sorting)

Pls make a new Folder name Chapter-7 add all the solutions and update the Readme.md.

Combinations: Picking a Team (Java Implementation)

Add java file Chapter-6 folder

Implement a recursive approach to showing all the teams that can be created from a group (n things taken k at a time). Write the recursive showTeams() method and a main() method to prompt the user for the group size and the team size to provide arguments for showTeam(), which then displays all the possible combinations.

Refer pdf book inside the repo Pg no. 306,307, 315(6.5)

Solve Programming practices of Chapter 8 (Binary Trees)

Do not use java.util or java.io packages.
Pls make a new Folder name Chapter-7 add all the solutions and update the Readme.md.

Chapter 04: CircularQueue.java

The mentioned file needs to be re-written. There is no concept of overflow in Circular Queue as it wraps up. What I mean is:
Test Driver Code:
public static void main(String[] agrs) {
CircularQueue q = new CircularQueue(5);
q.insert(10);
q.insert(20);
q.insert(30);
q.insert(40);
q.display();
q.insert(50);
q.display();
q.insert(60);
q.insert(70);
q.display();
q.delete();
q.display();

            q.delete();
            q.display();

            q.delete();
            q.display();

            q.delete();
            q.delete();
            q.display();

            q.insert(60);
            q.insert(70);
            q.insert(80);
            q.display();
            q.delete();
            q.display();

    }

Should produce output:
$ java CircularQueue
10 20 30 40
10 20 30 40 50 //First five elements
60 70 30 40 50 //Enqueue of 60 and 70
70 30 40 50 //Dequeue
30 40 50 //Dequeue
40 50
//Two Dequeue
60 70 80 //Enqueue of 60 70 80
70 80 //Dequeue

Solve Java Questions.

Check the repository

You can find the book here

Go to any unsolved chapter solve it's Programming Projects.

Keep .java file in the correct folder and update the ReadMe.md accordingly.

Add a PR 😄 and be a contributor to this repository.

Avoid

Collection Classes (Implement everything by your own)

Solve any one of the Programming practice in JAVA(Book inside repo) add it in inside a folder of its chapter.

Thanks for the help
Also update the changes in readMe.md

Solve Programming practices of Chapter 8 (Binary Trees)

Do not use java.util or java.io packages.
Pls make a new Folder name Chapter-7 add all the solutions and update the Readme.md.

The Knapsack Problem (JAVA implementation)

Add java file Chapter-6 folder

Write a program that solves the knapsack problem for an arbitrary knapsack capacity and series of weights. Assume the weights are stored in an array. Hint: The arguments to the recursive knapsack() function are the target weight and the array index where the remaining items start.

Your Code must follow the algorithm given on page no. 305 of the pdf book which is inside the book.

Add competitive coding problems and solutions in JAVA

Add a PR with any competitive coding problem
In

• /Practice Problems/ add competitive coding problems and solutions in the respective topic folder

Check other folders in Arrays how it is done in rest of file

E.g

• Add a folder in Arrays folder with the Name of Problem Title.
• Inside that folder add the solution ProblemTitle.java and a README.md
• Make sure the class name is ProblemTitle that is the name of the file.
• README.md must contain a detail description of the problem with the test cases.

Add competitive coding problems and solutions in JAVA

Add a PR with any competitive coding problem
In

• /Practice Problems/ add competitive coding problems and solutions in the respective topic folder

Check other folders in Arrays how it is done in rest of file

E.g

• Add a folder in Arrays folder with the Name of Problem Title.
• Inside that folder add the solution ProblemTitle.java and a README.md
• README.md must contain a detail description of the problem.

Bugger in 3.6

It is better to write the if statement as "if(a[in - 1] == temp && a[in - 1] != -1) "
otherwise, it could cause an incorrect result for nCopies.