41 docs tagged with "Algorithm Design Manual"

---

4-20

Check if a string contains properly nested and balanced parentheses, and false if otherwise.

---

---

Maintains bucket of 0..9 or a-z

Assume that we are given n pairs of items as input, where the first item is a

Suppose an array A consists of n elements, each of which is red, white, or blue.

You are given a search string and a magazine.

---

---

NO need to sort all the items.

Find the range in which [str] occurs in [array].

Given unbounded 0s followed by unbounded number of 1s, find the first index of transition.

---

---

Given two binary tree, find if they are identical i.e. same value at the same position & same structure

How does insertion sort work?

Give an O(n log k)-time algorithm that merges k sorted lists with a total of n

Given a set S of n integers and an integer T,

---

[4-33] Algorithm to determine whether there exists an i index such as ai = i given array of {a1, a2, a3 ... an}

---

Given a singly-linked list, find its middle node.

---

You have an unordered array X of n integers. Find the array M containing

Design a data structure that allows one to search, insert, and delete an integer

Construct a DS with search, remove and add operations of O(1) in worst case

Let A[1..n] be an array of real numbers. Design an algorithm to perform any

Let A be an array of n real numbers. Design an algorithm to perform any sequence of the following operations:

---

Solution//www.programiz.com/dsa/prim-algorithm

link here

Reverse the words in a sentence—i.e., “My name is Chris” becomes “Chris is name My.”

Identify the smallest element from unsorted portion and put it at the end of the sorted portion

---

[4-34]

Suppose that we are given a sequence of n values x1, x2, ..., xn and seek to

Find substring match

O(nlogn) algorithm for finding whether there exists a pair of elements, one from S1 and one

Union-Find represent each subset as backward trees