CareerCup

Your organization is opening a new warehouse and your manager has tasked you with figuring out how to quickly get some of the inventory in the original warehouse to the new warehouse. You are given a list of the locations of all N packing crates in the facility, any of which is a candidate to be moved to the new facility. All crates are the same size, and the truck has capacity to move exactly M of them. The delivery driver needs to leave promptly, so it is your job to find the crates that are closest to the truck. Crates are heavy, so you can only carry one at a time.

Given an array of the locations of N packing crates, implement an algorithm to find the locations of the M crates closest to the truck.

Input
The input to the function/method consists of three arguments:
totalCrates, an integer representing the total number of packing crates in the facility (N)allLocations, a list where each element consists of a pair of integers representing the x and y coordinates of the packing crates;
truckCapacity, an integer representing the number of packing crates that will be moved to the new facility (M).
Output
Return a list of integers where each element of the list represents the x and y coordinates of the packing crates that will be moved to the new facility.
Constraints
truckCapacity
totalCrates
Note You begin at the truck’s location [0, 0].The distance of the truck from a warehouse location (x, y) is the square root of x^2 + y^2.If there are ties then return any of the locations as long as you satisfy returning M points.
Example Input:totalCrates = 3allLocations = [[1, 2], [3, 4], [1, -1]]
truckCapacity= 2 Output:[[1, -1], [1, 2]]
Explanation:The distance of the truck from point [1, 2] is square root(5) = 2.236 The distance of the truck from point [3, 4] is square root(25) = 5 The distance of the truck from point [1, -1] is square root(2) = 1.414 num is 2, hence the output is [1, -1] and [1, 2].

Write a method called createArray that accepts 4 parameters: number of rows, number of columns, a and b.
This method creates a 2-D array of number rows and columns as given in the parameter, then fills the array
with random values between a and b.
Write another method called checkColumn which accepts the position of the column, the min and max
elements of the array as parameter and returns true if the column contains both the minimum value and
maximum value, false otherwise.
Finding the min and max can be done in the main.
Sample run:
Enter number of rows and columns: 3 2
Enter 2 integers: 25 40
Array Elements:
26 32
39 28
27 30
Minimum: 26 Maximum: 39
Enter the position of the column to check: 0
Column 0 contains both min and max.

We need to develop a game that allows two players to throw a dice ten times and the player who gets the
highest sum wins the game.
 Write a method sum(int[] values) that returns the sum of elements of the array values.
 Write a method display(int[] values) that displays the elements of the array values.
 Write a main method where you should:
a) Create two arrays of integers called player1 and player2 with size 10 both
b) For each player, generate ten random integers between 1 and 6 inclusively. The generated values
are added to the associated array of each player.
c) Display the generated values for each player.
d) Find and display the winner using the sum method.
Sample run
Generated numbers for player 1 are: 6 6 3 1 2 1 4 6 5 4
Generated numbers for player 2 are: 6 2 2 4 2 1 1 5 2 4
Player 1 wins with score 38

[Applying a curve to grades] Write a method called “applyCurve” that takes as a parameter a single-
dimensional array called “grades” of integers and a single value integer called “raise”. This method should
modify the array “grades“, which contains the grades of students in a way that each value in the array is
added to it the curve value “raise”. You should check that the grades after applying the raise does not exceed
100.
For example, if array “grades” contains the following values:

95 100 24 43 76 51 87
0 1 2 3 4 5 6

After calling the method “applyCurve” with a raise value +7 the array grades would be as follows:

100 100 31 50 83 58 94
0 1 2 3 4 5 6

Write a test program (main) that prompts the user to enter the size of an array, the grades and the required
curve and then displays the grades after applying a required curve.
Sample run
Enter the array size: 7
Enter the grades: 95 100 24 43 76 51 87
Enter the required curve: 7
The grades after applying + 7 are: 100 100 31 50 83 58 94

For given list of numbers find out triplets with sum 0
Input : arr[] = {0, -1, 2, -3, 1}
Output : 0 -1 1
2 -3 1

Given a String and dictionary of words, break the string in minimum space sentence.
Ex:
inputStr = "ilikefacebook"
dictionary = {"i","like","face","book","facebook"}
Possible Strings:
i like face book - 3 spaces
i like Facebook - 2 spaces - this is expected answer.

How do you reverse the words in a linked list?
For ex, Convert " H-e-l-l-o- -W-o-r-l-d " (There is a space between the word), into " o-l-l-e-H- -d-l-r-o-W "

Write a Java code to use as less Space Complexity as possible. (So not too many spaces should be used)

Linked List Structure:

class Node {
	char val;
	Node next;
}

Write a custom implementation of BlockingQueue using only intrinsic locking constructs in Java

Write a program to generate the anagrams of a word

Write a program to reverse a string

What is the output of following code snippet?

public static void main(String[] args){
    int[][] data = {{123},{4,5,6}};
    int[][] copy = data.clone();
    
    copy[0][0] = 100;
    
    System.out.println(data[0][0]);
    System.out.println(copy[0][0]);
    
    copy[1] = new int[]{300,400,500};
    
    System.out.println(data[1][1]);
    System.out.println(copy[1][1]);
 }

