CareerCup

A tree just like it is done in any xml library

Level order travesal

hashmap can we build using arrays and linked list.

use linked list

Can the dates span over multiple munths and multiple years?

Does 2 different databses are replicate of each other. In that case you can manage them at the server side, which maintains the load on both the servers.

I will take an example to ilustrate
30 !
- take a ctr and increment by 1 since 30 has 1 0
- 29 reject this
- 28 it has 2's 2 and one 9 take a var for count of even
- 27 leave
- 26 1 2 increment even num count
- 25 it has 2 five take in another var
Hence at last number of 0 will be
Var for 0 + min(var if 2 , var of 5)

Can a cell be half colored I mean how can you form a circle out of equal sized squares

Can a cell be half colored I mean how can you form a circle out of equal sized squares

What is LinkedHashMap Miral? Can you please elaborate

Use a queue of length 10. And a hash table with key value
The hash will have the key and the corresponding element number in the queue
The value will be stored at the element number in the queue.

Put will check if key exists will remove that element from queue and add it to last. If length 10 the will remove first element remove its key from hash and add that element in the last

Hi scorpionishime can you please let me know how to convert to a dp by taking a 2d arrray

Can you please let me know what does "Use the file to reconstruct the new alphabet for as much as possible." means with an example.

Critical section.

nice..that was easy

I suspect if this can be done in logn time.

WE can improve the algorithm in the controller which is controlling the elevators.

great...I think this will work Jackie

I think it will not work for this, try it out
{2, -3, 5}
and is 5 but your maxSumArray will give 4,

Hi

this wont work for numbers which are all negative
{-1,-3,-5,-2,-1,-4}

Nice solution Loler. I think it will work

dumbo there can be numbers in the subarrays which are common to both hence they can overlap so I dont think it will work
Can you please explain your algo using the example given above

Can someone please explain what does this means
"Patterns can be mutated"

Nice answer Manohar. Yes it will give the desired result in O(n) time

Yes it will.. there is a loop in the list and if a pointer isnt able to move 3 steps then obviously there is no loop. This means you have found a loop much faster than the method where you move 2 times

I will use a min heap according to priorities in this case.
struct heap
{
int priority
int service
heap *left;
heap *right;
}

or best approach to use a heap is arrays

Do you think aka your approach will lead to minimum lift movements?

A sorting algorithm which takes minimum seeks.
How about bubble sort which will take about 2N seeks in every step(maximum)

Ashish can you please explain how it will not work>
For no right child I am using a blank in the array.

Do a level order traversal. Remember for null leaves enter blank in an array
eg
1
2 3
4 6 7

post order traversal is : 1234_67
Now here we follow the property that child will always be at 2i and 2i+1 index or vise versa parent is always at |i/2| index
therefore parent of 1 will be no one
parent of 2 = 2/2 = 1 i.e 1
parent of 3 = 3/2 = 1 i.e 1
parent of 4 = 4/2 = 2 i.e 2 and rest copy from 2
parent of 6 = 6/2 = 3 i.e 3 and rest copy from 3
parent of 7 = 7/2 = 3 i.e 3 and rest copy from 3

Oh yes I forgot to add that logic.
You can use with a simple check in the beginning to know. Use a trie for the dictionary.

Looks good
Chintamani can you please elaborate your algo with a small example.
you can use a adjacency matrix to represent the graph.

This can be solved using recursion
Please let me know if I have messed up somewhere here.

void FromTo(char *source, char *dest, char **stackofWords, int wordCount)
{
if(strcomp(source, dest) == 0)
{
print(stackofWords, wordcount);
return;
}
else
{
for(int i=0;i<strlen(source);i++)
{
for(int j=0;j<26;j++)
{
if((char)((int)'A' + j) != source[i])
source[i] = (char)((int)'A' + j);
else
continue;
stackofwords[wordcount] = source;
Fromto(source, dest, stackofWords, wordcount+1);
}
}
}

}

Algo

I am changing every letter with all the alphabets in the english dictionary and then comparing with the desitnation.

I think you are right gen-y-s

Here is my question
We can an array of bits. When we convert it to a integer, isn't we are scanning each and every array element? I mean
We divide the array into 2 halfes and take the first half. Now to know whether first half has a 1 we convert the array into integer.
My question is how we are converting the array into integer?Are we not scanning the complete array for this?

We can hash the list 1 in one hash table keeping the count of each word in hash
Now as we scan the next list decrement the count in hash once it is present in the hash

This is an invalid string right ?
11+*6

Can you please give an example

Can you please provide an example. Is it that value in key of one hash table needs to be compared to value in every key in other hash table?

How are hash tables compared. Is it values with the same keys or what?

In the first pass remove all 'b'
Then in the second pass search for a 'c' and once you find a 'c' then go back and look for its immediate 'a' and found delete it.

A matrix with printer and system as rows and columns. i.e a graph representation.
Each cell can contain the distance between printer and system.

Oh yes, I just slipped out on that case. well you have your full solution
1) If there are no right child of a given node its parent is the next highest node
2) Else the left most node of the right node of the given node

Do you want me to code for the solution? I think once an algorithm of a problem is known, coding may no be a problem.
Please do let me know if you are finding anything wrong with the above solution, we can discuss.
Also let me know if you want concrete code, I will write it down for you

why do we need a parent pointer just wondering. The next largest node will be the left most node of the right node of the given node.

Go to the middle and reverse the second part of the linked list
Now we have 2 pointers one pointing to the first element and the other to the middle element. Compare and return true if pallindrome

there is a runtime error here
Please add a check for n i.e if (n<0) then return false;

Yes it works aka only thing is as alex has pointed out count%2 == 1 instead of 0

Find longest increasing subsequence where you have the index as well for the elements which contributes to the subsequence.
Now the numbers which do not belong to this subsequnce are the one which needs to be removed

aka what is sum in the array that you have given