Skip to content

Tag Archives: Data Structures

Given a binary valued undirected graph with V vertices and E edges, the task is to find the hexadecimal equivalents of all the connected components… Read More
Given a number N, the task is to find the Nth number which has an absolute difference of 1 between every pair of its adjacent… Read More
Prerequisite: CPU Scheduling in Operating Systems Different Scheduling Algorithms: First Come First Serve CPU Scheduling: Simplest scheduling algorithm that schedules according to arrival times of… Read More
Given an ancestor matrix mat[n][n] where the ancestor matrix is defined as below.  mat[i][j] = 1 if i is ancestor of j mat[i][j] = 0,… Read More
Given a queue. The task is to reverse the queue using another  empty queue. Examples:  Input: queue[] = {1, 2, 3, 4, 5} Output: 5… Read More
Pairing Heap is like a simplified form Fibonacci Heap. It also maintains the property of min heap which is parent value is less than its… Read More
Please see previous articles on Proto Van Emde Boas Tree to understand these properly.  Procedure for Insert:   Base Case: If the size of Proto-VEB is… Read More
Hackerrank Test (90 Minutes): They had eligibility criteria of 8 pointers. There were 2 coding questions (15 + 35 Marks) and 5 Computer Science questions… Read More
Prerequisite – Hashing Introduction, Hashtable using Singly Linked List & Implementing our Own Hash Table with Separate Chaining in Java Implementing hash table using Chaining… Read More
Which of the following Binary Min Heap operation has the highest time complexity? (A) Inserting an item under the assumption that the heap has capacity… Read More
Consider the following function to traverse a linked list.  C void traverse(struct Node *head) {    while (head->next != NULL)    {        printf(\"%d  \", head->data);        head =… Read More
Which of the following operations are used by Red-Black trees to maintain balance during insertion/deletion? a) Recoloring of nodes b) Rotation (Left and Right) (A)… Read More
Is the following statement valid? A Red-Black Tree which is also a perfect Binary Tree can have all black nodes (A) Yes (B) No Answer:… Read More
You are given pointers to first and last nodes of a singly linked list, which of the following operations are dependent on the length of… Read More

Start Your Coding Journey Now!