CareerCup

Linux command to read last 10 lines of a file :

tail -n <number_of_lines> /path/to/file

Hello,
Do you have any sample tables?
The query will return department_name and sum of salary from dept table. Right joining a table will return everything on the table emp where department number from both the table are same.

The field in Customer_branch are cust_id and branch. What is branch is it branch_id or branch_nm.

The query according to me should be:

SELECT cust_id from Customer_Branch CB, Deposit_branch DB
LEFT JOIN Bank_Branch ON CB.branch_id = BB.Branch_id
AND CB.cust_id = DB.cust_id

There are two questions:
Code: Is there a particular coding done to each character? Like A= 1, B=2 ....

Storage: Not sure about the specifics but using apace commons IO or streaming through file will be most efficient.

public static void print(Integer[] arr) {
        for (int i = 0; i < arr.length; i++) {
            if (i == arr[i]) {
                System.out.println(arr[i]);
            }
        }
    }

Can you please elaborate the question more?

My understanding: have a table of all the products and identify them with a uniques number lets call it UIN (Unit Identification Number). Now depending on the product it can have sub-categories and sub-sub categories.

Ex: Adidas shoe :- identified by (1000)
-- can have subcategories according to color or size.
--maintained in main table named products (UIN (PK), subcategory_code (FK), description, value)
-- using the foreign key we can map the subcategory table (UINS, description, value)

Java has a very easy implementation to subscribing a queue. Using annotation
We can pull all the properties: port, hostname, virtual host, username, password in application.yml

@RabbitListener("Queue_Name")
public void listen(Message message) {
//unmarshal it to the object here and perform operations.
}

Hey, I'm a little confused, are all the application reading from the queues? And same order as in whatever message is read first will be put to DB first. If you want to store data to DB you can make it thread safe or transactional.

import java.util.*;
class Anagrams {

  static boolean isAnagram(String a, String b) {
        char c[] = a.toLowerCase().toCharArray();
        char d[] = b.toLowerCase().toCharArray();
        Arrays.sort(c);
        Arrays.sort(d);
        if(Arrays.equals(c,d)){
            return true;
        }
        return false;
    }



  public static void main(String[] args) {
     Scanner scan = new Scanner(System.in);
    System.out.println("Enter first String: ");
    String a = scan.next();
    System.out.println("Enter seconf jumbled String");
    String b = scan.next();
    scan.close();
    boolean ret = isAnagram(a, b);
    System.out.println( (ret) ? "Anagrams" : "Not Anagrams" );
    }
}

Hey, I think you misunderstood the question, We don't have to print out the properties we have to rent out the messages send to the queue.

Having 500 is internal server error, that shouldn't be the case, even if the query is rolled back or the transaction didn't commit we can handle that with custom exception!!

This problem should be solved using binary representation.

Lest assume the poison takes 2 hours to affect, the solution of 1 rat is not feasible as we will have to wait to lot of time to determine which bottle is poisoned. The simple solution is by using binary representation lets assume bottle 3rd is poisoned.

Step 1) represent all the bottles using binary representations.

Bottle 1 : 0001
Bottle 2 : 0010
Bottle 3 : 0011 (Poisoned)
Bottle 4 : 0100


Step 2) Arrange all the rats in a line.
Step 3) according to the bottles binary representation git a drop of wine to the rats for digit 1.
Rat1 Rat2 Rat3 Rat4
- - - -
0 0 0 1
0 0 1 0
0 0 1 1
0 1 0 0

Now according to our assumption all the rats which were given a drop from bottle 3 Should die. which would be rat 3 and rat 4.
Assume the red rats to be 1's and alive rats to be 0's which comes out to (0011) which is exactly the number of our bottle.

This approach kills 2 Rats. There's no where mentioned that we should try to keep as many rats alive possible.

import java.util.Arrays;

public class Solution {
	
	public static void Squares(int arr[]){
		int length = arr.length;
		int arr1[] = new int[length];
		int j=0;
		for(int i=0;i<length;i++){
			arr1[j] = arr[i] * arr[i];
			j++;
		}
		Arrays.sort(arr1);
		for(j=0;j<arr1.length;j++){
			System.out.println(arr1[j]);
		}
	}

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int arr[] = {-3,-1,0,2,4};
		Squares(arr);
	}

}

import java.util.Scanner;

public class ApplyingCurveToGradesCC {
	
	static void applyCurve(int arr[], int raise){
		int n = arr.length;
		System.out.println("Grades after applying the curve are: ");
		for(int i=0;i<n;i++){
			if(arr[i] >= 100){
				System.out.println(arr[i]);
			}
			else{
				arr[i] = arr[i]+raise;
				if(arr[i] >= 100 ){
					System.out.println("100");
				}
				else
					System.out.println(arr[i]);
			}
				
		}
	}

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in = new Scanner(System.in);
		
		System.out.println("Enter the size of Grade Array : ");
		int n = in.nextInt();
		int Garr[] = new int[n];
		System.out.println("Enter the Grades : ");
		for(int i=0;i<n;i++){
			Garr[i] = in.nextInt();
		}
		System.out.println("Enter the curve to be applied: ");
		int raise = in.nextInt();
		applyCurve(Garr,raise);
	}
	

}

package com.Practice;

public class DiceGameCC {
	
	static int sum(int arr[]){
		int total =0;
		int n = arr.length;
		for(int i=0;i<n;i++){
			total = total+arr[i];
		}
		return total;
	}
	
	public static int randomNum(int min, int max){
		
		int randomNum = min + (int) (Math.random() * (max - min)+1);
		//System.out.println("Num  "+randomNum);
	    return randomNum;
	}
	
	
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
		System.out.println("Player 1 turn : ");
		int player1[] = new int[10];
		for(int i=0;i<10;i++){
			player1[i] = randomNum(0,6);
			System.out.print(player1[i] +" ");
		}
		System.out.println(" ");
		
		System.out.println("Player 2 turn : ");
		int player2[] = new int[10];
		for(int i=0;i<10;i++){
			player2[i] = randomNum(0,6);
			System.out.print(player2[i]+" ");
		}
		System.out.println(" ");
		
		if(sum(player1) > sum(player2)){
			System.out.println("Player 1 wins with score : "+(sum(player1)));
		}
		else
			System.out.println("Player 2 wins with Score : "+sum(player2));
	}

}

Hey,
Go to Glassdoor and see what type of questions they have asked in previous interviews. it will help a lot.

How do you get 64 as certain votes?
25 are from developing cities. and we get all votes from 3 developed cities so maximum should be 84
25 + (17+20+22) = 84.

import java.util.Scanner;

public class CommonStringCC {
	
	
	public static void CommonAlp(String s, String s1){
		char[] a = s.toCharArray();
		char[] b = s1.toCharArray();
		
		for(int i=0;i<a.length;i++){
			for(int j=0;j<b.length;j++){
				if(a[i] == b[j]){
					System.out.print(a[i]);
				}
			}
		}
	}

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
		Scanner in = new Scanner(System.in);
		System.out.println("Enter the Strings : ");
		String c1 = in.next();
		in.nextLine();
		String c2 = in.nextLine();
		
		CommonAlp(c1,c2);
	}

}