What would be the output of below code snippet?

class Super {
    int index = 5;
    public void printVal(){System.out.println("Super");}
}

class Sub extends Super {
    int index = 2;
    public void printVal(){System.out.println("Sub");}
}

public class OopTest {
    public static void main(String[] args){
        Super sup = new Sub();
        System.out.println(sup.index + " ");
        sup.printVal();
    }
}

Given a binary tree of integers, write code to store the tree into a list of integers and recreate the original tree from a list of integers.

Here's what your method signatures should look like (in Java):

List<Integer> store(Node root)
Node restore(List<Integer> list)

Example Tree:

5
/ \
3 2
/ / \
1 6 1

What would be the result of executing the below code snippet?

public class CountDownLatchDemo {
    public static void main(String[] args)throws InterruptedException {
        final CountDownLatch latch = new CountDownLatch(3);
        latch.countDown();
        latch.countDown();
        new Thread(){
            public void run(){
                try{
                    Thread.sleep(3000);
                }catch(InterruptedException ex){
                    ex.printStackTrace();
                }
                latch.countDown();
            };
        }.start();
        System.out.println("Before");
        latch.await();
        System.out.println("After");
    }
}

How many elements will the set object in the below snippet will contain after the program executes to last print statement?

public class ShortSetTest {
    public static void main(String[] args){
        Set shortSet = new HashSet();
        for(short i = 0; i < 100; i++){
            shortSet.add(i);
            shortSet.remove(i-1);
        }
        System.out.println(shortSet);
    }
}

Will the following class compile?

public class WildCardGeneric {
    private static void add(List<? extends Number> list){
        list.add(4);
        list.add(8);
        System.out.println(list.get(0));
    }
}

What would the output of the following snippet?

public class TrickyNum<X extends Number> {
    private X x;
    public TrickyNum(X x){
        this.x = x;
    }
    private double getDouble(){
        return x.doubleValue();
    }
    public static void main(String[] args) {
        TrickyNum<Integer> a = new TrickyNum<Integer>(new Integer(1));
        System.out.println(a.getDouble());
    }
}

What happens when you try to compile below class?

public class EnumTest {
    public EnumTest(){
        System.out.println("Inside Constructor");
    }
    public void printType(){
        enum PrinterType {DOT,INK,LASER}
    }
}

Given below code snippet, what would be the output?

public class DemoThread extends Thread {
    private int x = 2;
    public static void main(String[] args) throws Exception {
        new DemoThread().method();
    }
    public DemoThread(){
        System.out.println("test");
        x = 5;
        start();
    }
    public void method() throws Exception {
        join();
        x = x - 1;
        System.out.println(x);
    }
    public void run(){
        System.out.println("run");
        x *= 2;
    }
}

For code snippet given below, what would be the output?

String s8 = "AB";
        String s9 = s8.intern();
        if(s9.equals(s8) && s9 == s8)
            System.out.println("All Equal");
        if(s9.equals(s8) && s9!=s8)
            System.out.println("equals Equal");
        if(!s9.equals(s8) && s9==s8)
            System.out.println("== Equal");
        if(!s9.equals(s8) && s9!=s8)
            System.out.println("Nothing Equal");

Programming Exercise – FX Calculator
Your task is to create a console-based currency converter application.
Requirements
The application allows a user to convert an amount in a specific currency to the equivalent amount in another currency.
Your calculator should allow a user to enter an amount in any of the known currencies, and provide the equivalent amount in another currency.
Your calculator should parse console input like "<ccy1> <amount1> in <ccy2>", and provide a suitable response.
For example:
%> AUD 100.00 in USD
AUD 100.00 = USD 83.71
%> AUD 100.00 in AUD
AUD 100.00 = AUD 100.00
%> AUD 100.00 in DKK
AUD 100.00 = DKK 505.76
%> JPY 100 in USD
JPY 100 = USD 0.83
If the rate cannot be calculated, the program should alert the user:
%> KRW 1000.00 in FJD
Unable to find rate for KRW/FJD
When displaying amounts back to the user, they should be formatted with the precision given below:
AUD=2 decimal places

Write a function that returns true if the binary representation of an integer is a palindrome.

9 = 1001 = palindrome
8 = 1000 = not palindrome

Write a Program in Java, You have an Employee class |
class Employee{
String name;
Integer id,
Employee manager
}
Each employee has a manager and the manager of CEO is null. Find all direct and indirect reportees of a manager.
Eg. Say Employee e1 reports to CEO,
e2 and e3 reports to e1,
e4 and e5 reports to e2,
e6 reports to e3.
Then by giving e1 as input, output should be e2, e3, e4, e5 and e6.

import java.time.Duration;
import java.time.LocalTime;
import java.util.List;
import java.util.Map;

