Software Engineer

Step 1: I first approached the problem using a brute force solution, where I generated all possible subsets of the items and checked for the ones that met the weight constraint.
Step 2: I then realized that this approach would not work for large inputs and thus, implemented a dynamic programming solution, specifically the 0-1 knapsack algorithm.
Step 3: I created a 2D array to store the maximum value that can be obtained for a given weight and number of items.
Step 4: I then iterated through the array, comparing the maximum value that can be obtained by including the current item versus not including it.
Step 5: I returned the value stored in the last cell of the 2D array as the maximum value that can be obtained.

Can you explain stepwise how you solved this problem?
Step 1: I first thought of using a for loop to iterate through the string and swap the first character with the last one, second with the second last and so on.
Step 2: I then realized that this method would only work for even length strings and would not be efficient for large strings.
Step 3: I then thought of using a stack to push all the characters of the string and then pop them one by one to get the reversed string.
Step 4: I also considered using recursion to reverse the string by calling the function with the substring from index 1 to n-1 and then appending the first character of the original string at the end.

Prepare well before the interview. Can't solve it if you have not done practice before

Tip 1: Go to company carrier page to know about the company
Tip 2: Look out for latest news about the company