Intuit visited our campus for intern and FTE roles for freshers. They conducted an online assessment round
- Type of Round- Online Assessment
- Time Allocated- 90min
- No of Questions asked- 4
Questions:
- Employee Reward: You have been a phenomenal employee of your company so your boss is going to give you some bonus money. however to get the maximum bonus he has given you a coding challenge with a number K and has given a string S of digits denoting a positive integer. your bonus will be largest number possible by performing swaps operations on the digits of S at most Ktimes. Article Link: https://www.geeksforgeeks.org/find-maximum-number-possible-by-doing-at-most-k-swaps/amp/
Practice Link: https://www.geeksforgeeks.org/problems/largest-number-in-k-swaps/0 - Boolean Parenthesis: https://www.geeksforgeeks.org/boolean-parenthesization-problem-dp-37/amp/. it was a hard dp problem Practice Link: https://www.geeksforgeeks.org/problems/boolean-parenthesization5610/1
- Chocolate bags a classical DP problem: https://www.geeksforgeeks.org/minimum-cost-to-fill-given-weight-in-a-bag/amp/ Practice Link: https://www.geeksforgeeks.org/problems/minimum-cost-to-fill-given-weight-in-a-bag1956/1
- I don’t remember the question but it was an easy problem based on loops