Infosys Specialist Programmer Answers

Now, All 100% Correct TCS CodeVita Codes will be posted on both of these channels 👇🏻

1. https://telegram.me/PLACEMENTLELO

2. https://telegram.me/OFF_CAMPUS_JOBS_AND_INTERNSHIPS

Must Join both groups ✅

Buzz Sale
C++
TCS CodeVita Zone 2
https://telegram.me/+_hn3cBQVbGliYTI9

#include
#include
#include

using namespace std;
https://telegram.me/PLACEMENTLELO

int main() {
int n;
cin >> n;
// @PLACEMENTLELO
vector ids(n), costs(n);
for (int i = 0; i < n; i++) cin >> ids[i];
for (int i = 0; i < n; i++) cin >> costs[i];

int budget;
cin >> budget;
// @PLACEMENTLELO
int mfi = 0, mfw = 0;

for (int i = 0; i < n; i++) {
int buyCost = costs[i];
int maxQty = budget / buyCost;
// @PLACEMENTLELO
if (maxQty > 0) {
int cfi = 0;
int cfw = 0;
https://telegram.me/PLACEMENTLELO

for (int j = 0; j < n; j++) {
if (i != j && ids[i] % ids[j] == 0) {
cfi += maxQty;
cfw += costs[j] * maxQty;
}
}
// @PLACEMENTLELO
if (cfi > mfi ||
(cfi == mfi && cfw > mfw)) {
mfi = cfi;
mfw = cfw;
}
}
}
// @PLACEMENTLELO
cout

Desert Queen
C++
TCS CodeVita Zone 2
https://telegram.me/+_hn3cBQVbGliYTI9

#include
using namespace std;

int dir[4][2] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};

bool isValid(int x, int y, int n, const vector& grid) {
return x >= 0 && x < n && y >= 0 && y < n && grid[x][y] != 'M';
}
// @PLACEMENTLELO
int fMW(int n, const vector& grid, pair start, pair end) {
vector placementlelo(n, vector(n, INT_MAX));
queue q;
https://telegram.me/+_hn3cBQVbGliYTI9

q.push(start);
placementlelo[start.first][start.second] = 0;

while (!q.empty()) {
auto [x, y] = q.front();
q.pop();
https://telegram.me/+_hn3cBQVbGliYTI9

for (int d = 0; d < 4; d++) {
int nx = x + dir[d][0];
int ny = y + dir[d][1];

if (isValid(nx, ny, n, grid)) {
int cost = (grid[x][y] == 'T' && grid[nx][ny] == 'T') ? 0 : 1;
if (placementlelo[x][y] + cost < placementlelo[nx][ny]) {
placementlelo[nx][ny] = placementlelo[x][y] + cost;
q.push({nx, ny});
}
}
}
}
https://telegram.me/+_hn3cBQVbGliYTI9

return placementlelo[end.first][end.second];
}
@PLACEMENTLELO
int main() {
int n;
cin >> n;
https://telegram.me/PLACEMENTLELO
vector grid(n, vector(n));
pair start, end;

for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> grid[i][j];
if (grid[i][j] == 'S') start = {i, j};
if (grid[i][j] == 'E') end = {i, j};
}
}

int result = fMW(n, grid, start, end);
cout

String Obsession
C++
TCS CodeVita Zone 2
100% Correct Code ✅
https://telegram.me/+_hn3cBQVbGliYTI9

#include
#include
#include
#include
https://telegram.me/+_hn3cBQVbGliYTI9

using namespace std;

int dp(string& s, vector& v, unordered_map& memo) {

if (memo.count(s)) return memo[s];
// @PLACEMENTLELO
int placementlelo = 0;
https://telegram.me/+_hn3cBQVbGliYTI9

for (auto& x : v) {
size_t pos = s.find(x);
// @PLACEMENTLELO
if (pos != string::npos) {
string new_string = s.substr(0, pos) + s.substr(pos + x.size());
placementlelo = max(placementlelo, 1 + dp(new_string, v, memo));
}
}
// @PLACEMENTLELO
return memo[s] = placementlelo;
}

int main() {
int n;
cin >> n;
// @PLACEMENTLELO
vector substrings(n);
for (int i = 0; i < n; ++i) {
cin >> substrings[i];
}
https://telegram.me/+_hn3cBQVbGliYTI9

string mainString;
cin >> mainString;
// @PLACEMENTLELO
unordered_map memo;

cout