# Let's Practice!

Implement a **library management system** in Java. A `Book` class has already been created with all the necessary fields, **setters, and getters**. You can review its implementation in the `Book` class.

Additionally, a `LibraryDemo` class has been provided to test all the methods in the `Library` class.

Create a `Library` class to manage a collection of books. Use an `ArrayList` to store instances of the `Book` class.

Implement the following methods in the `Library` class:

- `addBook(Book book)`: adds a book to the library;
- `removeBookById(int id)`: removes a book from the library based on the unique identifier;
- `findBooksByAuthor(String author)`: returns a list of books by the specified author;
- `findBooksPublishedAfterYear(int year)`: returns a list of books published after the specified year;
- `displayAllBooks()`: displays information about all the books in the library on the screen.

After that, you need to go to the `LibraryDemo` class and run it. It will **test the correctness of the methods** you implemented.

Learning how to work with GitHub assignments can be found
<a href="https://codefinity.com/courses/v2/07aa78fa-7b1d-47f7-825d-309a90d6680a/c17b66e2-3128-4a58-9ef4-0b18f13b19cb/da261f4e-2a1d-45c3-a7d1-4ca13093aa65" target="_blank"><svg width="1em" height="1em" viewBox="0 0 30 32" fill="none" xmlns="http://www.w3.org/2000/svg"><path fill="none" stroke="#098f67" style="stroke: var(--color1, #098f67)" stroke-linejoin="miter" stroke-linecap="round" stroke-miterlimit="4" stroke-width="2.4156" d="M17.289 17.305v0c-1.754 1.754-4.597 1.754-6.351 0l-7.76-7.759c-1.755-1.755-1.755-4.601 0-6.356v0c1.753-1.753 4.595-1.756 6.351-0.005l6.208 6.187"></path><path fill="none" stroke="#098f67" style="stroke: var(--color1, #098f67)" stroke-linejoin="miter" stroke-linecap="round" stroke-miterlimit="4" stroke-width="2.4156" d="M12.504 13.97v0c1.754-1.754 4.597-1.754 6.351 0l7.762 7.762c1.754 1.754 1.754 4.597 0 6.351v0c-1.754 1.754-4.597 1.754-6.351 0l-5.953-5.953"></path></svg> here</a>.

Instructions and tips on how to solve this task are outlined on **GitHub**.

If you're **having trouble** with solving and understanding the task, I suggest you think more carefully because programmers try to **solve problems independently**. It's the best way to learn.

But if you are stuck, you can see solutions for this task here. Don't forget to rewrite this solution for yourself and **analyze everything to master this topic** truly: 


Discover essential data structures in Java and enhance your programming skills. Explore the dynamic world of ArrayLists, LinkedLists, Stacks, Queues, and more, uncovering their power, versatility, and real-world applications.

Discover the concept of lists and explore the most commonly used types in Java. Learn how to create, modify, and manage lists efficiently. Understand their internal structure and discover when to use ArrayList vs. LinkedList based on performance. Implement your own singly linked list and reinforce key concepts through practical coding challenges.

Learn about data structures that are not as commonly used but are still valuable. Data structures like Set, Stack, Queue, and Deque will help you better understand how Java works and their various applications in databases.


Learn about key-value pair-based data retrieval, enabling the creation of structures similar to databases. Discovery of concepts like hashcode and exploration of data structures such as HashMap and HashSet are also included.

Learn to use enum for defining a fixed set of constants and explore the Stream API to process, filter, and transform data efficiently.


Java Data Structures

Challenge: Library Management System

Java Data Structures

Challenge: Library Management System