## 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 element using minimum segments in Seven Segment Display

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 »

## Paper Cut into Minimum Number of Squares

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 »

## Minimize the sum of product of two arrays with permutations allowed

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 »

## Find maximum sum possible equal sum of three stacks

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 »

## Minimum sum of two numbers formed from digits of an array

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 »

## Maximize array sum after K negations | Set 2

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 »

## Minimum Cost Path with Left, Right, Bottom and Up moves allowed

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 »

## Minimum edges to reverse to make path from a source to a destination

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 »

## Minimum Cost to cut a board into squares

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 »

## Maximize array sum after K negations | Set 1

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 »

## Job Sequencing Problem | Set 2 (Using Disjoint Set)

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 »

## Find the Largest number with given number of digits and sum of digits

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

## Find smallest number with given number of digits and sum of digits

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

## Minimize the maximum difference between the heights

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 »