Introduction We know that in Java, most of the things revolve around “Objects and Classes.” The objects and classes have various kinds of relationships that help us design software applications. The multiple relationships that exist in Java are based on ...
Introduction An array is a collection of elements of similar data types. We can have an array of integers or characters or structures etc. In this blog, we are going to learn about the circular right rotation of an array. ...
Introduction Object-Oriented Programming or OOPs refers to a programming paradigm that organises software design around real-world objects. Inheritance, abstraction, polymorphism, and other real-world concepts are all part of OOP. The basic goal of OOP is to connect data and functions. ...
Introduction A. J. Perlis and C. Thornton proposed a new version of a binary tree called “Threaded Binary Tree” that uses NULL pointers to improve its traversal process. In a threaded binary tree, NULL pointers are replaced by references of ...
Introduction Linked lists are one of the frequently asked data structures in interviews. Some of the questions on the linked list asked in product-based companies like Amazon, Microsoft are Detect And Remove Cycle, Merge two sorted linked lists, etc. This ...
Introduction Problems related to mathematical expressions are found in abundance in almost every coding contest. Balanced parentheses, Infix, postfix, and prefix conversions are some of them. One such problem is checking whether the given mathematical expression contains redundant parenthesis. A ...
Introduction Let’s take a real-life example for overloading and overriding methods in object-oriented programming concepts. Assume you are supposed just to perform the function of talking. Say, you have to tell the story of your day to a total stranger. ...
Introduction What comes to your mind when you first hear the word Inheritance? Doesn’t it remind you of how someone at a family gathering said that you inherited your mother’s eyes or father’s hair? Well, that’s what inheritance is, even ...
Introduction A doubly-linked list is a data structure that consists of sequentially linked records which are called nodes. A node contains two fields, called links, that refer to the previous and the next node in the sequence of nodes. The ...
Introduction A linked list is a linear data structure that consists of nodes. Each Node contains a data field and a pointer to the next Node. In Linked List, unlike arrays, elements are not stored at contiguous memory locations but ...
