CareerCup

What is the maximum loan amount I can get with a personal loan in India?

What is the maximum loan amount I can get with a personal loan in India?

# input data

payload.custId

payload.custId.addr.addr1.details1
payload.custId.addr.addr2.details2

payload.accountId

payload.counterPartyId

payload.counterPartyId.insurance1.insuranceDetails1
payload.counterPartyId.insurance2
payload.counterPartyId.insurance3

Above contents are dynamic and based on that below collection object will get created.


# expected output

payload
custId
addr
addr1
details1
addr2
details2

accountId
counterPartyId
insurance1
insuranceDetails1
insurance2
insurance3

Any help would be appreciated.

Expected output should be in the form of collection object like Map<String, set<Map, Set<String>>>. This is my understanding if required please provide your thoughts.

When i am installing hadoop in my machine i find out there are two stable files preset in apache hadoop website. First one is hadoop-1.2.1.bin.tar.gz and second one is hadoop-1.2.1.tar.gz. So basically what is the difference of two files. My guess is hadoop-1.2.1.bin.tar.gz file is used as source code of hadoop and hadoop-1.2.1.tar.gz is contains all HDFS application.

Hello,
I have linkedin sre on site interview and wondering some insight on code review section interview.

Thanks

You are given a deck containing N cards. While holding the deck facedown:

1. Deal all the cards facedown onto a table into Y piles like you would if you were playing with a group of people (i.e. card 1 to P1, card 2 to P2, ..., card Y to PY, card Y + 1 to P1, etc).
2. Combine all the piles into a deck by placing P1 onto P2, then P1+P2 onto P3, and so on. This is a round.
3. Pick up the deck from the table and repeat steps 1-2 until the deck is in the original order.
4. For each round, vary the pile count according to a repeating pattern. Start with 3 piles, then 4, then 5, then loop back to 3, then 4 and so on.

Design and implement the ATM cash dispenser. User will request for some amount and you have to return the currency note and its count.

Example1: You have the following notes in ATM

2000-1, 500-5,200-4 and 100 - 4
Input - 1700
Output: 500-3,200-1

1: You have the following notes in ATM

2000-1, 500-1,200-4 and 100 - 0
Input - 600
Output:200-3

Hi,

I applied to this position as I heard from a friend that this team is aggressively hiring and the work culture looks good.

amazon.jobs/en/jobs/1539363/software-development-engineer-alexa-ai

I match all the requirements. Except kinesis and storm but I read up about it.

Should I apply without that experience or should I do a small project and then apply?

Thanks,
Praful

Question 2: Suppose there are n jobs and n workers. The cost paid to worker i to do job j is Ci,j. Each job is performed by only one worker and vice versa. Find a way to hire workers so that the total cost is minimal. Use design techniques to write algorithms to solve the above problem.
Question 3: Given a square grid of level n, each cell is assigned a natural number. At a cell, you can move to another cell in the following directions: down, to the right (the next cell next to the bottom and to the right). Find the path from the first cell (1,1) to the cell (n,n) such that the sum of the cells passing through is minimal. Design an algorithm to solve this problem.
Please help me solve these 2 questions!
Thank you so much

Hey peeps,

I am in the process of applying for a software job in which C# skills are required. Just wanted to know what are the commonly asked C# problems do interviewers ask to implement.

Hi,

Did anyone recently complete the Microsoft Online Technical Screen (OTS) and know what to expect? This is the 60 minutes online assessment on codility that comes after the recruiter screen. I am specifically looking for the type of questions they are asking to know what to prepare for.

You have an integer array. Starting from arr[startIndex], follow each element to the index it points to. You continue to do this until you find a cycle. Return the length of the cycle. If no cycle is found return -1

forexample {1, 0}, 0) => 2
{1, 2, 0}, 0) => 3

Hi
I am a student and in 2021 i will be passing out from school. I love coding and i am comfortable in java. I want to prepare for coding interviews and want to land a job at a top company. I really want to start my prep from now. Is it a good idea?

Hi,
I have received an email from Amazon recruiter that you got selected for SDM role. But it's been 2 weeks i didn't get offer details..Not sure why they are delaying it.. ?

Examples:
(((abc))) --> abc
(ab(c)) --> ab(c)
(abc09%(c)) --> abc09%(c)
ab(c) --> ab(c)
(ab)c --> (ab)c
abc(c)) → INVALID
(abc)(def) --> (abc)(def)
(abc)typ(def) --> (abc)typ(def)
((abc)(def)) --> (abc)(def)

I got 5-6 online assessments from Amazon , and I attended all the assessment. But no response from their end. It would be better if they would have given response. Its been demotivated when you try harded and you are not even informed. Its been 3 months.

Hi- I bought the book Cracking The Coding Interview. I am finding it hard to recreate these test practice questions in SAP ABAP language which is what I will be tested during my interview. Does anyone have any hints on this? I am not finding much resources online or even YouTube videos that describe how to prepare for this test using SAP ABAP. Thank you!

Cool Drink: Kenny loves Coca Cola.

- There are 'n' different shops in his colony from which he can buy coca cola.

- Each shop has different rate for the same coca cola bottle

- Kenny decided to buy his favorite cool drink for 'm' continuous days.

- Each day Kenny has 'p' money in his hand.

Find out from how many shops, Kenny can buy his favorite cool drink each day.

Prototype: Int[] find TotalShops(int input1, int[] input2 int input3, int] input4)

input1 - Total No. of shops in the colony
input2 - Rate of cool drink in each shop
input3 - No. of days, Kenny is going to buy the cool drink
input4 - Total money, Kenny has with him to buy cool drink, each day


output - No. of shops, in which, Kenny can buy cool drink, each day

Ex - input1 - 5
input2 - {3,10,8,6,11}
input3 - 4
input4 - {1,10,3,11}

output - {0,4,1,5}

write the functions char * reverse (char * nap, int n) - reverse the string nap except the character at position n (and its "symmetrical" equivalent) and return the inverted string as a result.
Example:

char tab[9]="abcdefgh";

cout << reverse(tab,3);

Output: hgfdecba // d is on same position

Hello,
I am 2019 passout from a tier 3 college with 9 months of experience right now. My coding skills are average and I work in Java.