The knapsack problem is a problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine the number of…

Given a sequence of n real numbers A(1) … A(n), program to find a contiguous subarray with the largest sum For example, var arr =…

Greatest Common Divisor of two numbers is the largest positive numbers which can divide both numbers without any remainder. Write a C# program to find…

An Armstrong number is a number that is the sum of its own digits each raised to the power of the number of digits. Example…

Problem Write a C# programme to sum provided number digit using? For e.g. Input 123 Output 6 Solution

Write a program to Swap a two number without using third variable. Solution:

Write a program to sum a two number without using arithmetical operator (+). Solution:

Problem How to represent a 2D array with a 1D array? Solution: