IBM Help done π
Test accomplished β€οΈ
OA: @MRTRUELIVING_IX β
#IBM #SE
All placement help available
Through the pics sharing π
Test accomplished β€οΈ
OA: @MRTRUELIVING_IX β
#IBM #SE
All placement help available
COGNIZANT EXAM HELP GROUP pinned Β«For 2025 batch Only https://t.me/codeicon_25Β»
Infosys
https://t.me/code_alphix/4048
Hitachi
https://t.me/code_alphix/4307
Morningstar mdp
https://t.me/code_alphix/4251?single
HSBC
Capgemini ( coding)
IBM
LSEG
Any other OA help available
DM @MRTRUELIVING_IX π
Remote access π― Success rate π―
https://t.me/code_alphix/4048
Hitachi
https://t.me/code_alphix/4307
Morningstar mdp
https://t.me/code_alphix/4251?single
HSBC
Capgemini ( coding)
IBM
LSEG
Any other OA help available
DM @MRTRUELIVING_IX π
Remote access π― Success rate π―
Hitachi help done β
All sections are done ( coding+ MCQ)π
OA : @MRTRUELIVING_IX
All Placement help available
#Hitachi #Done #Referral
All sections are done ( coding+ MCQ)π
OA : @MRTRUELIVING_IX
All Placement help available
#Hitachi #Done #Referral
Capgemini help available π
π― Test Clearance π€ πͺ
All placement help available
OA : @MRTRUELIVING_IX π
π― Test Clearance π€ πͺ
All placement help available
OA : @MRTRUELIVING_IX π
import sys
def log_message(f):
def wrapper(*a, **kw):
r = f(*a, **kw)
if isinstance(r, str):
with open('/tmp/decorator_logs.txt', 'a') as lf:
lf.write(r + '\n')
return r
return wrapper
@log_message
def func1():
return "String 1"
@log_message
def func2(s=None):
return "{}\n".format(s)
@log_message
def func3(s="Default String"):
return s
func1()
func2("String 2")
func3("String 3")
Python decorator π
β€1
Capgemini
Codes are available
DM @MRTRUELIVING_IX
PAID
Codes are available
Maximum Hugeness
Maximum number of games
Count The Substrings
DM @MRTRUELIVING_IX
PAID
Capgemini ( CODING ROUND) π
Aptitude
https://t.me/code_alphix/4341?single
OA : @MRTRUELIVING_IX π―
#Capgemini #Coding #round2
Aptitude
https://t.me/code_alphix/4341?single
OA : @MRTRUELIVING_IX π―
Help Available #Capgemini #Coding #round2
Capgemini all Codes are available
@MRTRUELIVING_IX
#PAID HELP
Count the substring
Maximum Hugeness
Maximum number of games
Timekeeper
@MRTRUELIVING_IX
#PAID HELP
#include <iostream>
#include <string>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
string s;
cin >> s;
int r = 2;
for (int i = 1; i < s.size(); i++) {
r += (s[i] == s[i-1]) ? 1 : 2;
}
cout << r << endl;
}
return 0;
}
Timekeeper π // Capgemini