## Multiply two polynomials

Given two polynomials represented by two arrays, write a function that multiplies given two polynomials. Example: Input: A[] = {5, 0, 10, 6} B[] =… Read More »

## MakeMyTrip Interview Experience

MakeMyTrip recently visited our campus to hire full time employees. Here’s my interview experience: Round 1: (Online MCQs) Questions on aptitude, English, logical reasoning, C/C++… Read More »

## Delete all occurrences of a given key in a linked list

Given a singly linked list, delete all occurrences of a given key in it. For example, consider the following list. Input: 2 -> 2 ->… Read More »

## Intuit Interview | Set 2 (On-Campus)

Round One (Written round, 60 minutes): 1. Given an unsorted linked list, remove all duplicates without using temporary buffers. 2. A number starting from 1… Read More »

## Intuit Interview | Set 1 (On-Campus)

Intuit had come on campus last week for SDE-1 and Quality Engineer profiles. These were the questions asked: Round One (Written round, 60 minutes): 1.… Read More »

## Can we reverse a linked list in less than O(n)?

It doesn’t look possible to reverse a simple singly linked list. A simple singly linked list can only be reversed in O(n) time using recursive… Read More »

## A Programmer’s approach of looking at Array vs. Linked List

In general, array is considered a data structure for which size is fixed at the compile time and array memory is allocated either from Data… Read More »

## Linked List | Set 3 (Deleting a node)

We have discussed Linked List Introduction and Linked List Insertion in previous posts on singly linked list. Let us formulate the problem statement to understand… Read More »

## Circular Linked List | Set 2 (Traversal)

We have discussed Circular Linked List Introduction and Applications, in the previous post on Circular Linked List. In this post, traversal operation is discussed. Recommended:… Read More »

## Circular Linked List | Set 1 (Introduction and Applications)

We have discussed singly and doubly linked lists in the following posts. Introduction to Linked List & Insertion Doubly Linked List Introduction and Insertion Circular… Read More »

## Doubly Linked List | Set 1 (Introduction and Insertion)

We strongly recommend to refer following post as a prerequisite of this post. Linked List Introduction Inserting a node in Singly Linked List A Doubly… Read More »

## Given a linked list, reverse alternate nodes and append at the end

Given a linked list, reverse alternate nodes and append them to end of list. Extra allowed space is O(1) Examples Input List: 1->2->3->4->5->6 Output List:… Read More »

## Convert a given Binary Tree to Doubly Linked List | Set 3

Given a Binary Tree (BT), convert it to a Doubly Linked List(DLL) In-Place. The left and right pointers in nodes are to be used as… Read More »

## Queue | Set 2 (Linked List Implementation)

In the previous post, we introduced Queue and discussed array implementation. In this post, linked list implementation is discussed. The following two main operations must… Read More »

## C Program for Bubble Sort on Linked List

Given a singly linked list, sort it using bubble sort. Input : 10->30->20->5 Output : 5->10->20->30 Input : 20->4->3 Output : 3->4->20 filter_none edit close… Read More »