Saturday, 16 February 2019

Salesforce Interview Experience

Salesforce Interview Experience - Security Team

Got a chance to interview with the salesforce security team.

Paytm Interview Experience

Paytm Interview Experience

Coding Round 1
Q1 You have to make a necklace with pearls. Minimum number of pearls that can be used is 1 and maximum is n. Each pearl has a magnificence coefficient and the necklace should be such that the pearls are in ascending order of their magnificence. Find such number of necklaces that can be formed with given condition.
Input given is n (no of pearls), Lowest magnificence and highest magnificence.
Example n= 1, LM= 8 HM=9, so there can be 2 cases, one necklace with pearl 8 and one with pearl 9.

Q2 Write a program to find sum of first largest k elements from a given array of integers?

Microsoft IDC Interview Experience

Microsoft IDC Interview Experience


Round1
Q1 Write a program for maximum sum contiguous subarray.
Q2 Below string is encoded in a matrix in below fashion. Logic to decode the string

Sunday, 26 August 2018

Broctagon Fintech Software Engineer Challenge

Broctagon Fintech Software Engineer Challenge


Red and Blue Rangers
Red and Blue Rangers are sent for a fight. Each ranger has a power where it can only kill the villans who have powers in their range.

More precisely, Red ranger is given a range of 1 to A, both inclusive and Blue ranger is given a range of B to C both inclusive. To make sure that villans don't predict this range, following constraints hold-
1 <= B <= C
B <= A <= C