Given two arrays of element between 0 to N- 1 of length N. Find the lexicographically smallest array c such that for any index i c[i] = ( a[i] + b[i])%N. To find the lexicographically smallest array we can rearrange the elements of the second array. Example: Input: a[]: {0, 1, 2, 3} b[]: {3, 1, 0, 2} Output:… Read More »
Prerequisite – What is Algorithm | Introduction to Algorithms Advantages of Divide and Conquer Solving difficult problems: Divide and conquer is an efficient method for solving difficult problems. For example, consider the Tower of Hanoi problem which reduces the degree of difficulty since it divides the problem into subproblems that are easily solvable, solving the trivial cases and… Read More »
Prerequisite – C Language Introduction C comments explain code and improve readability. These do not affect program execution. You can use comments in C to clarify code and describe algorithms. There are two types of comments in C: single-line (//) commnets and multi-line (/* */) comments. 1. Single-line comments start with “//” and end at the end of the… Read More »
Prerequisite – C Language Introduction The C programming language has various versions: C89/C90, C99, C11, and C18. C89/C90: Released in 1989/1990. It introduced key language features. C99: This brought new features like variable-length arrays and complex numbers. C11: This added _Generic, static_assert, and library updates. C18: It is latest standard, with clarifications and updates. Advantages: 1. Efficiency: C… Read More »
Prerequisite – C Language Introduction C is a simple language made in 1972 by Dennis Ritchie. It’s for system programming. C has low-level memory access, basic keywords, good for systems like OS. Important C language features are: Procedure, Speed, Modularity, Static Type, General Use, Operators, Libraries, Mid-Level, Portability, Extensibility. Procedure means step-by-step instructions. C is one way, others… Read More »
Find the minimum number ‘N’ such that the sum of ‘N’ natural numbers is greater than or equal to a given number ‘NUM’ using Binary Search. In this problem, we need to find the minimum number ‘N’ such that the sum of the first ‘N’ number is greater than or equal to the user given number ‘NUM’. The… Read More »
Recursion is a powerful way of developing algorithms in which the solution of a problem is determined by the solution of one or more identical subproblems. A recursive solution involves two parts: at least one BASE CASE in which the solution returned is not dependent on any solution of any subproblem, and at least one RECURSIVE CASE, where… Read More »
We’re given a function in the format of f(x). We have to find the minimum absolute difference between f(x) and given number k over a range (0 – 10^6). This article assumes you know the working principle of binary search. If you don’t know, please go and check out the binary search. To understand this concept, let’s assume… Read More »
Two integers n and k is given. Find number of integers i from 1 to n such than difference of i and sum of digits of i is greater than k. Examples: Input : n=12 k=1 Output : 3 Explanation : 10,11,12 satisfies the given condition 10-sod(10) = 10-1 = 9 > k 11-sod(11) = 11-2 = 9… Read More »
In a prison, there are N cells. The positions of the cells are given in an array. The Jailer has to place all the prisoners in the cells in an ordered manner such that minimum distance between any two prisoners is as large as possible. You have to find that distance. Note: The cells are in a straight… Read More »
