class GFG {


static int xorOfArray(int arr[], int n)
{

int xor_arr = 0;


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


xor_arr = xor_arr ^ arr[i];
}


return xor_arr;
}


public static void main (String[] args)
{

int arr[] = { 3, 9, 12, 13, 15 };
int n = arr.length;


System.out.println(xorOfArray(arr, n));

}
}

XOR CODE

Emil's Function
Java 8

All Test Cases Passed

Removing a character
Python 3

LMPKA Code
Python3

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>
using namespace std;
char B[105];
int main(){
int n;
int ans=0;
scanf("%d", &n);
scanf("%s", B);
for(int i=2; B[i]; i++){
if(B[i-2] == '0' && B[i-1] == '1' && B[i] == '0') B[i] = '1', ans++;
}
printf("%d", ans);
return 0;
}

Beautiful string code

ArrayList<Integer> ar = new ArrayList<Integer>();
ArrayList<Integer> ar1 = new ArrayList<Integer>();
ArrayList<Integer> arr2= new ArrayList<Integer>();
ArrayList<Integer> sza= new ArrayList<Integer>();
ArrayList<Integer> p_n= new ArrayList<Integer>();

Scanner sc = new Scanner(System.in);

int a_size= sc.nextInt();
int m_size=sc.nextInt();
int[] a = new int[a_size];
for(int i=0;i<a_size;i++){
a[i]=sc.nextInt();
arr2.add(a[i]);
}
int[] p = new int[m_size];
for(int i=0;i<m_size;i++){
p[i]=sc.nextInt();
p_n.add(p[i]);
}
int[] sz=new int[m_size];
for(int i=0;i<m_size;i++){
sz[i]=sc.nextInt();
sza.add(sz[i]);
}

for(int i=0;i<a_size;i++)
{
for(int j=0;j<m_size;j++)
{
if(a[i]==p[j])
{
ar.add(p[j]);
}
}
}
int [] fr = new int [ar.size()];
int visited = -1;
for(int i = 0; i < ar.size(); i++){
int count = 1;
for(int j = i+1; j < ar.size(); j++){
if(ar.get(i).equals(ar.get(j))){
count++;
fr[j] = visited;
}
}
if(fr[i] != visited)
fr[i] = count;
}

for(int i = 0; i < fr.length; i++){
if(fr[i] != visited)
ar1.add(fr[i]);
}
ArrayList<Integer> pnew = new ArrayList<Integer>();
for(int l=0;l<sz.length;l++)
{
for(int h=0;h<sza.get(l);h++)
{
pnew.add(p_n.get(l));
}
}
int count=0;
for(int i = 0; i < pnew.size(); i++)
{
for(int j = i+1; j < pnew.size(); j++)
{
if(pnew.get(i).equals(pnew.get(j)))
{
count++;
}
}
}
System.out.println(count);
}
}


Sequences concatenation code

Xor Operation code

Rectangular operation Code ✅

Happy Hour
Python 3

MNC code
c++

String Updation code
Python 3✅

Book Distribution
C++

INFOSYS IS HIRING | 2019/20/21/22 batch

📆 Last Date - 1st MAY 2022
System Engineer | 💰3.6LPA
Engg./MCA/MSc Apply Link

Operation Executive | 💰2.2LPA
Diploma Apply Link
BSc/BCA Apply Link

System Engineer : https://surveys.infosysapps.com/r/a/Infosys_Offcampus_SEMAY


Diploma : https://surveys.infosysapps.com/r/a/Infosys_Offcampus_DiplomaMAY

BSC/BCA : https://surveys.infosysapps.com/r/a/Infosys_Offcampus_NEGMAY

class Player:
def init(self,name,team,price,skills,debut,country):
self.name=name
self.team=team
self.price=price
self.skills=skills
self.debut=debut
self.country=country
class IPL:
def init(self,playerList, dict):
self.dict=dict
self.playerList=playerList
def findMaximumPrice(self):
max_obj=max(self.playerList, key=lambda x:x.price)
return max_obj
def sortByPrice(self):
s=[]
s=sorted(self.teamList, key=lambda x:x.price)
s1=[]
for i in s:
s1.append(i.price)
if len(s1)==0:
return None
else:
return s1
if name =='main':
playerList=[]
dict={}
limit=int(input())
for j in range(limit):
name=input()
team=input()
price=float(input())
debut=input()
skills=input()
country=input()
playerList.append(Player(name,team,price,country,skills,debut))
obj=League("dict",playerList)
r1=obj.findMaximumPrice()
if(r1!=None):
print(r1.name)
print(r1.team)
print(r1.price)
print(r1.skills)
print(r1.debut)
print(r1.country)
else:
print("NO Data Found")
r2=obj.sortByPrice()
for i in r2:
print(i)

Python IRA ✅

🔔Accenture Off Campus Drive 2022 | BE/ B.Tech | MCA/M.Tech | PAN India

Job Role:Associate Software Engineer
Education :BE/B.Tech/ME/M.Tech/ MCA All Branches
Experience:0-11 Months
Job Location:PAN India
Package : 4.5 To 6 LPA

https://fresherearth.blogspot.com/2022/04/Accenture-Off-Campus-Drive-2022-BE-B.Tech-MCAM.Tech-PAN-India.html

✅ Share with your friends

NINJA OR DIGITAL – LET YOUR CALIBER DETERMINE WITH THE TCS INTEGRATED TEST PATTERN (ITP)


Create New account Guys apply again

Do fast

This is for digital profile and Ninja profile



According to your score you will be get digital profile and Ninja profile


https://www.tcs.com/careers/tcs-off-campus-hiring