CareerCup

For the given array count the partitions such that absolute deferrence between any two elements from partition is less then or equal to k order of elements in partition array is is independent and elements is not get repeated in portion.
Quetion: A[] = { 1, 2,3,10, 5,4}, K = 3.
There are two Possible partitions are {1,2,3}, {5, 4} or {1,2}, {3, 5, 4} or {2,3,5,}, {1,4} there are two partion such that absolute deferrence between any two elements is less then K
So the Output is 2

find the maximum length subarray condition 2 * min > max

There is a 2D matrix of 0s and 1s that depicts the number of rooms that can be formed by a co-working space company like WeWork based on the values. 1 means open space for room and 0 means wall. We need to group as many 1s and possible to form the largest and minimum number of rooms.

E.g.
Number of Rows = 5, Number of Columns = 5
00010
01110
01100
01101
00011

Output: 4

Input 2:
4
3

001
111
011
100

Output: 4

Two sum problem

You have a table :
Rule1 Rule2 Rule3 Value
A1 B2 C3 40
A1 B1 C1 20
A2 B2 C2 10
A1 B1 C1 40
* B1 * 20
A5 B2 * 10

Now if I have a condition A1 && B2 && C3 i will get output as 40.
If I input A1 && B1 && C1 I will get two results 40 and 20 here there the rule is ambiguous.
"-" in table means any rule, 5th row matches with any row with B1 as rule2, so there is also ambiguity in result.

Now given that table as input (m * n) where n is number of available rules combination (here its 6) and m rules (3 in this case) , output if the table is ambiguous i.e it will output two different result for same query.

Program for the given boolean matrix print size of matrix that forms X by 1s
Input:
1 1 1
1 1 1
1 1 1
Otput:3
1 1
1
1 1
That form x and size is 3

A Doctor travels from a division to other division where divisions are connected like a graph(directed graph) and the edge weights are the probabilities of the doctor going from that division to other connected division but the doctor stays 10mins at each division now there will be given time and had to find the division in which he will be staying by that time and is determined by finding division which has high probability. Input is number of test cases followed by the number of nodes, edges, time after which we need to find the division in which he will be there, the edges starting point, end point, probability. Note: If he reaches a point where there are no further nodes then he leaves the lab after 10 mins and the traveling time is not considered and during that 10min at 10th min he will be in next division, so be careful

find the division with highest probability that doctor is in it after 10 min is div 3 and probability is 0.7.

After 9 minutes dr has yet to move to another division he is in div 1 and probability is 1.0. Forty minutes later the division with highest probabilty is 6 and probabilty is 0.77400

input 1 6 10 40 1 2 0.3 1 3 0.7 3 3 0.2 3 4 0.8 2 4 1 4 5 0.9 4 4 0.1 5 6 1.0 6 3 0.5 6 6 0.5

output 1 6 0.774000

input 2 6 10 10 1 2 0.3 1 3 0.7 3 3 0.2 3 4 0.8 2 4 1 4 5 0.9 4 4 0.1 5 6 1.0 6 3 0.5 6 6 0.5

output 2 3 0.700000

Shopping Cart Programming test.
There are multiple types of customer(Regular, Premium) they have been given a discount based on their purchase amount. for e.x
Premium Customer
1) 0-$5000 0%
2) $5000-$10000 10%
3) 10000 - above 20%

Regular Customer
1) 0-$4000 10%
2) $4000 - $8000 15%
3) $8000 - $12000 20%
4) $12000 - above 25%

Read input from console:
Input:
Regular
$5000
Output:
$5000
Input:
Premium
$7000
Output
$8000

Write a program to sort a string without using java API?
I/P : "a390testai"
O/P: 039aaiest

How to find if a Binary tree has an odd number of nodes without using node count? Binary tree does not have to be balanced

How can I tell what version of Microsoft Office 365 that I am using?

How do I export and import Company records?

I cannot allocate to a project in a Payroll Cheque Run ?

How to connect your Office 365 to Sage 50 ?

when you try to activate your Sage ID ?

