Core Java Archives - Page 8 of 25

Trie(Prefix Tree)

A trie, also known as a prefix tree, is a tree-like data structure used to store an associative array where[…]

A priority queue is a special type of queue in which each element is associated with a priority and is[…]

The program first prints the original array, then it uses a LinkedHashSet to remove the duplicates. A LinkedHashSet is a[…]

This program creates a Queue class that has a fixed capacity, and uses an array to store the elements in[…]

This program creates a BinarySearchTree class that has a Node class as an inner class. The Node class has an[…]

DateTimeFormatter and SimpleDateFormat are both classes in Java that are used to format and parse dates and times. However, there[…]

Project Lombok is a Java library that can be used to reduce boilerplate code in Java applications. Lombok provides a[…]

This program uses a simple iterative approach to traverse through the array, maintaining two variables max1 and max2. It compares[…]

Semaphore restricts the number of threads that can concurrently access a shared resource. It allocates permits for allowing access to[…]

Stack follows LIFO ie., Last In First Out. In this data structure the elements are arranged in such a way[…]