We know that LinkedList class in Java is a doubly-linked list implementation of the List interface. This post provides an overview common techniques to manually implement a linked list in Java programming language.
Given a directed acyclic graph (DAG) and a source vertex, find the cost of shortest path from source vertex to all other vertices present in the graph. If vertex can’t be reached from given source vertex, print its distance as infinity.
In this post, we will see how to sort an array of integers using iterative merge sort algorithm.
Quickselect is a selection algorithm to find the kth smallest element in an unordered list. It is closely related to the quicksort sorting algorithm.
In this post, we will discuss about XOR linked list which is used to reduce memory requirements of a doubly linked lists using bitwise XOR operator.
Implement Quick sort algorithm using Hoare’s Partitioning scheme.
In this post, we will see how to search for a given target value in a sorted array of integers using binary search implementation provided by C++ standard library (STL) and Java collection framework.
Given an array of integers, effectively sort it using count sort algorithm.
Implement your own diff utility. i.e given two similar strings, efficiently list out all differences between them.
Given an array of integers, sort it using introsort sorting algorithm. Introsort is an efficient in-place sorting algorithm, which usually beats all other sorting algorithms in terms of performance. Due to its high performance, it is used in a number of standard library sort functions, including some C++ sort implementations. Introsort is a comparison …
In this post, we will discuss C++ implementation of Trie Data Structure which supports insertion, deletion and search operations.
Given a collection of n items, each of which has a non-negative integer key whose maximum value is at most k, effectively sort it using counting sort algorithm.