COGNIZANT EXAM HELP GROUP
3.55K subscribers
5.3K photos
21 videos
10 files
3.22K links
🚀 Placement Preparation Hub

🎓 From Preparation to Placement

OA Support • Coding • Aptitude • Technical • HR

🌟 Trusted by Hundreds of Students

🏆 372+ Placement Successes

📩 DM: @Mrtrueliving_ix

💙 Turning Aspirations into Offer Letters.
Download Telegram
Hashedin

Preview

Hcl

https://t.me/code_alphix/4294

REVATURE

💯 Test Clearance ❤️ high standards 🫡

DM
@Mrtrueliving_ix

      
@Mrtrueliving_ix
Naggaro Codes are done

DM @Mrtrueliving_ix
Ey GDS codes are done

DM @Mrtrueliving_ix 👍
REVATURE HELP done

DM
@Mrtrueliving_ix

#REVATURE #SDE

All placement help available
import re

def validPhones(n, a):
pattern = r'^\d{3}[-.]\d{3}[-.]\d{4}$'
for num in a:
if re.match(pattern, num):
print(num, end=" ")

n = int(input())
a = [input().strip() for _ in range(n)]

validPhones(n, a)

Valid Phone number || Revature
CGI sending test mails Check

DM for 💯 test Clearance

Preview


@Mrtrueliving_ix

@Mrtrueliving_ix

Apply Now

https://t.me/code_alphix/4940
Mthree Help Available

DM
@Mrtrueliving_ix 😀
Mthree codes are done

DM
@Mrtrueliving_ix

#paid Help😇
Max separartion || mthree😇
Mthree Help done 👌

10Mcqs+ 3 coding 😇

DM FOR 💯 TEST CLEARANCE

@Mrtrueliving_ix || @Mrtrueliving_ix

#Mthree #Round1 #Done
Any OA help available

DM for test clearance 💯
@Mrtrueliving_ix || @Mrtrueliving_ix
Nvidia all codes available

@Mrtrueliving_ix 😇
int findMaximumGreatness( vector<int>&arr) {
    int n = arr.size()
    vector<int>v = arr;
    sort(begin(v), end(v));
    sort(begin(arr), end(arr));
    int ans = 0;
    int i = n - 1, j = n - 1;
    while (i >= 0 && j >= 0) {
        if (v[i] > arr[j]) {
            ans++;
            i--;
            j--;
        }
        else {
            j--;
        }
    }
    return ans;
}

FindMaximumGreatness || nvidia 👍
#include <iostream>
#include <vector>
using namespace std;

const int MOD = 1e+7;

int numWays(vector<vector<int>>& grid) {
int n = grid.size();
if (n == 0) return 0;
int m = grid[0].size();
if (m == 0) return 0;

vector<vector<int>> dp(n, vector<int>(m, 0));

dp[0][0] = grid[0][0] == 1 ? 1 : 0;

for (int i = 1; i < n; ++i) {
if (grid[i][0] == 1) dp[i][0] = dp[i-1][0];
}

for (int j = 1; j < m; ++j) {
if (grid[0][j] == 1) dp[0][j] = dp[0][j-1];
}

for (int i = 1; i < n; ++i) {
for (int j = 1; j < m; ++j) {
if (grid[i][j] == 1) {
dp[i][j] = (dp[i-1][j] + dp[i][j-1]) % MOD;
}
}
}

return dp[n-1][m-1];
}

FindSafeWays || Nvidia
import java.util.Scanner;

public class BatchIDGenerator {
static String getBatchID(int n, String f, int m, int dd, String time) {
String v = "AEIOUaeiou", fn = "";
for (char c : f.toCharArray()) if (fn.length() < 3 && v.indexOf(c) == -1) fn += Character.toUpperCase(c);
String[] ms = {"JAN", "FEB", "MAR", "APR", "MAY", "JUN", "JUL", "AUG", "SEP", "OCT", "NOV", "DEC"};
return fn + ms[m - 1] + String.format("%02d", dd) + time.replace(".", "");
}

public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt(), m = sc.nextInt(), dd = sc.nextInt();
String f = sc.next(), time = sc.next();
System.out.println(getBatchID(n, f, m, dd, time));
sc.close();
}
}

Batch Id || Wipro milestone 👍
1👀1
Cisco || 10th Feb // cwip

Help available

DM @Mrtrueliving_ix
JUSPAY Help Available

DM FOR 💯 TEST CLEARANCE

@Mrtrueliving_ix

@Mrtrueliving_ix