Novago SDE Hiring Challenge Answers will be uploaded here !

Novago Exam Discussion Group 👇
https://telegram.me/+8B154b769wk4ZjY9

Latest Off-Campus Jobs and Internships are Uploaded regularly here👇
1. https://telegram.me/PLACEMENTLELO

2. https://telegram.me/OFF_CAMPUS_JOBS_AND_INTERNSHIPS

✅ Must Join ✅

✅ Novago SDE Hiring 100% Correct Exam Answers Uploaded 👇
https://youtu.be/W5megr7i98k
https://youtu.be/W5megr7i98k

Same questions for ALL🚀

✅ Share this video with all your friends and in college groups 🚀

Infosys Exam Answers will be uploaded here 👇
https://telegram.me/+_hn3cBQVbGliYTI9

Infosys Exam Discussion Group 👇
https://telegram.me/+oZ4x3k1RtXdkNWU1

Must Join both groups ✅

Share this with your friends who have Infosys exam on 6th July 😇

Infosys SP Exam Previous Year Paper with Answers 🔥

Infosys SP Exam Answers will be uploaded here 👇
https://telegram.me/+_hn3cBQVbGliYTI9

Infosys Exam Discussion Group 👇
https://telegram.me/+oZ4x3k1RtXdkNWU1

Must Join both groups ✅

Share this with your friends who have Infosys exam on 4 August 😇

Guys follow us fast 👇🏻
https://instagram.com/placementlelo

We will make our page private

RGB Counting
Infosys SP Exam
C++
https://telegram.me/+_hn3cBQVbGliYTI9

const int MODULO = 1e9 + 7;

int main() {
int numElements, divisor;
cin >> numElements >> divisor;
vector<int> elements(numElements);
for (int i = 0; i < numElements; i++) {
cin >> elements[i];
}
https://telegram.me/PLACEMENTLELO
vector<vector<vector<long long>>> dp(divisor, vector<vector<long long>>(divisor, vector<long long>(divisor, 0)));
dp[0][0][0] = 1;
https://telegram.me/PLACEMENTLELO
for (int value : elements) {
vector<vector<vector<long long>>> newDp(divisor, vector<vector<long long>>(divisor, vector<long long>(divisor, 0)));

for (int rSum = 0; rSum < divisor; rSum++) {
for (int gSum = 0; gSum < divisor; gSum++) {
for (int bSum = 0; bSum < divisor; bSum++) {
if (dp[rSum][gSum][bSum] > 0) {
newDp[(rSum + value) % divisor][gSum][bSum] = (newDp[(rSum + value) % divisor][gSum][bSum] + dp[rSum][gSum][bSum]) % MODULO;
newDp[rSum][(gSum + value) % divisor][bSum] = (newDp[rSum][(gSum + value) % divisor][bSum] + dp[rSum][gSum][bSum]) % MODULO;
newDp[rSum][gSum][(bSum + value) % divisor] = (newDp[rSum][gSum][(bSum + value) % divisor] + dp[rSum][gSum][bSum]) % MODULO;
}
}
}
}

dp = newDp;
}
https://telegram.me/PLACEMENTLELO
long long placementlelo = 0;
for (int rSum = 0; rSum < divisor; rSum++) {
for (int gSum = 0; gSum < divisor; gSum++) {
int bSum = (divisor - rSum - gSum) % divisor;
if (bSum < 0) bSum += divisor;
placementlelo = (placementlelo + dp[rSum][gSum][bSum]) % MODULO;
}
}
https://telegram.me/PLACEMENTLELO
cout << placementlelo << endl;
return 0;
}

RGB Counting
Infosys SP Exam
C++
https://telegram.me/+_hn3cBQVbGliYTI9

Lost In Orange Code
Infosys SP Exam
C++
https://telegram.me/+_hn3cBQVbGliYTI9

#include <bits/stdc++.h>
using namespace std;
#define int long long

int32_t main()
{
int N, M;
cin >> N >> M;
https://telegram.me/PLACEMENTLELO
vector<vector<int>> grid(N, vector<int>(M));
for (int i = 0; i < N; ++i){
for (int j = 0; j < M; ++j){
cin >> grid[i][j];
}
}

vector<vector<long long>> dp(N, vector<long long>(M, 0));
vector<vector<long long>> placementlelo(N, vector<long long>(M, LLONG_MAX));

if (grid[0][0] == 0) placementlelo[0][0] = 0;
https://telegram.me/PLACEMENTLELO
dp[0][0] = grid[0][0];
for (int i = 0; i < N; ++i){
for (int j = 0; j < M; ++j){
if (i == 0 && j == 0)
continue;

if (i > 0){
dp[i][j] = max(dp[i][j], dp[i - 1][j] + grid[i][j] - placementlelo[i - 1][j]);
placementlelo[i][j] = min(placementlelo[i][j], placementlelo[i - 1][j] + 2);
}

if (j > 0){
dp[i][j] = max(dp[i][j], dp[i][j - 1] + grid[i][j] - placementlelo[i][j - 1]);
placementlelo[i][j] = min(placementlelo[i][j], placementlelo[i][j - 1] + 2);
}
https://telegram.me/PLACEMENTLELO
if (grid[i][j] == 0) placementlelo[i][j] = 0;
}
}
https://telegram.me/PLACEMENTLELO
cout << dp[N - 1][M - 1] << endl;

return 0;
}

Lost In Orange Code
Infosys SP Exam
C++
https://telegram.me/+_hn3cBQVbGliYTI9