## Accolite Interview Experience | Set 15 (On-Campus)

1st round consisted of 20mcq questions to be answered in 30 minutes. Around 120 students appeared for the test. Top 5 were called directly for… Read More »

- Find maximum meetings in one room
- Split the given array into K sub-arrays such that maximum sum of all sub arrays is minimum
- Greedy approach vs Dynamic programming
- Largest substring with same Characters
- Find minimum changes required in an array for it to contain k distinct elements
- Maximum Length Chain of Pairs | Set-2
- Minimum number of pairs required to make two strings same
- Unbounded Fractional Knapsack
- Check whether a subsequence exists with sum equal to k if arr[i]> 2*arr[i-1]
- Count of integers that divide all the elements of the given array
- Create a Sorted Array Using Binary Search
- Find minimum length sub-array which has given sub-sequence in it
- Move all zeros to start and ones to end in an Array of random integers
- Count common elements in two arrays containing multiples of N and M
- Maximum distance between two unequal elements
- Maximum String Partition
- Minimum deletions required to make GCD of the array equal to 1
- Minimum operations required to make every element greater than or equal to K
- Minimum number of given operations required to reduce the array to 0 element
- Number of balanced parenthesis substrings
- Find the Kth smallest element in the sorted generated array
- Minimum deletions required such that any number X will occur exactly X times
- Longest Subarray having strictly positive XOR
- Maximize the size of array by deleting exactly k sub-arrays to make array prime
- Smallest multiple of N formed using the given set of digits
- Minimizing array sum by applying XOR operation on all elements of the array
- Maximum possible sub-array sum after at most X swaps
- Fractional Knapsack Queries
- Count ways to divide circle using N non-intersecting chord | Set-2
- Find the minimum of maximum length of a jump required to reach the last island in exactly k jumps

1st round consisted of 20mcq questions to be answered in 30 minutes. Around 120 students appeared for the test. Top 5 were called directly for… Read More »

A Seven Segment Display can be used to to display numbers. Given an array of n natural numbers. The task is to find the number… Read More »

Given a paper of size A x B. Task is to cut the paper into squares of any size. Find the minimum number of squares… Read More »

Given two arrays, A and B, of equal size n, the task is to find the minimum value of A[0] * B[0] + A[1] *… Read More »

Given three stack of the positive numbers, the task is to find the possible equal maximum sum of the stacks with removal of top elements… Read More »

Given an array of digits (values are from 0 to 9), find the minimum possible sum of two numbers formed from digits of the array.… Read More »

Given an array of size n and a number k. We must modify array K number of times. Here modify array means in each operation… Read More »

Given a two dimensional grid, each cell of which contains integer cost which represents a cost to traverse through that cell, we need to find… Read More »

Given a directed graph and a source node and destination node, we need to find how many edges we need to reverse in order to… Read More »

A board of length m and width n is given, we need to break this board into m*n squares such that cost of breaking is… Read More »

Given a set of n jobs where each job i has a deadline di >=1 and profit pi>=0. Only one job can be scheduled at… Read More »

How to find the largest number with given digit sum s and number of digits d? Examples: Input : s = 9, d = 2… Read More »

How to find the smallest number with given digit sum s and number of digits d? Examples : Input : s = 9, d =… Read More »

Given heights of n towers and a value k. We need to either increase or decrease height of every tower by k (only once) where… Read More »