Problem Link: https://codeforces.com/problemset/problem/1666/L This Problem has various ways to solve but today I am going to talk about the ways...
We have Two arrays ans[0,1,----(n-1)] and rem[0,1,----(n-1)]. We have to find minimum value of x such that x%ans[0] = rem[0], x%ans[1] = rem[1], and...
The major approach to finding the prime number is running the loop from 2 to n and check whether it divides the number or not. The complexity of that...
In this equation, we make an equation in terms of x and y and we input a,b, and c in which a is the coefficient of x, b is the coefficient of y and c...
NPM stands for the Node Package Manager. It is responsible for handling the dependencies required for the node. It helps to install modules/packages...
Ajax is a Web development technique which helps to create the asynchronous web application. It is mainly use to send and retrieve data from the server...