Infosys Interview Experience

Given an integer array ‘A’ of size ‘N’ and an integer ‘K'. Split the array ‘A’ into ‘K’ non-empty subarrays such that the largest sum of any subarray is minimized. Your task is to return the minimized largest sum of the split. A subarray is a contiguous part of the array. Example: Input: ‘N’ = 5, ‘A’ = [1, 2, 3, 4, 5], ‘K’ = 3 Output: 6 Explanation: There are many ways to split the array ‘A’ into K consecutive subarrays. The best way to do this is to split the array ‘A’ into [1, 2, 3], [4], and [5], where the largest sum among the three subarrays is only 6. Input Format The first line contains one integer, ‘N’, denoting the size of the array ‘A’. The second line contains ‘N’ integers denoting the elements of the array ‘A’. The third line contains one integer, ‘K’, denoting the number in which array ‘A’ should be split. Output format: Return the minimized largest sum of the split. Note:- You don't need to print anything. Just implement the given function.

You are given 2 non-empty strings 's1' and 's2' consisting of lowercase English alphabets only. In one operation you can do either of the following on 's1': (1) Remove a character from any position in 's1'. (2) Add a character to any position in 's1'. Find the minimum number of operations required to convert string 's1' into 's2'. Example: Input: 's1' = "abcd", 's2' = "anc" Output: 3 Explanation: Here, 's1' = "abcd", 's2' = "anc". In one operation remove 's1[3]', after this operation 's1' becomes "abc". In the second operation remove 's1[1]', after this operation 's1' becomes "ac". In the third operation add 'n' in 's1[1]', after this operation 's1' becomes "anc". Hence, the minimum operations required will be 3. It can be shown that there's no way to convert s1 into s2 in less than 3 moves. Input Format : The first line of the input contains a string 's1'. The second line of the input contains a string 's2'. Output Format : Return the minimum number of operations required to convert string 's1' into 's2'. Note : You do not need to print anything, it has already been taken care of. Just implement the given function.

You are given an array of n integers and an integer k. Your task is to divide the array into exactly k non-empty, contiguous subarrays (or "parts"). For each subarray, you must calculate its "value". The value of a subarray is defined as: (sum of its elements) - (its minimum element) + (its maximum element) The goal is to find a partitioning of the original array into k parts such that the sum of the values of all k parts is maximized. Return this maximum possible total value. Input Format: The first line contains two space-separated integers, n and k. The second line contains n space-separated integers, representing the elements of the array. Output Format: Your function should return a single integer representing the maximum possible total value. The runner code will handle printing. Notes: The problem has optimal substructure and overlapping subproblems, making it a classic fit for dynamic programming. A state dp[i][j] could represent the maximum value achievable by splitting the first j elements of the array into i parts. To calculate dp[i][j], you would iterate through all possible split points p < j and consider the value of the last part [p...j-1]. dp[i][j] = max(dp[i-1][p] + value of subarray(p to j-1))

You are given a directed graph with N nodes (numbered 0 to N-1), where each node has an integer value. You are also given an integer k. You can start your journey at any node in the graph. From your current node, you can move to any of its neighbors by following a directed edge. Each move takes one step. You are allowed to perform at most k moves. Each time you visit a node (including your starting node), you collect its value. You are allowed to visit the same node multiple times, and its value is added to your total each time you visit. Your task is to find the maximum possible total value you can accumulate after a path of at most k moves. Input Format: The first line contains three space-separated integers: N (number of nodes), M (number of directed edges), and k (maximum number of moves). The second line contains N space-separated integers, representing the values of nodes 0 to N-1. The next M lines each contain two space-separated integers u and v, representing a directed edge from node u to node v. Output Format: Your function should return a single long integer representing the maximum possible total value. The runner code will handle printing. Notes: This problem can be solved efficiently using dynamic programming. Let dp[i][j] be the maximum value of a path of exactly i moves ending at node j. The state transition would be: dp[i][j] = value[j] + max(dp[i-1][p]) for all nodes p that have an edge leading to j. The base case is dp[0][j] = value[j] for all j. The final answer will be the maximum value found anywhere in the dp table.

7th Highest Salary

You are given a string S which may contain a mix of uppercase letters, lowercase letters, digits, symbols, and spaces. Your task is to create a new string that consists of only the digit characters ('0' through '9') from the original string S. The digits in the new string must appear in the same relative order as they did in the original string. If no digits are present in the input string, your function should return an empty string. Input Format: The first and only line of input contains a single string S. Output Format: Your function should return a single string containing only the extracted digits. The runner code will handle printing this returned value. Notes: The most straightforward approach is to iterate through the input string character by character and use a built-in helper function (like isdigit()) to check if the character is a numeric digit.

I was clear with my fundamentals. This was my second attempt for this role. SQL, internship experience, and DSA are key.

Key Preparation Tips

Prepare DSA thoroughly.

Practice aptitude and puzzle-based questions.

Have at least two good projects on your resume.

Be prepared to explain your projects clearly.

Practice coding problems involving Arrays, Binary Search, DP and Recursion.

Prepare common HR questions such as Tell me about yourself and Who is your role model?