Keep Coding Keep Cheering!
What is Bubble Sort? When neighboring components are arranged incorrectly, the straightforward comparison-based sorting algorithm known as Bubble Sort continuously swaps them. Its name refers to the way that items advance across the list while sorting, much like soda bubbles do in a glass. Algorithm: The algorithm works as follows: Starting from the first element, […]
April 26, 2023 | Data Structure | No comments
What is Sorting in DSA? Sorting is a fundamental function in data structures and computer science. It is the process of organizing the contents of an array or list in a specific order in data structures and algorithms. There are various sorting algorithms that are regularly used in computer science, and the choice of method […]
April 25, 2023 | Data Structure | No comments
What is Modular Arithmetic in DSA? Modular arithmetic is an arithmetic structure for integers, in which numbers “wrap around” when they reach a certain magnitude. Many areas of mathematics and computer science use modular arithmetic, including number theory, combinatorics, coding theory, and error-correcting codes. It is also utilized in algorithm design and analysis, notably in […]
April 23, 2023 | Data Structure | No comments
In the previous topic, we got an introduction to Bit Manipulation in DSA. Let us now look at some examples using bit manipulation. Given two integers x and y, return the Hamming distance between them: Note: The Hamming distance between two integers is defined as the number of points where the corresponding bits differ. i.e, Input: x = 1, y = […]
April 18, 2023 | Data Structure | No comments
What is the Sliding Window Technique? The Window Sliding Technique is a technique for reducing the time complexity of algorithms using nested loops. We can avoid nested loops and obtain greater performance by traversing the array with a single loop and sliding a window over it. Use of Sliding Window Technique for 2D Arrays: A […]
April 17, 2023 | Data Structure | No comments
What is a 2D Array? A 2D matrix is a two-dimensional array that contains rows and columns in data structures and methods. It is also known as a two-dimensional array. A matrix can be represented in code as a 2D array, where each element of the array is itself an array, and each row of […]
April 15, 2023 | Data Structure | No comments
What is a SubArray? A subarray is a sequence of elements within an array that is contiguous. In other words, a subarray is a section of an array that contains consecutive elements in the same sequence as the original array. Subarrays can range in length from a single element (also considered a subarray) to the […]
April 12, 2023 | Data Structure | No comments
What is Carry Forward? The word “carry forward” does not refer to a specific idea in data structures and algorithms. However, “carry forward” in the context of arrays often refers to the process of relocating entries in an array to fill in empty spaces left by deleted or removed elements. This is also referred to […]
April 12, 2023 | Data Structure | No comments
A group of related data elements stored at adjacent memory locations is referred to as an array. One of the most basic data structures, it allows for random access to each data element by its index number. Properties of an Array: Arrays contain a number of crucial characteristics that make them helpful in a wide […]
April 9, 2023 | Data Structure | No comments
Singly Linked List Singly Linked List is a linear and connected data structure made of Nodes. Each node is composed of a variable data where its content (actual value) is stored and a pointer to the next Node (next node location) on the list. The Linked List has a pointer to the first element of this Node […]
March 27, 2022 | Data Structure | No comments