Ace your Coding Interview
Get hired by top tech companies with our comprehensive interview preparation.
Get StartedThis article covers queue implementation using a linked list. A queue is a linear data structure that serves as a collection of elements, with three main operations: enqueue, dequeue and peek.
This article covers circular queue implementation in C. A queue is a linear data structure that serves as a collection of elements, with three main operations: Enqueue, Dequeue, and Peek.
In previous post, we have introduced the heap data structure and covered heapify-up, push, heapify-down and pop operations. This article covers C++ implementation of Priority Queue Data Structure (Max Heap and Min heap).
A priority queue is an ADT (Abstract Data Type) for maintaining a set S of elements, with each element having a “priority” associated with it. In a priority queue, an element with high priority is served before an element with low priority or vice versa.
In this post, linked list implementation of stack is covered. A stack is a linear data structure that serves as a collection of elements, with three main operations: push, pop, and peek.
This articles covers stack implementation in C. A stack is a linear data structure that serves as a collection of elements, with three main operations: push, pop and peek.
This post will discuss the difference between a subarray, a substring, a subsequence, and a subset.
This post describes the types of edges involved in Depth–first search (DFS) of a tree and directed & undirected graphs and establish the relation between them.
Given an undirected or a directed graph, implement the graph data structure in C++ without using STL. Implement for both weighted and unweighted graphs using the adjacency list representation.
In this post, we will see graph implementation in Java using Collections for weighted and unweighted, graph and digraph.
Given an undirected or a directed graph, implement a graph data structure in C++ using STL. Implement for both weighted and unweighted graphs using the adjacency list representation of the graph.
This post will cover graph data structure implementation in C using an adjacency list. The post will cover both weighted and unweighted implementation of directed and undirected graphs.