You are provided with an array of size 8*N and you are provided a permutation of 8*N consecutive integers comprising of all the elements from ‘a’ to ‘a + 7*N ‘. Your task is to minimize the difference of the sum of the squares of the elements at even positions and the odd positions and print the permutation.… Read More »
Given two numbers n and m, generate all distinct subsequences of length m using numbers from 1 to n. You may repeat a number. INPUT: n=5, groups=3 OUTPUT: 1,1,3 1,2,2 1,3,1 2,1,2 2,2,1 3,1,1 INPUT: n=7, groups=3 OUTPUT: 1,1,5 1,2,4 1,3,3 1,4,2 1,5,1 2,1,4 2,2,3 2,3,2 2,4,1 3,1,3 3,2,2 3,3,1 4,1,2 4,2,1 5,1,1 APPROACH: We need to generate… Read More »
Amanada, a school kid, is learning English alphabets. Her teacher devised a small game to make the task fun. A grid of ‘m’ rows and ‘n’ columns is filled with English alphabets. She needs to search English words in this grid by moving one step at a time in any of the adjacent grid cells. A grid of… Read More »
Backtracking is an algorithm that searches for possible combinations in order to solve computational problems. It is used for solving problems recursively by building increments and removing solutions that do not satisfy given constraints. This technique finds a solution among all possible solutions. Comparison with Brute-Force Approach: Backtracking is an improvement technique of the Bruteforce technique. These are… Read More »
