CareerCup

Explain the difference between ORM and JDBC.
Provide some examples and when to use one over the other.

There are N trees growing along the street. For safety reasons, one if the trees needs to be cut down. The local council wants the street to looks ordered, so all the remaining trees needs to be in non-decreasing order of height. Your goal is to count number of ways this can be done.

Write a function

class Solution { public int solution (int[] A); }

Each element in the tree denote the height of tree.

return 0 If this condition can't be satisfied.

Example :

Given A[3,4,5,4] Your function should return 2. You can cut down the tree of height 5 and second tree of height 4.

Given A[4,5,2,3,4] Should return 0 as after cutting any tree , it can't be ordered by height.

Given A[1,2,3....100000] Should return 100000. You can cut any one tree.

given two strings s1 and s2 we have to convert s1 into palindrome such that s1 contain s2 as a substring. in a minimum number of operation. wherein a single operation we can replace any word of s1 with any character.
constraint : |s1| <= 1000
|s2| <= |s1|
ex: s1 = "abaa" , s2 = "bb"
output : 1

Suppose we want to build a scheduling app. We have the times people are currently busy, e.g.
{
Alice: [(13.5, 14), (15.75, 17)],
Bob: [(9, 12), (13, 14), (14, 16)],
Eve: [(9, 11), (12.5, 13.5), (14, 15), (16, 18)]
Mallory: [(0, 9), (12, 24)]
}

For simplicity, lets represent times as numbers between 0 and 24 and the times people are busy as (start_time, end_time) pairs. For example, (13.5, 14) means that Alice is busy from 1:30PM-2PM.

Given a list of people's schedules, write a function to return a list of the time intervals all the people in the list are free to meet.

For the example above, here's some sample output:
Alice, Bob => [(0, 9), (12, 13.5), (17, 24)]
Bob, Mallory => []
Alice, Bob, Eve => [(0, 9), (12, 12.5), (18, 24)]

Given an array which represents columns, find the position of two columns which when removed will trap the maximum amount of water. This is related to trapping raining water problem.