Intense Technologies Associate Software Engineer Interview Questions and Answers

Round duration - 60 Minutes
Round difficulty - Medium

Q1. What are the different permutations of a string when considering cases where the 1st character is fixed, or both the 1st and 2nd characters are fixed, or the 1st, 2nd, and 3rd characters are fixed?
Ans. 
Permutations of a string with fixed characters.
• For 1st character fixed: Generate permutations for the remaining characters.

• For 1st and 2nd characters fixed: Generate permutations for the remaining characters.

• For 1st, 2nd, and 3rd characters fixed: Generate permutations for the remaining characters.
Answered by AI
Add your answer
Q2. 
0/1 Knapsack Problem Statement
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...read more
Ans. 
Yes, the 0/1 Knapsack Problem can be solved using dynamic programming with a space complexity of not more than O(W).
• Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.

• Iterate through each item and update the array based on whether including the item would increase the total value.

• The final element of the array will contain the maximum value that can be stolen within the we
Answered by AI
View 1 more answer

Q1. Basic core java questions
Add your answer