The Vector class has been a part of the Java collection system since Java version 1.2. Vectors are sometimes known as Dynamic Arrays because, unlike ordinary arrays, they can expand and contract in size. Ensuring thread-safety, Vectors are synchronized. While there exists a third approach that involves using Apache Commons to iterate through the vector in reverse, this method necessitates the downloading of additional jar files and packages, which is not widely supported by most systems. Essentially, there are only two primary methods to traverse through vector elements in reverse order. Methods Used There are two methods used here − ... Read More
The Reflection API in Java allows you to dynamically call any method using its string name. When using the java.lang.reflect API, you can load classes by name even if they aren't accessible at compile time thanks to reflection's robust mechanism. It empowers you to dynamically invoke any method using reflection and makes it possible you to retrieve all methods from a class, including private and public ones. Those who are unfamiliar with Java might find this idea strange. With no explicit code for calling the method during compilation, Java can execute a method when its name is provided as a ... Read More
(Key, Value) pairs are used to store data in Java HashMap collections. Although it is unsynchronized, it is comparable to HashTable. As a result, a HashMap can be accessed by numerous threads without encountering any troubles. Despite the fact that HashMap allows for the storage of null keys as well, there can most effective be one null key object and an infinite wide variety of null values. regarding the order of the map, this class gives no guarantees. To index the value, the key is utilised. We can store unique keys with HashMap. If we try to insert one, the ... Read More
A data structure known as a 2D list or list of lists can be utilised for saving a collection of data in a two-dimensional format. A row in the 2D list is represented by each inner list in this list of lists. A 2D list could be utilised, for instance, to store the data for a chessboard, where every component in the list corresponds to a single square on the board. Methods Used A 2D list can be iterated in one of the two methods that follow − Using Loops Using iterator Method 1: Employing Loops There are ... Read More
The LinkedHashMap serves the purpose of maintaining the precise order of element addition. It elucidates the method for accessing elements in the sequence they were inserted. In addition to storing values based on their keys, the LinkedHashMap class expands upon the functionalities of the Hash Map class and implements the Map interface. It exclusively accommodates unique elements or mappings. It affords us the flexibility to utilize various data types, such as text, float, integer, etc., for assigning keys and values. By initially reversing the elements, we can alter the order of elements in the linked hash map. Subsequently, we can ... Read More
A trie is a data structure like tree that is used to store and search a dynamic set of strings. It is useful while working with the data where keys share common prefix like dictionary words. Trie is different from the other retrieval data structures owing to its efficient string manipulation and retrieval properties. In this article we will learn to implement Trie data structure in Go programming language. Explanation The Trie, also known as a retrieval tree is a type of tree data structure that is commonly used for storing and managing collections of strings. It offers access, to ... Read More
Floyd's Triangle is a right-angled triangular pattern of numbers, named after the renowned American computer scientist Robert W. Floyd. Using sequences of natural integers starting at 1 and increasing by 1 in each row, we build this triangle. In this article, we are going to implement Floyd's Triangle in go, implementation here means we are going to create floyd's triangle and then print it. Explanation Floyd's Triangle, much like Pascal's Triangle, is a triangular arrangement of the natural numbers with a right angle. There is progression of numbers from left to right across the table, starting at 1 in each ... Read More
Roman numerals are an ancient numerical system that has found its way into modern applications like clock faces, book chapters, and movie credits. In this article, we are going to Convert Decimal to Roman Numerals. We will look at two different examples, in the first example we will use the recursive approach and in the second example we are going to use the iterative approach. Explanation Roman numerals have been one of the languages to express the marvel of Mathematics. Clock faces, book chapters, and movie credits are just some of the current uses for the old Roman number system. ... Read More
Temperature conversions are crucial in many scientific expeditions, Fahrenheit is a scale of temperature and celsius is also a temperature scale, but sometimes we need to convert fahrenheit to celsius for medical settings, travels, and more. In this article, we are going to explore conversion of Fahrenheit temperature to corresponding Celsius in Go programming language. Explanation The basic idea can be distilled into the given formula. Here, °C represents value in Celsius and °F represents value in Fahrenheit. °C = (°F - 32) * 5/9 This is the formula used to convert fahrenheit to celsius. Syntax ... Read More
Fibonacci numbers have a unique position in mathematics, computer science and even nature for its particular mathematical qualities. Each number in this series represents the addition of the 2 previous ones, starting at 0 and 1. In this article, we are going to explore an approach to find the Nth Fibonacci number to go efficiently. We will explain two examples in the first example we used the recursive approach as it is easy to implement and fast for moderate values of n, but may be slow for large inputs. In the second example we are going to use the ... Read More