CareerCup

Given a matrix. Convert it into a linked list matrix such that each node is connected to its next right and down node.

Ex:
1 2 3
4 5 6
7 8 9

Output:
1->2->3->NULL
| | |
v v v
4->5->6->NULL
| | |
v v v
7->8->9->NULL
| | |
v v v
--NULL-

This is my code.

class Ideone
{
	public static void main(String args[]) throws Exception {
		int arr[][] = { { 1, 2, 3 }, 
				        { 4, 5, 6 } };
		LList op = convert2DArrintoList(arr, 0, 0);
		System.out.println(op);
	}
 
	public static LList convert2DArrintoList(int arr[][], int col, int row) {
		if (col >= arr[0].length || row >= arr.length)
			return null;
		return new LList(arr[row][col], convert2DArrintoList(arr, col, row + 1), convert2DArrintoList(arr, col + 1, row));
	}
 
	static class LList {
		LList(int data) {
			this.data = data;
		}
 
		LList(int data, LList down, LList next) {
			this.data = data;
			this.down = down;
			this.next = next;
		}
 
		LList() {
			this.data = Integer.MAX_VALUE;
		}
 
		@Override
		public String toString() {
			return " " + this.data + " ";
		}
 
		int data;
		LList next;
		LList prev;
		LList rand;
		LList down;
	}
}

Are there better ways of doing it?

Given a fully connected graph with n nodes and corresponding values. One node can interact with other node at a time, to replace/ignore/add its value to other node’s value. Assuming this operation takes 1 unit of time, how much time would it take for all the nodes to have value equal to sum of all the nodes.

Examples : Given a graph with values {1,2,3,4}, find total time it takes, such that all nodes have value as 10.

I am assuming it can be done in O(N).It will take basically two traversals, one for calculating the sum of values of nodes(first traversal), other for replacing the value of the nodes(second traversal).

It will take 2*(no of nodes) time.

Are there any better ways possible ?

Design amazon's frequently viewed product page.

Design a ESPN like system. Ensure scaling and availability. Also one should get all details like score of a player, no. of mtches etc.

Write an algorithm to determine the minimum distance required to level the entire field from the shortest tree to the tallest tree

You are in charge of organizing a golf event and recently rented out a rectangular field for the event. While the field is close to what it needs to be, it needs some landscaping. The field is flat, except for trees and trenches, and can be represented as a two-dimensional grid. The flat areas are represented as 1, areas with trenches are represented by 0, and areas with trees are represented by numbers greater than 1 indicating their heights (heights are unique). Your goal is to cut down all of the trees to level the field, but you can only cut the shortest tree on the field, at any given time. You can start from any corner of the field, as long as it is flat, and can move one block up, down, left, or right at a time. You cannot walk on trenches, cannot go through a trees, and cannot leave the field. Additionally, once a tree is cut, that area is flat and you move to that area.

Input:
(numRows = an Integer representing number of rows)
(numColumns = an Integer representing number of columns)
(field = representing 2D grid of integers)

Example-1:

Input: numRows=2, numColumns=4,
Field = [1,1,1,1];
Output: 5

Explanation:
- You start from bottom right corner
- To cut the tree of height 2, the path followed is: {{1,3}, (0,3)}
- Then to cut the tree of height 3, the path continue is: {{0,3},{1,3},{1,1},{0,1}}
- So the output is 5 as the minimum time required to level the field.

Testcase-1:
Input: 2,4
Field = [[1,1,0,1], [1,1,5,1]];
Expected Output: 1

Testcase-2:
Input: 6,6
Field =
[
[1,1,0,12,1,1],
[1,1,1,1,1, 1],
[0,1,0,0,0, 1],
[0,1,1,1,14,1],
[0,0,0,0,1, 1],
[15,1,1,1,1,1]
]

Expected Output: 14

count number of combinations which are not possible.
There are 'n' empty slots.
A slot can be filled with 'O', 'E', or 'X'
A combination is possible if
1. 'O' s are placed in odd slot , 'E' a are placed in even slots.
2. 'O' and 'E' alternate among them,
i.e (OXOE) not allowed because between O s there is no 'E'; but (OEXXO) is allowed.
some allowed combinations
OEXXX, XXOEO, OXXEX
For 3 slots, not allowed combinations are
OXX
XXO
XEX
XXX
OXO
Only those combinations are considered in which O s and E s are in their respective odd and even slots.
i.e EEXXX will never be considered because a 'E' is in odd slot
A combination isn't allowed if 'O' is not followed by 'E' or vice versa

Design a FIDS(Flight Information Display System)

1. Consider most important classes & ignore Interfaces as of now
2. FIDS is not about reservation system but the dasboard to display
3. the information will look like:

DEPARTURES
----------------------
Attributes:
STD Airline Flight Destination/Via CheckInCounter# Gate Status ETD

Values :
12:50 KingFisher 6E352 Hyderabad A-B 23 Check-In Open 13:15

