SDE - 1

A thief is robbing a store and can carry a maximal weight of W into his knapsack. There are N items and the ith item weighs wi and is of value vi. Considering the constraints of the maximum weight that a knapsack can carry, you have to find and return the maximum value that a thief can generate by stealing items.

Given an array arr of N integers that may contain duplicate integers. The task is to return the count of subsets of the given array such that each subset contains only distinct elements.

You are given a Singly Linked List of integers. You need to reverse the Linked List by changing the links between nodes.
You do not need to print anything, just return the head of the reversed linked list.

Assuming the best cricketer playing with the best strategy. How many maximum runs he can score in IPL satisfying all rules of cricket and no wide balls?

• How was your Interview Experience? 
• What difficulty did you face this time in the Virtual Recruitment Process? 
• If the Questions were relevant those were asked in the Interviews? 
• Have you worked in a Team Before?
• If you will have a contradiction with your colleague then how will you sort this?
• What major Projects did you have made ?
• If not D.E Shaw then What?
• Next Five Year Goals ?