Algorithms,part1 week1

最新推荐文章于 2020-11-01 04:48:12 发布

原创最新推荐文章于 2020-11-01 04:48:12 发布 · 2k 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#algorithm #integer #construction #search #each

Algorithms 同时被 2 个专栏收录

1 篇文章

订阅专栏

coursera

1 篇文章

订阅专栏

本文包含了一系列算法面试题目，涉及并查集、分析算法等主题。包括社交网络连通性问题、并查集特定元素查找、成功继任者删除操作、并查集按大小合并等问题，并探讨了3-SUM问题、双峰数组搜索及鸡蛋掉落问题。

Interview Questions: Union-Find

Question 1

Social network connectivity. Given a social network containing

N members and a log file containing

M timestamps at which times pairs of members formed friendships, design an algorithm to determine the earliest time at which all members are connected (i.e., every member is a friend of a friend of a friend ... of a friend). Assume that the log file is sorted by timestamp and that friendship is an equivalence relation. The running time of your algorithm should be

MlogN or better and use extra space proportional to

hint-union-find.

use another array to keep track of the number of each subtree for each node.

Then, use binary search (lgN) to search N for each time-stamp and union pair (M).

Question 2

Union-find with specific canonical element. Add a method find() to the union-find data type so that find(i) returns the largest element in the connected component containing i. The operations, union(), connected(), and find() should all take logarithmic time or better.

For example, if one of the connected components is {1,2,6,9}, then the find() method should return 9 for each of the four elements in the connected components.

Hint: maintain an extra array to the weighted quick-union data structure that stores for each root i the large element in the connected component containing i.

Question 3

Successor with delete. Given a set of

N integers

S={0,1,...,N−1} and a sequence of requests of the following form:

Remove x from S
Find the successor of x: the smallest y in S such that y≥x.

design a data type so that all operations (except construction) should take logarithmic time or better.

Hint: use the modification of the union-find data discussed in the previous question.

Question 4

Union-by-size. Develop a union-find implementation that uses the same basic strategy as weighted quick-union but keeps track of tree height and always links the shorter tree to the taller one. Prove a

lgN upper bound on the height of the trees for

N sites with your algorithm.

Hint: replace the sz[] array with a ht[] array such that ht[i] stores the height of the subtree rooted at i.

Interview Questions: Analysis of Algorithms

Question 1

3-SUM in quadratic time. Design an algorithm for the 3-SUM problem that takes time proportional to

N2 in the worst case. You may assume that you can sort the

N integers in time proportional to

N2 or better.

Question 2

Search in a bitonic array. An array is bitonic if it is comprised of an increasing sequence of integers followed immediately by a decreasing sequence of integers. Write a program that, given a bitonic array of

N distinct integer values, determines whether a given integer is in the array. Your program should use

∼3lgN compares in the worst case.