// Your goal is to write business logic for a very simple Restaurant booking system
// You are encouraged to refactor exisiting code, create other classes, write helper methods etc
// You also need to make sure that the implementation works correctly


class Reservation
{
    public String name;
    public int partySize;
    public LocalTime startTime;
}

class Table
{
    public int tableNumber;
    public int maxPartySize;       
}

class Restaurant
{
 
    public List<Table> tables;   
    public LocalTime openTime;
    public LocalTime closeTime;
    public Map<Integer, Duration> reservationDurationsPerPartySize;
    
    // Returns a Table if Reservation could be booked, null otherwise
    // Booking rules: 
    // 1) Reservation could be made only when the Restaurant is open.
    // 2) Only one Reservation can be seatted a Table at any time.
    // 3) Reservation can be seatted only at a Table of the same or a bigger size.
    // 4) Reservation should stay on the same Table for the whole Duration.
    // 5) Reservation Duration is determined by PartySize.


    public Table bookReservation(Reservation reservation) {
	//TODO:

}
}

Given set of N number of points/Co-ordinates[(x1,y1),(x2,y2), (x3,y3), (x4,y4), (x5,y5), etc] find if any of them form square.

You have L, a list containing some digits (0 to 9). Write a function answer(L) which finds the largest number that can be made from some or all of these digits and is divisible by 3. If it is not possible to make such a number, return 0 as the answer. L will contain anywhere from 1 to 9 digits. The same digit may appear multiple times in the list, but each element in the list may only be used once.

{{
Test cases
==========

Inputs:
(int list) l = [3, 1, 4, 1]
Output:
(int) 4311

Inputs:
(int list) l = [3, 1, 4, 1, 5, 9]
Output:
(int) 94311
}}

My Solution:
{{

package com.google.challenges;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;


public class Answer {
public static int answer(int[] l) {

// Your code goes here.
ArrayList<Integer> list0 = new ArrayList<>();
ArrayList<Integer> list1 = new ArrayList<>();
ArrayList<Integer> list2 = new ArrayList<>();
int sum =0;
Arrays.sort(l);
for(int i = 0; i<l.length; i++){
if(l[i] % 3 == 0){
list0.add(l[i]);
}else if(l[i] % 3 == 1){
list1.add(l[i]);
}else{
list2.add(l[i]);
}
sum += l[i];
}

if(sum%3==0){
StringBuilder strNum = new StringBuilder();
for(int i = l.length-1; i >= 0; i--)
{
strNum.append(l[i]);
}
return Integer.parseInt(strNum.toString());
}else if(sum%3 == 1){
if(list1.size()>0){
Collections.sort(list1);
list1.remove(0);
}else if(list2.size() >= 2){
Collections.sort(list2);
list2.remove(1);
list2.remove(0);
}else{
return -1;
}
}else if(sum%3 == 2){
if(list2.size()>0){
Collections.sort(list2);
list2.remove(0);
}else if(list1.size() >= 2){
Collections.sort(list1);
list1.remove(1);
list1.remove(0);

}else{
return -1;
}
}
list0.addAll(list1);
list0.addAll(list2);
StringBuilder strNum = new StringBuilder();
Collections.sort(list0);
for(int i = list0.size()-1; i >= 0; i--)
{
strNum.append(list0.get(i));
}
return strNum.length() > 0 ? Integer.parseInt(strNum.toString()) : -1;
}
}
}}

But here I am able to pass 4 test cases out of 5. Therefore I am looking for scenario which is left to check.
Can someone help me?

Alex has recently decided to learn about how to design compilers. As a first step he needs to find the number of different variables that are present in the given code.


So Alex will be provided N statements each of which will be terminated by a semicolon(;). Now Alex needs to find the number of different variable names that are being present in the given statement. Any string which is present before the assignment operator denotes to a variable name.

Input Format: :

The first line contains a single integer N


Each of the next N lines contains a single statement.

It is guaranteed that all the given statements shall be provided in a valid manner according to the format specified.

Output Format: :

Print the number of different variable name that are present in the given statements.


Sample Input
2
foo = 3;
bar = 4;
Sample Output
2
Explanation
Foo and Bar are only two variables used inside the statements so answer is 2.

Write a Code
Steve is going to throw a party at his place tonight.He needs to visit two shops near his home-the first shop is d1 meters away from his place,the second shop is d2 meters away from his place, and there are d3 meters between these two shops.Calculate the minimum distance he needs to walk to visit both both shops and return back home. Steve always start from his palce.He can only travel using these 3 routes.HE can use any route any amount of time necessary,the only thing he needs to achieve is the minimum distance.
Find the minimum distance Steve has to walk to visit both shops and return home.
input: 1,1,1
output: 4
input: 10,20,30
output: 60

Write a Java Program in which a class takes four integer arguments as input(a, b, c and d). Do addition of (a+b) on one thread, addition of (c+d) on another thread and multiplication of(a+b) * (c+d)) on main thread.
Like: Thread1 = (a+b)
Thread2 = (c+d)
Main Thread = (Thread1 * Thread2)

LinkedList Reverse