INFOSYS&WIPRO&COGNIZANT&ACCENTURE &TCS& ALL OFF CAMPUS exam answers group

Channel address:

Categories: Education

Language: English

Subscribers: 2.24K

▲ Vote (2)

Ratings & Reviews

2.67

3 reviews

Reviews can be left only by registered users. All reviews are moderated by admins.

5 stars

4 stars

3 stars

2 stars

1 stars

The latest Messages 32

2021-07-04 07:54:45 https://dare2compete.com/o/jumpstart-publicis-sapient-181479?lb=XFmu3x5

238 views04:54

Open / Comment

2021-07-04 07:52:58 JUSPAY&SIEMEN&KANTAR&COGNIZANT&ACCENTURE &IBM& ALL OFF CAMPUS exam answers group pinned «1) Java Servlets Interview Questions - http://bit.ly/32h0jef 2) JDBC Interview Questions - http://bit.ly/2HB7CWa 3) Spring Interview Questions - http://bit.ly/329X88i 4) Hibernate Interview Questions - http://bit.ly/32fcubB 5) Python Interview Questions…»

04:52

Open / Comment

2021-07-04 07:52:41 1) Java Servlets Interview Questions - http://bit.ly/32h0jef

2) JDBC Interview Questions - http://bit.ly/2HB7CWa

3) Spring Interview Questions - http://bit.ly/329X88i

4) Hibernate Interview Questions - http://bit.ly/32fcubB

5) Python Interview Questions - http://bit.ly/30zxPvO

6) Core Java Interview Questions - http://bit.ly/2ZpVlhw

7) SQL Interview Questions - http://bit.ly/2TQ3XvX

8) Top 30 HR Interview Questions with Answers For Freshers - http://bit.ly/2WjSnpU

For All Interview Questions - http://bit.ly/2TTIges

Amcat Sample Paper with Answer

Amcat Sample Paper - 1 - http://bit.ly/2ZyCNMo

Amcat Sample Paper - 2 - http://bit.ly/2Zu8CWg

Join Us on Telegram for Instant Job Notification - https://t.me/jobscoupe

251 views04:52

Open / Comment

2021-07-03 19:11:55 def main(edges):
res= []
v = [-1] * len(edges)
for i in range(0, len(edges)):
New = []
K= i
while cell > -1 and v[K] == -1:
v[K] = i
New.append(K)
K = edges[K]
if K > -1 and v[K] == i:
_idx = New.index(K)
New = New[_idx:]
if len(New) > len(res):
res = New
return res,len(res)

size =int(input())
edges =list(map(int,input().split())) [ : size]
print(main(edges))

Python3
Maximum weight node!

342 views16:11

Open / Comment

2021-07-03 18:32:44 Coding Help, [03.07.21 16:17]
Siemens coding answer

#include
#include
#include
#include
#define ll long long
using namespace std;
mapmp[30][30];
int n,m,t;
ll k,num[30][30],ans;
// double-ended dfs, one from (1,1) to (i,j) and i+j==max(n,m)

void dfs1(int x,int y,ll tt)
{
if(x+y==t)
{
Mp[x][y][tt]++; //Use the map to record the number of tt when searching for points (y, x)
return ;
}
if(x+1<=n)
dfs1(x+1,y,tt^num[x+1][y]);
if(y+1<=m)
dfs1(x,y+1,tt^num[x][y+1]);
}
// second from (n,m) to (i,j) and (i+j)==max(n,m)+1
void dfs2(int x,int y,ll tt)
{
if(x+y==t+1)
{
if(x-1>=1)
ans+=mp[x-1][y][tt^k];
if(y-1>=1)
ans+=mp[x][y-1][tt^k];
return ;
}
if(x-1>=1)
dfs2(x-1,y,tt^num[x-1][y]);
if(y-1>=1)
dfs2(x,y-1,tt^num[x][y-1]);
}
int main()
{
while(~scanf("%d%d%lld",&n,&m,&k))
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
mp[i][j].clear();
scanf("%lld",&num[i][j]);
}
}
ans=0;
t=max(n,m);
if(1+1<=t)
{
dfs1(1,1,num[1][1]);
dfs2(n,m,num[n][m]);
}
else
{
if(num[1][1]==k)
ans++;
}
printf("%lld\n",ans);
}
}

XoR paths

int solve (int n, int m, vector v) {
long long l = 1, r = *max_element(v.begin(), v.end()), mid, cnt;
while(l mid = (l+r)/2;
cnt = 0;
for(auto& i: v) cnt += ceil(1.0*i/mid);
if(cnt>n) l = mid+1;
else r = mid;
}
return l;
}

Seimens vaccination distribution code

Telegram::: @placementupdatess

370 views15:32

Open / Comment

2021-07-02 18:06:24 #include
using namespace std;

int minOps(string& A, string& B)
{
int m = A.length(), n = B.length();
if (n != m)
return -1;
int count[256];
memset(count, 0, sizeof(count));
for (int i=0; i count[B[i]]++;
for (int i=0; i count[A[i]]--;
for (int i=0; i<256; i++)
if (count[i])
return -1;

int res = 0;
for (int i=n-1, j=n-1; i>=0; )
{

while (i>=0 && A[i] != B[j])
{
i--;
res++;
}

if (i >= 0)
{
i--;
j--;
}
}
return res;
}

int main()
{
string A = "0101";
string B = "1111";
cout << "Minnos" << minOps(A, B);
return 0;
}

C++

String Transformation
Telegram :: @placementupdatess

200 views15:06

Open / Comment

2021-07-02 17:59:19 1.1

2.a
3.a
4.c

5.a
6.d
7.a
8.d

9.a
10.a
11.c
12.a

13.b
14.d
15.d
16.b
17.d
18.d
19.c
20. D
22 - B
23 - D
24 - A
25 - C
26 - C
27 -C
28 - B
29 - B
30 -A

JUSPAY Answer
Telegram::: @placementupdatess

214 views14:59

Open / Comment

2021-07-02 16:18:44 Polaris …

308 views13:18

Open / Comment