Arrays
An array is the most primitive and frequently used data structure in the field of computer science. It has become the inspiration for several data structures such as lists and strings. An array is basically a collection of similar types of data items stored at contiguous memory locations. It helps us to store multiple items of the same data type together. They are also used to implement other data structures like Heaps, Stacks, Queues, etc. This category contains all of the information you need to know about arrays. Single Number
By Yogesh Bhalerao
● Published At Oct 2021
In this blog, we’ll learn to find a single number from an array of elements where every element appears twice except one.... Keep reading .. Sliding Window
By Ishita Chawla
● Published At Nov 2021
In this blog, we will be discussing the famous sliding window technique, how it is more efficient than the naive approach, and its time and space complexity.... Keep reading .. Find the Number Occurring Odd Number of Times
By Pranav Gautam
● Published At Oct 2021
Different ways to find a number with odd frequency in a group of numbers with even frequencies.... Keep reading .. Next Permutation
By Saksham Gupta
● Published At Oct 2021
In this blog, we&#39;ll be discussing different approaches for solving one of the classic interview problems, i.e., Next Permutation.... Keep reading ..
Introduction
An array is a data structure that combines several variables of the same type into a single variable. Instead of having separate variable names for each element, we can use arrays to group them all together into a single variable. This category contains all of the information you need to know about array fundamentals.
Basic Operations
In computer science, data is the most crucial aspect. To store and manipulate the data, we need a data structure. Arrays are the type of data stru
Searching Techniques
Storing data is important, but being able to retrieve it when needed is even more important. For that purpose, there are various searching technique
Sorting Techniques
Data structures are used to store data but usually, data is stored haphazardly. In such situations the need to sort the data arises. Sorting techniq
A sorting algorithm is used to arrange a given set of data into a specific order based on the comparison. Based on the comparisons, a new order of the elements is decided. There are plenty of sorting algorithms like merge sort, quick sort, and bubble sort, etc. Sorting is essential for optimizing the performance of other algorithms that require sorted input data. This category brings to you the various types of Sorting Algorithms along with their complexity analysis. Not only this, you can find common interview questions and diverse techniques for solving these problems.
Divide and Conquer
Divide and Conquer is an algorithm paradigm that is based on Recursion. A problem is broken down into a set of smaller subproblems repeatedly until no Smallest Index with Equal Value
By Husen Kagdi
● Published At Dec 2021
In this blog, we will discuss a Leetcode Easy problem, smallest index with equal value. This problem has been asked in the latest weekly contest organized by Leetcode. ... Keep reading ..
Application Based Problems
Data structures is a programmic way of storing data. Almost every application uses various types of data structures in one or the other way. Hence it is important to understand the application of data structures and how to implement them in real world scenarios. Doing application based problems helps us to understand the implementation of data structures and algorithms in different use cases.
Binary Search
Binary Search is a fast divide and conquer-based search algorithm with logarithmic run time complexity. It works on a sorted set of elements.The algor
Array Rotation
The first data structure introduced to us when we start programming is an array. Array Rotation means shifting the array elements to the left or right
Rearrangements
Rearrangements are all about changing the order of elements in an array or characters in strings. There are various problems which fall under this ca
Subarray and Subsequences
Subarrays and Subsequences are some of the key terms which are frequently used in problems involving data structures and algorithms. These are simila
Sorting
Sorting is the process of arranging data in a logical order to analyze it more effectively. Sorting has distinct meanings for different types of data.
Practice Problems
Sorting problems are commonly asked in programming competitions. It may be difficult for a newbie to solve these challenges at first. This section wil   