Find me out code
Join https://t.me/Coding_human

def findSubArray(arr, n):
sum = 0
maxsize = -1
for i in range(0, n-1):
sum = -1 if(arr[i] == 0) else 1
for j in range(i + 1, n):
sum = sum + (-1) if (arr[j] == 0) else sum + 1
if (sum == 0 and maxsize < j-i + 1):
maxsize = j - i + 1
startindex = i
if (maxsize == -1):
print(0);
else:
print(maxsize);

size = int(input())
arr = list(map(int, input().split()))
findSubArray(arr, size)

Python
Largest Sub Array
Telegram - https://t.me/Coding_human

Join for exam and coding help
https://t.me/Accenture_lti_Accolite_exam

58. All
59. 1024
60. Web page
61. All

62 Secure
63 Remote
64 Internet Ex

73 None
74 1 and 2
75 %temp%

Fibonacci code
Join : https://t.me/Coding_human

Renault Nissan Off campus drive

https://atultalksabhay.blogspot.com/2022/01/renault-nissan-off-campus-drive.html

Revature is hiring 2021 and 2022 batch

https://atultalksabhay.blogspot.com/2022/01/revature-is-hiring-2021-and-2022-batch.html?m=1

Base N sum code

Join : https://t.me/Coding_human

https://t.me/Accenture_lti_Accolite_exam

TCS Interview questions:

1.Tell me about your self
2. About Project
3. Are you used any programming language in your project.
4. And explain about your project in depth.
5. Tell the syntax to print He'll world
6. How to print 4th index value from a string.
7. Can we write static public instant of public static in the main method why
8. JDK, JRE, JVM
9. Why JVM is platform dependant
10. What is DBMS
11. Upto where they reached in teaching
12. Why u choose TCS ?
13. are you able to work under high pressure
14. Any questions for the interviewer.

Questions are asked by civil engineer students.

Telegram - https://t.me/Coding_human
https://t.me/Accenture_lti_Accolite_exam

Infoysys Exam material

https://drive.google.com/open?id=1A0so4BGzkynu4k9T0hl-c6yokMBlMQiF

Join : @Coding_human
https://t.me/Accenture_lti_Accolite_exam

Infosys is sending System engineer exam mail, which will be held on 23th Jan.

static int sum_of_differences(int arr[], int N)
{



// Stores the sum

int sum = 0;


int i, j, flag;


// Traverse the array

for(i = 0; i < N - 1; i++)

{

if (arr[i] < arr[i + 1])

{

flag = 0;


for(j = i + 1; j < N - 1; j++)

{


// If last element of the

// increasing sub-array is found

if (arr[j] >= arr[j + 1])

{


// Update sum

sum += (arr[j] - arr[i]);

i = j;

flag = 1;



break;

}

}


// If the last element of the array

// is reached

if (flag == 0 && arr[i] < arr[N - 1])

{


// Update sum

sum += (arr[N - 1] - arr[i]);


break;

}

}

}


// Return the sum

return sum;
}

INFOSYS & TCS NQT EXAM SOLUTION GROUP 👇

https://t.me/Coding_human

https://t.me/infosys_all_slots_lti_exam


✅ Share post in ur college Whatsapp grps.

TCS

2)1541
1)4-2+1
3)0.039
4)3 root 5
6)785 kg
7)66.6

Telegram - https://t.me/Coding_human

Infosys mcq ans

Verbal tcs

1)up to the mark


2)stand up for


3)all in all


4)found a blood


5)c


6)but my father


7)the car for


8)cheerful


9)unrepe

10)praise


11)stromy


12)ease


13)nar

Verbal tcs

1)up to the mark


2)stand up for


3)all in all


4)found a blood


6)but my father

7)the car for


8)cheerful


9)unrepe

10)praise

11)strom
12. Ease
13 nar
14 . Fasti
15 dabc
16 .cadb
17 strategic
18. A rare
19 ca
21. A servey
22.sightning
23 goose.
24 marsh

INFOSYS PUZZLE

1:-15
2:-73
3:-M
4:-
https://t.me/Coding_human

Psedo code


1:-55
2:-passed
3:-33
4:-O(nlogn)
5:-13

✅Telegram- https://t.me/Coding_human

Reasoning

1)242


2)370

3)166


4)124


5)99


6) 380


7)uc


8)qf

9)ur


10)2,5 3


11)3,5,1
12.315
13 gs
14.13 j
15 father in law
https://t.me/Coding_human

Python

Tcs 2nd question

Join TG https://t.me/Coding_human