In computer science, a linked list is a linear collection of data elements whose order is not given by their physical placement in memory. Instead, each element points to the next. It is a data structure consisting of a collecti…

This post will discuss how to implement the QuickSort algorithm in typescript/javascript. Quicksort is the fastest algorithm. Quicksort works on the divide and conquer strategy. All languages in the world provide sorting fun…

In this article, I am going to discuss how to implement autocomplete using jquery and Trie data structure. Before going into code implementations, let’s understand what a trie is. What is a trie A trie, also called digital…

In this post I am going to show you how to generate fiboancci number series using Linq. What is Fibonacci series : The Fibonacci Sequence is the series of numbers: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, … The next number is found …

Problem Description: Given an array A[] of n elements and a positive integer K, find the Kth smallest element in the array. It is given that all array elements are distinct. For Example: Example 1 Input : A[] = {10, 3, 6, 9, 2,…

In this article, I will show you how to implement edit distance algorithm in C#. We also see how to print the result. The edit distance of two strings, s1 and s2, is defined as the minimum number of point mutations required to…

The input consists of two sequences ~x = x1, . . . , xn and ~y = y1, . . . , ym. The goal is to ﬁnd a longest common subsequence of ~x and ~y For example, let ~x and ~y be two DNA strings ~x = TGACTA and ~y = GT GCATG ; n = …

As per the Wikipedia The knapsack problem is a problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine the number of each item included in a collection so that the total weight i…