๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.63K subscribers
5.61K photos
3 videos
95 files
10.6K links
๐ŸšฉMain Group - @SuperExams
๐Ÿ“Job Updates - @FresherEarth

๐Ÿ”ฐAuthentic Coding Solutions(with Outputs)
โš ๏ธDaily Job Updates
โš ๏ธHackathon Updates & Solutions

Buy ads: https://telega.io/c/cs_algo
Download Telegram
Coin Change

Given a value N, find the number of ways to make change for N cents, if we have infinite supply of each of S = { S1, S2, .. , SM } valued coins.


Example 1:

Input:
n = 4 , m = 3
S[] = {1,2,3}
Output: 4
Explanation: Four Possible ways are:
{1,1,1,1},{1,1,2},{2,2},{1,3}.
Example 2:

Input:
n = 10 , m = 4
S[] ={2,5,3,6}
Output: 5
Explanation: Five Possible ways are:
{2,2,2,2,2}, {2,2,3,3}, {2,2,6}, {2,3,5}
and {5,5}.

Today question
Try to solve this question guys
It's very very important questions

These companies are asked in interview guys

Accolite Amazon Microsoft Morgan Stanley OYO Rooms Paytm Samsung Snapdeal Flipkart
๐Ÿ‘1
Hi! Keep reading this message if you are looking for a job and would like to build the future of digital payments, here is a golden opportunity.

NPCI, Indiaโ€™s leading digital payments organisation is scouting for 250 Graduate Engineer Trainees (GET) who will join its team to build revolutionary digital payment products like UPI, RuPay, and FAStag.

It is a โ€˜Learn while you Earnโ€™ opportunity where the GETs will pursue 1 year PG program from a reputed institution in addition to the salary package being offered to them. (*t&c apply)

Get ready to join this innovator's community and inspire the work. Have a great start to your career.

Last date to apply for this opportunity is April 28, 2022. Visit https://bit.ly/3Lc64AO.

Thank you.
class GFG {


static int xorOfArray(int arr[], int n)
{

int xor_arr = 0;


for (int i = 0; i < n; i++) {


xor_arr = xor_arr ^ arr[i];
}


return xor_arr;
}


public static void main (String[] args)
{

int arr[] = { 3, 9, 12, 13, 15 };
int n = arr.length;


System.out.println(xorOfArray(arr, n));

}
}

XOR CODE
๐Ÿ‘1