taoqick的专栏

This problem is aninteractive problemnew to the LeetCode platform.We are given a word list of unique words, each word is 6 letters long, and one word in this list is chosen as secret.You may call master.guess(word)to guess a word. The guessed word ...

Generate all the possible substrings using the characters of a given string. Write code. (The order of chars do not matter, i.e., ac ca) i/p: abc o/p: { a,b,c,ab,ac,bc,abc} --------------

On a 2-D grid, the positions (x,y) of 3 persons are given. Find the meeting point such that sum of distances of each person from meeting point is minimized. Now generalize this to N persons and so

Given an array A[], find (i, j) such that A[i] --------------------------------------------------------------A Typical two-direction search...MaxDiff(vector arr){ if(arr.size()==0) return

Given 2 arrays A,B, where x(A.length) insert (y - x) 0's to A at various places such that A*B is minimum. For instance, if A = (1, -1) and B = (1,2, 3, 4), then inserting two 0's in the middle of

You are given an array A of k values which contain int values in sorted (asec) order. Find top k values (asec) which can either be the number from the array A, or sum of any two numbers from A or su

You are given n dices each with heads numbered from 1 to m. You are to throw the n dices and note down the sum of the numbers on each of the n dices. You'll be give a number x and its a win if the s

Given a tree in the form of parent pointers of every node (for root assume parent pointer to be null), write code to find the diameter of tree.-----------------------------------------------------

How to find medium of 1 billion numbers across N distributed machines efficiently?----------------------------------------------------------------------------------1)Each machine sorts it's ow

Given a sequence of numbers such that A[0] >= A[1] and A[N-1] >= A[N-2] find at-least one triplet such that A[n-1] >= A[n] <= A[n+1]. Better than linear time is expected.Example: 9 8 5 4 ...

Given an array of (unsorted) integers, arrange them such that a c e... etc.---------------------------------------------------------------------------------After using a heap, I found O(n) i

Given a binary matrix of N X N of integers , you need to return only unique rows of binary arrays eg: 0 1 0 0 1 1 0 1 1 0 0 1 0 0 1 1 1 1 0 0 ans: 0 1 0 0 1 1 0 1 1 0 1 1 1 0 0--

Given preorder traversal array of a BST, recontruct the BST.---------------------------------------------------------------I like this solution!!!!!!!!!!This can be solved in O(n) only.

Liar, Liar As a newbie on a particular internet discussion board, you notice a distinct trend among its veteran members; everyone seems to be either unfailingly honest or compulsively deceptive. Y

1. A 2. Ctrl+A 3. Ctrl+C 4. Ctrl+V If you can only press the keyboard for N times (with the above four keys), please write a program to produce maximum numbers of A. If possible, please al

From the set of natural integer numbers Let x = 1234 = {1, 2, 3, 4} Let y = 2410 = {2, 4, 1, 0} Write an algorithm to compute the rearrangement of x that is closest to y but still greater than

Given an int array which might contain duplicates, find if it is a sequence. Eg. {45,50,47,46,49,48} is a sequence 45, 46,47,48,49,50 Sorting is an obvious solution. Can this be done in O(n) t

There is a matrix, m x n. Several groups of people locate at some certain spots. In the following example, there are three groups and the number 4 indicates there are four people in this group. Now

Implement a stack that pops out the most frequently added item. Stack supports 3 functions - push, pop,and top. Give complexity of each functions in your implementation.---------------------------

Give a min and max of an integer array, write a function to randomly return a number inside of this range, but not in the list. Also write a class that contains this function.---------------------

Imagine you have a sequence of the form 0123456789101112131415... where each digit is in a position, for example the digit in the position 5 is 5, in the position 13 is 1, in the position 19 is 4, e

Given an array of n elements (a1,a2,..ai,...,an). You are allow to chose any index i and j, such that (i!=j) and allow to perform increment operation on ai = ai+1 and decrements operation on aj = aj

Two numbers are represented as linked lists. Both lists are of same length. Add them without manipulating the lists and without a second traversal.---------------------------------------------

49 race cars and no two have the same speed. Now give you 7 tracks with equal length to find the 25th fastest car. At least how many races are needed.(no time recorder)------------------------------...

Initially there is a number n written on board. Two players start playing a game turn by turn. Each player has to replace the number n written on the board by n-2^k (for some k >= 0 such that 2^k

A string is called sstring if it consists of lowercase english letters and no two of its consecutive characters are the same. You are given string s of length n. Calculate the number of sstrings

Let's say you have a phrase without any spaces - eg. "thisisawesome". Given a dictionary, how would you add spaces in this string?----------------------------------------------------------------

You are given an array, divide it into 2 equal halves such that the sum of those 2 halves are equal. (Imagine that such division is possible for the input array and array size is even)--------------...

Alex is standing on the top left cell (1,1) of a n*m table. The table has n rows and m columns. Initially, he is facing its right cell. He moves on the table in the following way: >He moves one

Give you an array which has n integers,it has both positive and negative integers.Now you need sort this array in a special way.After that,the negative integers should in the front,and the positive in

Return a shortest prefix of <code>word</code> that is <em>not</em> a prefix of any word in the <code>list</code>e.g.word: cat, it has 4 prefixes: “”, “c”, “ca”, “...

Fill in the blanks:-- -- -- H I K L M N T -- -- -- G J O P Q R S-------------------------------------<span style="color:#333333">Characters in the top ro...

You are given 'n' appointments. Each appointment contains startime and endtime. You have to return all conflicting appointments efficiently starttime and endtime can range from a few min to few year

During boot, after the BIOS performs a successful power-on-self-test, describe everything that occurs until the console is presented to the user.---------------------------------------------------

Given tree integers a, b,c. Write a function: int median (int a,int b,int c) to get the median number among a,b,c. Can not use sort, the times of integer operations (e.g. compare, + - * /, bit compu

Implement in OOP the old cell-phones game "snake". Implement the function "MoveUp". Follow up: how would you reduce space complexity?--------------------------------------------------if it

how would you implement a secondary sorting. Meaning sorting by Category A, and then sub sorting by category B?--------------------------------------------------------------------------Three a

Program an iterator for a Linked List which may include nodes which are nested within other nodes. i.e. (1)->(2)->(3(4))->((5)(6). Iterator returns 1->2->3->4->5->6------------------------------

You need to organize a football tournament. There are n teams given. You need to prepare a schedule for the matches so that each team plays with every other team and on the same day no team plays tw

You are given two array, first array contain integer which represent heights of persons and second array contain how many persons in front of him are standing who are greater than him in term of heigh