SDE - 1

Splitwise type application was to be implemented, no database or FE UI required, a basic terminal app. We can add expenses of two types shared equally, and with custom shares. Example of equally shared expenses. A pays 50 rs for a group of 5 people so all 5 people owe A 10 rs, If A himself is a part of the group of 5 people other 4 people owe him 10rs each. Example of custom share expense A pays 30 rs for an expense for a group of 3 people A B and C, share of B is 20 rs and share of C is 5 rs, both B and C owe A exactly what their share was Input will consider of Statements such as EXPENSE EQUAL A 10 3 A B C(an expense where A paid 10 rs for a group of 3 - A B C and they all owe equal shares )EXPENSE CUSTOM A 30 2 A B 20 10(an expense where A paid 20 rs for a group of 2 - A and B and B owes 10 rs to A for the expense)OUTPUT A(this should show all balances for A, the money he owes to others and the money he is owed)Example Ouput - A owes 20 to BA is owed 30 by BOUPUT(this command should display all expenses between all parties)

You are given an integer ‘N’, your task is to return the number of structurally unique BST's (binary search trees) which have exactly 'N' nodes of unique values from 1 to 'N'.

For example:

Given  ‘N’ = 2, The total number of BST’s is 2.

Note:

1. A binary search tree is a rooted binary tree whose internal nodes each store a key greater than all the keys in the node's left subtree and less than those in its right subtree.

2. A structurally unique binary search tree is a tree that has at least 1 node at a different position or with a different value compared to another binary search tree.

You are given a string 'STR' containing lowercase English letters from a to z inclusive. Your task is to find all non-empty possible subsequences of 'STR'.

A Subsequence of a string is the one which is generated by deleting 0 or more letters from the string and keeping the rest of the letters in the same order.

What are your hobbies?

Can you handle pressure?