CareerCup

Mark likes to listen to music while travelling. His iPod™ contains N songs and he wants to listen to L (not necessarily different) songs during a trip. So he creates a playlist such that:
• Every song is played at least once.
• A song can be played again only if at least K other songs have been played

Mark wants to know how many different playlists are possible. Can you help Mark determine this number? As the number can be very large, display number modulo 1,000,000,007.

You are given N, K and L.

First they did ask to find pattern of this

'this is a test sentence' => [t, h, i, s, i, s, a, t, e, s, t, s, e, n, t, e, n, c, e]
'thiis iss a teest seentennce' => [i, s, e, e, n]
'thiiis iss aa teeest seentennnce' => [i, e, n]
'thiiiis iss a teeest seeentennncccce' => [i, c]

after i have to do body of function

getLongestConsecutiveChar

We have a Very big which our datatypes does not provide.
We need to multiply such numbers, how to do?
example :

Num1 = {1,2}, Num2 = {1,0} then ans would be {1,2,0}
Num1 ={5,3,6,2,8,2,0,2,8}, num2 ={3,5,2,3,2,1,}
then ans would be the multiplication value of 5362882028 X 352321

Good day I just got a question which is the following

you have an vector like this

[JFK, LXA, SNA, RKJ, LXA, SNA]
each 2 group define a route. so,

JFK -> LXA
SNA -> RKJ
LXA -> SNA
Find the path from departure to destination. note: departure and destination are not known.

The final destination should be

JFK-> LXA -> SNA -> RKJ
The function signature is something like this

vector<string> findPath(vector<string> airports)
{

}

The airports (nodes) cannot be duplicated and the path should print all the airports (nodes)

Good day I just got a question which is the following

you have an vector like this

[JFK, LXA, SNA, RKJ, LXA, SNA]
each 2 group define a route. so,

JFK -> LXA
SNA -> RKJ
LXA -> SNA
Find the path from departure to destination. note: departure and destination are not known.

The final destination should be

JFK-> LXA -> SNA -> RKJ
The function signature is something like this

vector<string> findPath(vector<string> airports)
{

}

The needed the full path from departure to destination, and you can only pass by one point only once.

Thanks!

Given a binary search tree and a number n, write a program to find the greatest number in the binary search tree less than or equal to N.

Given the following tree construction, what is the output for N=44?

A credit card company allows merchants to use their Point-of-sale (POS) terminal to accept payments. It wishes to charge merchants for every transaction that happens through thier POS terminal. Here are some charging rules that it has come up with:

Transactions are charged 2.0% of transaction amount if amount is less than 5000.00
Transactions are charged 1.5% of transaction amount if amount is between 5000.00 and 9999.99 (both inclusive)
Transactions are charged 1.0% of transaction amount if amount is equal to or above 10000.00
If merchant has already done transactions worth 50000.00 in a month, then rest of transactions of that month are charged at 0.5%
Every Month - two transactions of amount less than or equal to Rs. 5000.00 are free
Charges are rounded to nearest higher Rupee (Eg: 9.23 is rounded to 10.00)
Please develop a program to compute the charges for given inputs.

Your input will be in the following format. First Line: number of records follows, say N Next N Lines - Transaction data in the order - Transaction Date, Merchant Name, Amount

15
2014-06-25,XYZ Retail,10000.00
2014-07-01,XYZ Retail,10000.00
2014-07-01,ABC Retail,1000.00
2014-07-02,ABC Retail,3999.00
2014-07-02,ABC Retail,2000.00
2014-07-03,ABC Retail,10000.00
2014-07-15,ABC Retail,6530.00
2014-07-15,XYZ Retail,500.00
2014-07-18,ABC Retail,9750.00
2014-07-18,XYZ Retail,35000.00
2014-07-18,XYZ Retail,500.00
2014-07-18,XYZ Retail,5000.00
2014-07-18,XYZ Retail,5000.00
2014-08-02,XYZ Retail,10000.00
2014-08-02,XYZ Retail,1000.00
Transactions must be read and processed in the order given, else output will not match. Do not try to sort the transactions.

Output (Charges for each transaction on separate line)

