Given an array and a value K, we have to find the last occurrence of the value K in the array. We will do this by using recursion in C++ and print out the index of the last occurrence.
Given a network of people, we will try to minimize the number of transactions using C++. We will finally print the amount a person has to give or receive.
A 9x9 2D matrix is taken as an input and using backtracking with C++ we will give solved sudoku as output. If there is no solution for the matrix we will print The given sudoku can't be solved.