Advanced Data Structure

580+ posts

Last Updated: 05 December 2022

Problem Statement: The problem is to design a Chess Game using Object Oriented Principles.Asked In: Adobe, Amazon, Microsoft, etc.Solution: ...read more

Algorithms

Advanced Data Structure

Java-Object Oriented

Design Pattern

Object-Oriented-Design

Marketing

System Design

DSA

How to write a Pseudo Code?

Last Updated: 23 November 2023

Pseudo code is a term which is often used in programming and algorithm based fields. It is a methodology that allows the programmer to repre...read more

Algorithms

Advanced Data Structure

Understanding Time Complexity with Simple Examples

Last Updated: 22 April 2024

A lot of students get confused while understanding the concept of time complexity, but in this article, we will explain it with a very simpl ...read more

time complexity

Algorithms

Analysis of Algorithms

Advanced Data Structure

DSA

Similar Topics

DSA

22.1k+ articles

Arrays

6.4k+ articles

Strings

3.2k+ articles

C++ Programs

2.5k+ articles

Competitive Programming

2.2k+ articles

Algorithms

2k+ articles

Tree

1.4k+ articles

Data Structures

1.1k+ articles

array-range-queries

360+ articles

Segment-Tree

140+ articles

std::count() in C++ STL

Last Updated: 26 February 2023

std::count() returns the number of occurrences of an element in a given range. Returns the number of elements in the range [first, last) tha ...read more

Advanced Data Structure

Competitive Programming

STL

C++

cpp-algorithm-library

DSA

Disjoint Set Data Structures

Last Updated: 22 September 2023

A disjoint-set data structure is defined as one that keeps track of a set of elements partitioned into a number of disjoint (non-overlapping ...read more

Advanced Data Structure

union-find

DSA

Binary Indexed Tree or Fenwick Tree

Last Updated: 23 March 2023

Let us consider the following problem to understand Binary Indexed Tree.We have an array arr[0 . . . n-1]. We would like to1 Compute the sum...read more

Tree

Advanced Data Structure

Insertion in Red-Black Tree

Last Updated: 12 December 2023

In the previous post, we discussed the introduction to Red-Black Trees. In this post, insertion is discussed. In AVL tree insertion, we used...read more

Binary Search Tree

Advanced Data Structure

Self-Balancing-BST

Red Black Tree

DSA

Introduction to Red-Black Tree

Last Updated: 20 May 2024

Binary search trees are a fundamental data structure, but their performance can suffer if the tree becomes unbalanced. Red Black Trees are a...read more

Advanced Data Structure

Insert Operation in B-Tree

Last Updated: 19 March 2024

In the previous post, we introduced B-Tree. We also discussed search() and traverse() functions. In this post, insert() operation is discus...read more

Advanced Data Structure

Introduction of B-Tree

Last Updated: 28 December 2023

The limitations of traditional binary search trees can be frustrating. Meet the B-Tree, the multi-talented data structure that can handle ma...read more

Advanced Data Structure

Segment Tree | Sum of given range

Last Updated: 09 March 2023

Let us consider the following problem to understand Segment Trees.We have an array arr[0 . . . n-1]. We should be able toFind the sum of ele...read more

Advanced Data Structure

Segment-Tree

array-range-queries

DSA

Complete Tutorial on LRU Cache with Implementations

Last Updated: 29 March 2024

What is LRU Cache?Cache replacement algorithms are efficiently designed to replace the cache when the space is full. The Least Recently Used...read more

Advanced Data Structure

Deletion in an AVL Tree

Last Updated: 18 January 2023

We have discussed AVL insertion in the previous post. In this post, we will follow a similar approach for deletion.Steps to follow for delet...read more

Advanced Data Structure

AVL-Tree

Self-Balancing-BST

DSA

Insertion in an AVL Tree

Last Updated: 03 October 2023

AVL Tree:AVL tree is a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees cannot be mor...read more

Advanced Data Structure

AVL-Tree

Self-Balancing-BST

DSA

Trie Data Structure | Insert and Search

Last Updated: 07 June 2024

The Trie data structure is a tree-like data structure used for storing a dynamic set of strings. It is commonly used for efficient retrieval...read more

Advanced Data Structure

1 2 3 4 5 6 7 8 >>

1 2 3 4 5 6 >>

1 2 3 4 >>