GeeksforGeeks Question · Jul 2025 · San Francisco

Intuit Interview Experience | On-Campus-2021

Question Details

Intuit visited our campus for intern and FTE roles for freshers. They conducted an online assessment roundType of Round- Online AssessmentTime Allocated- 90minNo of Questi...

Full Details

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/dsa/find-maximum-number-possible-by-doing-at-most-k-swaps/ Practice Link: https://www.geeksforgeeks.org/problems/largest-number-in-k-swaps-1587115620/1 Boolean Parenthesis: https://www.geeksforgeeks.org/dsa/boolean-parenthesization-problem-dp-37/ . 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/dsa/minimum-cost-to-fill-given-weight-in-a-bag/ 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

About This Question

This is a reported interview question from a intuit interview for a swe role (intern level) during the oa round reported in 2025.

It covers the following topics: Strings, Dynamic Programming .

Difficulty rating: Easy