100.00
100.00
0.00
0.00
40.00
100.00
98.00
0.00
147.00
350.00
0.00
75.00
25.00
100.00
0.00
Sample Input (Plaintext Link)
15
2014-06-25,XYZ Retail,10000.00
2014-07-01,XYZ Retail,10000.00
2014-07-01,ABC Retail,1000.00
2014-07-02,ABC Retail,3999.00
2014-07-02,ABC Retail,2000.00
2014-07-03,ABC Retail,10000.00
2014-07-15,ABC Retail,6530.00
2014-07-15,XYZ Retail,500.00
2014-07-18,ABC Retail,9750.00
2014-07-18,XYZ Retail,35000.00
2014-07-18,XYZ Retail,500.00
2014-07-18,XYZ Retail,5000.00
2014-07-18,XYZ Retail,5000.00
2014-08-02,XYZ Retail,10000.00
2014-08-02,XYZ Retail,1000.00
Sample Output (Plaintext Link)
100.00
100.00
0.00
0.00
40.00
100.00
98.00
0.00
147.00
350.00
0.00
75.00
25.00
100.00
0.00
Explanation
100.00 // Rule 3 applied
100.00 // Rule 3 applied
0.00 // Rule 5 applied (ABC Retail) for the month of July
0.00 // Rule 5 applied (ABC Retail) for the month of July
40.00 //Rule 1 & 6 applied
100.00 // Rule 3 applied
98.00 // Rule 2 & 6 applied
0.00 // Rule 5 applied (XYZ Retail) for the month of July
147.00 // Rule 2 & 6 applied
350.00 //Rule 3 applied
0.00 // Rule 5 applied (XYZ Retail) for the month of July
75.00 // Rule 2 applied
25.00 // Rule 4 applied
100.00 // Rule 3 applied
0.00 // Rule 5 applied (XYZ retail) - for the month of Augus

public class Base Test {
protected void finalize() {
System.out.println("Destroying Base");
}
}

public class DerivedTest extends Base Test{
protected void finalize() {
System.out.println("Destroying Derived");
}
}

What is output when an instance of DerivedTest is finalized?

You have a class that many libraries depend on. You need to modify the class for one application. Which of the following changes require recompiling all libraries before it is safe to build the application?

a. add a constructor
b. add a data member
c. change destructor into virtual
d. add an argument with default value to an existing member function

Do thread join without join function?

Given a BST, how would you return the kth smallest element. Cover all the corner cases with time complexity logn

Write a program that reverses alternate elements in a given linked list input: a->b->c->d, output should be b->a->d->c

You are given the toplogical information of a terrain in the following format - There are n points ( x_i , y_i ) and for each point (x_i , y_i ) the altitude h_i is given.

For any rectangle (axis parallel) defined by the x-y coordinates of
the corner points, we must answer the query about which is the highest altitude point lying within the rectangle.

Implement this using a range-query data-structure that answers such a
query in O( log^2 n) time

Find Maximum sum subarray such that no elemnt in subarray is repeated
https://www.facebook.com/photo.php?fbid=10152820917104183&set=pcb.1523587287892659&type=1&theater

The Question is to find 4 numbers between 1 and 40, so that you can get all the numbers between 1 to 40 by doing either of operation below.
1) Either any of the four number itself.
2) creating an expression by combining among the four number, with either addition or subtraction.

For example suppose we have to find four numbers so that we can get numbers between 1-30.
The answer to above question is 1,3,6,20.

To schedule a job which will run in weekdays between 3pm to 5pm , in a interval of 15min.

(its for oracle 10g so it doesn't support schedular

** without using repeat_interval.)

Problem Statement

You have two strings A and B. Each one contains some letters and exactly one asterisk.

You have to replace the asterisk in each string with a letter sequence (possibly of zero length) so that the resulting two

strings are equal. This equal string is what you have to return. Attempt to return the shortest possible string.

The letter sequences may be same or different.

If it is not possible to make the given strings equal, return the string "not-possible".

Additional Constraints

- A and B will contain only uppercase letters and asterisks.

- A and B will contain one asterisk each.

Examples

0)

"SOCIA*TWIST"

"SOCIALTWI*T"

Returns: "SOCIALTWIST"

1)

"HELLO*"

"HI*"

Returns: "not-possible"

2)

"PROFESS*"

"*PROFESS"

Returns: "PROFESS"

3)

"*EXAMPLETEST"

"THIRDEXAMPLE*"

Returns: "THIRDEXAMPLETEST"

