TCS NQT 9AM EXAM ANS

Telegram:- @allcoding1

Discussion group:- @TCS_exam_Ans

TCS NQT Exam Ans

1)45kg
2) 2
3) 4
4)26
5)₹ 2007.5


TCS NQT 2PM EXAM ANS

Telegram:- @allcoding1

Discussion group:- @TCS_exam_Ans

TCS NQT Exam Ans

1)45kg
2) 2
3) 4
4)26
5)₹ 2007.5
6) 6986
7) 36

TCS NQT 2PM EXAM ANS

Telegram:- @allcoding1

Discussion group:- @TCS_exam_Ans

TCS NQT Exam Ans

1)45kg
2) 2
3) 4
4)26
5)₹ 2007.5
6) 6986
7) 36
8)41/6 profit
9)17.89%
10)15:12:20
11)₹364

TCS NQT 2PM EXAM ANS

Telegram:- @allcoding1

Discussion group:- @TCS_exam_Ans

811/120

Sofia program for second non-repeating character
Python
Telegram:- @allcoding1

Meena Was Playing Code
Python
Telegram :- @allcoding1

English Teacher Code
Python
Telegram:- @allcoding1

Seating arrangement of Students
Python
Telegram:- @allcoding1

C++
Event management code
Telegram:- @allcoding1

🎯TCS NQT Registration 2022| TCS Recruitment Drive For Freshers

Test : National Qualifier Test (NQT)
Qualification : B.E/B.Tech/Any Degree/Diploma
Batch : Any Batch Passouts (2018/2019/2020/2021/2022 )
Package : 3.36-19 LPA

Apply Now:- http://www.allcoding1.com

Telegram:- @allcoding1

Tomorrow TCS NQT 9AM EXAM ANS

Telegram:- @allcoding1

Discussion group:- @TCS_exam_Ans

PQ

TCS NQT 9AM EXAM ANS

Telegram:- @allcoding1_official

Discussion group:- @TCS_examAns

1) A 2) C

TCS NQT 9AM EXAM ANS

Telegram:- @allcoding1_official

Discussion group:- @TCS_examAns

QR
TCS NQT 9AM EXAM ANS

Telegram:- @allcoding1_official

Discussion group:- @TCS_examAns

1) B , 2) C

TCS NQT 9AM EXAM ANS

Telegram:- @allcoding1_official

Discussion group:- @TCS_examAns

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

vector<string> rows;
char alphabet;

string findPrecedingAlphabets()
{
    int r = -1, c = -1;
    for (int i = 0; i < rows.size(); i++)

    {
        int idx = rows[i].find(alphabet);
        if (idx != string::npos)

        {
            r = i;
            c = idx;
            break;
        }
    }
    if (r == -1)
        return "alphabet not found";
    string a = "";
    if (r > 0)
        a += rows[r - 1][c];
    if (c > 0)
        a += rows[r][c - 1];
    return a;
}

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

    {
        string row;
        cin >> row;
        rows.push_back(row);
    }
    cin >> alphabet;
    cout << findPrecedingAlphabets() << endl;
    return 0;
}


IBM Exam Ans

Alphabets on Excel sheets code
Python


Telegram:- @allcoding1