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

Range Minimize
C++
Codechef Starters 152
https://telegram.me/+Q_kf6B6EFexiNmU9

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

int32_t main()
{
int t;
cin>>t;

while(t--)
{
int n;
cin>>n;

vector<int>vec(n);
for(int i=0;i<n;i++)
{
cin>>vec[i];
}

sort(vec.begin(),vec.end());

int ans1=vec[n-3]-vec[0];
int ans2=vec[n-1]-vec[2];
int ans3=vec[n-2]-vec[1];

cout<<min(ans1,min(ans2,ans3))<<endl;

}


return 0;
}

Range Minimize
C++
Codechef Starters 152
https://telegram.me/+Q_kf6B6EFexiNmU9

Maximize Hamming Distance
C++
Codechef Starters 152
https://telegram.me/+Q_kf6B6EFexiNmU9

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

int32_t main() {
int test_cases;
cin >> test_cases;

while (test_cases--) {
int num_rows, num_strings;
cin >> num_rows >> num_strings;

vector<pair<int, pair<int, int>>> data(num_rows);

int result = 0;

while (num_strings--) {
string line;
cin >> line;

int zero_count = 0;
int one_count = 0;
int question_count = 0;

for (int idx = 0; idx < line.size(); idx++) {
if (line[idx] == '0') {
data[idx].first++;
} else if (line[idx] == '1') {
data[idx].second.first++;
} else {
data[idx].second.second++;
}
}
}

for (int idx = 0; idx < num_rows; idx++) {
int zeros = data[idx].first;
int ones = data[idx].second.first;
int questions = data[idx].second.second;

while (questions--) {
if (zeros <= ones) {
zeros++;
} else {
ones++;
}
}

result += (zeros * ones);
}

cout << result << endl;
}

return 0;
}

Maximize Hamming Distance
C++
Codechef Starters 152
https://telegram.me/+Q_kf6B6EFexiNmU9