ARRIVALS
-----------------------
Attributes:
STA Airline Flight# Destination/Via Gate Status ETA

Values :
12:50 KingFisher 6E352 UK/Mumbai Terminal2 Landed 13:15

Write a C code matrix multiplication in such a way that the matrix can be read in row major form only

Design a mall where there are 'm' entry gates and 'n' exit gates. There can be only 'x' number of people inside it. No more then 'x' people can be inside mall at any time.

How will you design a true collar?

Given an array of co ordinates (x,y). WAP to figure out if a square can be formed from any four points.

Given a 2d matrix and 4 points. WAP to figure out if they are row wise, column wise of diagonally wise consecutive.

The memmove() function copies n bytes from memory area src to memory area dest. The memory areas may overlap: copying takes place as though the bytes in src are first copied into a temporary array that does not overlap src or dest, and the bytes are then copied from the temporary array to dest.

Find distance between any two nodes of binary tree and binary search tree.

Identifying if all the elements of a set (in enterity) is present in a list of sets.

For example checking for set1 = {1,2} in {1,2,3}, {5,6} should return true as {1,2} is present in {1,2,3}. Similiary it will be true for {1,2,8,9}, {1,2,4}

But checking for {1,2} in {1,5,6}, {2,3,1} should return false as {1,5,6} does not contain all elements of {1,2} 2 is missing

Lazy Bartender :

There are N number of possible drinks.(n1,n2..)
Has C number of fixed customers.
Every customer has fixed favourite set of drinks.
Bartender has to create least possible number of drinks
to suffice need of all the customers
Example:
Cust1: n3,n7,n5,n2,n9
Cust2: n5
Cust3: n2,n3
Cust4: n4
Cust5: n3,n4,n3,n5,n7,n4

Output: 3(n3,n4,n5)

design an employee swap in swap out system.
The system will have a machine which records the swap in and swap out.
The user can also login in a portal where he can check his swap in /swap out time. He can correct his time also.
There will be managers for employee who can check the entry for all the employees which are under them and correct their subordinates timings also
There will be HR who can only view the entries for all the employees.
We have to come up with the HLD and LLD for the system

Given Map<char,<List<char>> and an input string. Return all possible combinations by replacing each char in input string by one char in mapped set.
e.g. 1 -> a,x; 2 -> b,y
12 -> ab,ay,xb,xy

Given an array of numbers and n, find n numbers with most occurrences

Find length of longest palindrome in a string

Implement a cache with timeouts. Keys timeout after a certain expiry time.

Convert number to text. ex. 101 One hundred and one

WAP which accepts a number and keeps track of the median of all the numbers seen till now. You do not have memory to store the entire stream of received numbers.

PhoneBook search. Given input phone book - John, JohnDavis, Ted, JackMay
Searching J should return John, JohnDavis and JackMay
Seaching JD should return JohnDavis

Enhancements to schema by adding another table lot
SELECT *
FROM Amazon_lot p,
amazon_vehicles v
WHERE p.lotid= 1
AND p.lotid = v.lotid
AND v.vehicleid = 1;

-- was struck for a moment, Interviewer helped me with hint
SELECT count(1)
FROM amazon_residents r,
Amazon_lot l,
amazon_vehicles v
WHERE r.residentid = l.residentid
AND l.lotid = v.lotid
AND r.residentid = v.residentid
AND (v.vehicleid = 1
OR v.lotid = 2);

SQL Questions & Answers ,and followup questions
given schema
Tables:
Residents:
resident_ID (num)
Apartment Number
Name
...etc

Vehicles:
vehicle_ID (num)
(FK): Resident_ID (num)
License Plate
Vehicle Size ("small", "large", "motorcycle"...)

Get all the residents who has vehicle size large
SELECT *
FROM amazon_residents res
WHERE EXISTS
( SELECT 1
FROM amazon_vehicles veh
WHERE veh.residentid = res.residentid
AND veh.type = 'large' );

-- Introduction
-- what do you know about Idemoptence, was struck for a minute, Hint - Distrubuted Systems
-- what is Network Latency, ways to improve.
-- How to improve Webserver Peformance

Given items as Shirt, Trouser, Shoes, Tie, Belt, Shocks, and dependencies as -
Tie can be worn after Shirt
Belt can be worn after Shirt and Trouser
Shocks can be worn after Trouser
Shoes can be worn after Shocks

Find various orders in which the activity of wearing clothes can be completed.

Find all the abbreviations of string:
eg
ABC
SOME Valid abbreviations are :
1BC
2C
3
A1C
AB1
A2
NOT VALID
11C(two numbers cannot occur continuously)

Given a method
public int getOccurence(int x,int y);
where y is always a single digit number.

So find the number of occurrences of number y in the range x
E.g.
if x=25,y=2
function should return 9(as 22 contains two occurrences of 2) - 2,12,20,21,22,23,24,25