## Linked List representation of Disjoint Set Data Structures

Prerequisites : Union Find (or Disjoint Set), Disjoint Set Data Structures (Java Implementation) A disjoint-set data structure maintains a collection S = {S1, S2,…., Sk}… Read More »

## MakeMyTrip Interview Experience | Set 14 (For Senior Android developer)

Senior Android developer(4-8 years) Qualification & Experience- · 4-8 years of experience in software development · Experience in Mobile App development in Android is a… Read More »

## Remove every k-th node of the linked list

Given a singly linked list, Your task is to remove every K-th node of the linked list. Assume that K is always less than or… Read More »

## Vmware Interview Experience | Set 9 (Internship (R&D))

Vmware conducted their online exam via hirepro. Round 1 : There were 3 sections quants, Technical questions and OOPs based questions, no section had negative… Read More »

## Partitioning a linked list around a given value and If we don’t care about making the elements of the list “stable”

Given a linked list and a value x, partition a linked list around a value x, such that all nodes less than x come before… Read More »

## Remove all occurrences of duplicates from a sorted Linked List

Given a sorted linked list, delete all nodes that have duplicate numbers (all occurrences), leaving only numbers that appear once in the original list. Examples:… Read More »

## Intuit Interview Experience | Set 12

Technical Round-1 1. Maximum Subarray Sum problem: Different approaches and code 2. Given a 2-D char array, with random alphabets, find the word “INTUIT”, s/t… Read More »

## Stack Data Structure (Introduction and Program)

Stack is a linear data structure which follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out)… Read More »

## VMware Interview Experience | Set 8 (On-Campus for MTS – Propel Program)

VMware visited our campus to hire new graduates for their Propel Program. The CGPA cutoff was 7. Round 1 Online MCQ round. This had 3… Read More »

## Circular Queue | Set 2 (Circular Linked List Implementation)

Prerequisite – Circular Singly Linked List We have discussed basics and how to implement circular queue using array in set 1. Circular Queue | Set… Read More »

## Doubly Circular Linked List | Set 2 (Deletion)

We have discussed doubly circular linked list introduction and its insertion. Let us formulate the problem statement to understand the deletion process. Given a ‘key’,… Read More »