SDE - 1

Given an array of distinct integers, find all the pairs having positive value and negative value of a number that exists in the array. Return the pairs in any order.

Note:

The pair consists of equal absolute values, one being positive and another negative.

Return an empty array, if no such pair exists.

I was asked to design the Splitwise app APIs in my favorite language using the editor of my choice—design Splitwise APIs with the following functionalities - 1. Create User2. Create Group3. Add user to group.4. Add Bill to a Group.5. Get balance/settlement of a group.6. Get balance/settlement of a user.7. Allow configurable option to simplify the debts of users in a group. Additional: 1 user can be part of multiple groups, and 1 group can have multiple users and multiple bills.

You have been given two integers ‘X’ and ‘Y’ which are the first two integers of a series and an integer ‘N’. You have to find the Nth number of the series using the Fibonacci rule given by f(x) = f(x - 1) + f(x - 2).

The answer may be very large, return it after modulus 10 ^ 9 + 7.

Note:

The series is 1-based indexed.

You are given ‘N’ words of various lengths, now you have to arrange these words in such a way that each line contains at most ‘M’ characters and each word is separated by a space character. The cost of each line is equal to the cube of extra space characters required to complete ‘M’ characters in that particular line. Total cost is equal to the sum of costs of each line.

Your task is to form this arrangement with the minimum cost possible and return the minimum total cost.

Note:

The length of each word should be less than or equal to ‘M’.

You can’t break a word, i.e. the entire word should come in the same line and it must not be the case that a part of it comes in the first line and another part on the next line.

Mostly, the interviewer enquired about the projects I did in my previous organizations, trying to find out the breadth I have worked on and judge whether I knew about it.