I forgot my Sage Drive password, how do I reset it?

What is Sage Drive?

The Connection Manager could not start the database engine In Sage ?

The company file is on the server or another computer.?

0x80040702 "Failed to load dll: Reg 32" when installing Sage ?

Write AWS lambda function to fetch data from on premises oracle db and migrate to aurora db.

I tried :

var oracledb = require('oracledb-for-lambda');
var os = require('os');
var fs = require('fs');
'use strict';

str_host = os.hostname() + ' localhost\n';

fs.appendFile(process.env.HOSTALIASES,str_host , function(err){
    if(err) throw err;  
});

Can someone show me , i have table with same columns present in oracle db as well as aurora db i want to map form oracle to aurora. How to write it in java or python using aws lambda.

You have oracle database table , and AURORA AWS table with same fields , write a java lambda function to migrate data from oracle table to aurora. Also it should be realtime, if a new record is added to oracle it should update aurora db table as well.

You have a bunch of shops. Each shops sells a bundle of chocolates at a fixed cost. You are given an amount and the price sheet of shops. Find the maximum number of chocolates that you can buy with the amount.

Int Calculate(Int Amount, []Int Quantities, []Int Cost) {
  // Implement
}

Other points: (1) You cannot use 'sort' (2) The costliest shop need not sell the maximum number of chocolates. (3) Tricky cases exist. For example: Shop 1 sells 10 chocolates in a 10 $ bundle. Shop 2 sells 9 chocolates in a 1$ bundle. If you have 10$ in your hand, Here the maximum number of chocolates that you can buy is not 10 but 90.

Design a Google Sheet System?

Where do you store the data? sql or nosql
How do you maintain concurrency?
How do you display it in frontend, which can be inline editable?

Replace each number by its next bigger number from right side of current index. if no bigger number found print that number itself.

Eg: 2,5,9,6,3,4,8,15,12
OutPut : 3,6,12,8,4,8,12,15,12

Given a string S of length N. Now, you need to cut the string S into K+1 non-empty substrings by performing K cuts.
There are lots of ways of performing the cuts in the string S. For every way of performing the cuts, you need to count how many substrings will be a palindrome in that way of cut. You need to sum this count over all possible ways of cutting the string S.

Input Format
The first line contains two integers N and K as input.
The second line contains the string S as input.

Output Format
In the output, you need to print the sum modulo 
10^9+7.

Constraints
2≤N≤5000

1≤K≤N−1

String S contains only lowercase english alphabets


Sample Input

5 2
aabbc
Sample Output

12


Explanation
In the given test case there are 
6 ways to perform the cuts. All the ways are described below.

a | a | bbc = 2 substrings are palindrome
a | ab | bc = 1 substring is palindrome
a | abb | c = 2 substrings are palindrome
aa | b | bc = 2 substrings are palindrome
aa | bb | c = 3 substrings are palindrome
aab | b | c = 2 substrings are palindrome
So, the output is 
2+1+2+2+3+2=12

Count maximum number of pair (a, b) possible from an array so that a is less than equal to 2*b. Also tell number of unpaired element left.
So for Input
1, 3, 5, 6, 7
ans = 2 1

An array is special if it contains special elements. A special element is an element which can be represented by the sum of two numbers where one number is reverse of other. Like Array is {22, 121} . Here 22 = 11 + 11 and 121 = 92 + 29. Hence both elements are special. The input array is an array of strings. Output number of special elements in the array.

How would you design a system where you have 1000 records in database and on UI you are showing them, a user can select single or bulk record which can be in any order and drag drop to reorder the sequence of the record. Example :
I have below records
1
2
3
4
5
a user selects 1 and dragdrops it on 5th position, so the new order becomes 2,3,4,5,1. This has to be done at the database layer and in efficient way. How to maintain continuous reordering sequence of records?

Given lat long of cabs in a city(lat long keeps changing)
Implement a function getNearby(lat1,long1) which returns all cabs in a circle of radius R from lat1,long1.
Which datastructure will u use?
FollowUp qs: Hows it implemented using a database like MySQl or Postgres.