4)

"*TELL"

"*AFRIEND"

Returns: "not-possible"

5)

"*"

"B*"

Returns: "B"

6)

"*C"

"D*"

Returns: "DC"

program should be written in java

What is difference between critical section and mutex.??
Can we use mutex across the process??

hi guys ..hows the adobe recuitment first round will be like

Given an unsorted array of integers, you need to return maximum possible n such that the array consists at least n values greater than or equals to n. Array can contain duplicate values.
Sample input : [1, 2, 3, 4] -- output : 2
Sample input : [900, 2, 901, 3, 1000] -- output: 3

Traveler wants to travel from city “A” to city “D”.
There is a path from city “A” to city “D”.
Path consists of steps, i.e. travel from city “A” to city “B”.
Path is encoded as sequence of steps.
Sequence is in incorrect order.
Your task is to restore order of steps in the path.
Input (unordered sequence):
C -> D
A -> B
B -> C
Output (Correctly ordered list which represents path):
A, B, C, D

Implement following API:

class Step {
String start;
String finish;
};

class Node {
String value;
Node next;
}

List<String> findPath(List<Step> steps) {
}

Given a Binary Search tree of integers, you need to return the number of nodes having values between two given integers. You can assume that you already have some extra information at each node (number of children in left and right subtrees !!).

You are given information about hotels in a country/city. X and Y coordinates of each hotel are known. You need to suggest the list of nearest hotels to a user who is querying from a particular point (X and Y coordinates of the user are given). Distance is calculated as the straight line distance between the user and the hotel coordinates.

root, directory, 128, admin, NONE
users, directory, 512, admin, root
santana, directory, 1024, santana, users
santana.jpg, photo, 128000, santana, santana
Project.doc, document, 256000, santana, santana
Incredibles.mpg, movie, 4123456123, santana, santana
marcus, directory, 128, marcus, users
Resume.doc, document, 256000, marcus, marcus

This contains information about files stored in a file system. Each line corresponds to one file, and the fields are separated by commas. The first field contains the filename, the second contains the file type, the third field is the size of the file in bytes, the fourth field is the username of the owner of the file, and the last field is the name of the parent directory of this file (i.e. the name of the directory in which this file is located.) Note: the special parent directory name NONE indicates that this file is the root directory of the filesystem. Also, for the purposes of this program, assume that all file/directory names are unique in the system.
write a Java program which reads data in this format from a file, parses it, and figures out the total size of storage consumed by each directory in this system. The size of storage consumed by any directory is defined as the sum of the size of this directory, sizes of all the files in this directory and the total storage sizes consumed by all the directories in this directory. Your program should write the name of each directory, and the total storage consumed by it. The output should have one directory per line, and the format should be dirname: size.
Output should be:

santana: 4123841147
marcus: 256128
root: 4124097915
users: 4124097787

Provide the best algorithm and java program.

3, 5, 7, 9, 11, 13. Which is least like others?

Given a number N, find the smallest even number E such that E > N and digits in N and E are same.
Print NONE otherwise.
Sample:
Input
N = 34722641
Output
E = 34724126
Input
N = 8234961
Output
E = 8236194 (instead of 8236149)
Java solution

Given two words, determine if the first word, or any anagram of it, appears in consecutive characters of the second word. For instance, tea appears as an anagram in the last three letters of slate, but let does not appear as an anagram in actor even though all the letters of let appear in slate.
Return the anagram of the first word that has appeared in the second word.
Sample Input 1
tea
slate

Sample Output1
ate
Sample Input 2
let
slate

Sample Output2
NONE

java solution

Given a string, complete the given function to recursively remove the adjacent duplicate characters and return the resultant string. If there are no characters left in the resultant string, return "-1" (without quotes).
Sample Test Cases
Sample Input: ABCCBCBA
Output: ACBA

Explanation: (ABCCBCBA --> ABBCBA --> ACBA)
Sample Input: AA
Sample Output: -1
Java solution

Given a string, write an algo and code to print all possible anagrams for given string.
for ex:
Given string: "amz"
Output:
amz
azm
maz
mza
zam
zma

Note: Write Algo and Code

how to print this pattern

input N=4
output :
4444444
4333334
4322234
4321234
4322234
4333334
4444444

input N=3
output :
33333
32223
32123
32223
33333