CODING SOLUTION - Placement Jobs & Materials

2022-01-28 07:01:55 import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;


public class Main {
public static void main(String[] args) throws NumberFormatException, IOException
{
BufferedReader br=new BufferedReader(new InputStreamReader(System .in));
int t=Integer.parseInt(br.readLine());

while(t-->0)
{
int n=Integer.parseInt(br.readLine());
String[] num_str=br.readLine().split(" ");
int[] num=new int[n];
int i;
for(i=0;i {
num[i]=Integer.parseInt(num_str[i]);
}

int pos=0;
int count=0;
if(n!=1)
{
while(true)
{
int step=num[pos];
int max=-1;
int max_ind=-1;

int limit;

if(step>n-pos-1)
{
count++;
break;
}
for(i=pos+1;i<=pos+step;i++)
{
if(max {

max=num[i];
max_ind=i;
}
}
//System.out.println("-"+max);
pos=max_ind;
count++;

}
}
else
{
count++;
}
System.out.println(count);
}
}

}

Java
Energy drink code
Telegram - t.me/codingsolution_IT

24.7K views04:01

Open / Comment

2022-01-28 06:57:06 #include
#include

int isPerfectSquare(int number)
{
int iVar;
float fVar;

fVar=pow(number,1.0/3.0);
iVar=(int)fVar;

if(iVar==fVar)
return number;
else
return 0;
}

int main()
{
int n;
scanf(“%d”,&n);
int arr[n];
int i;
for(i = 0; i < n; i++)
{
scanf("%d",&arr[i]);
}
int count = 0;
for(i = 0; i < n; i++)
{
if(isPerfectSquare(arr[i]))
count++;
}
printf("%d",count);
return 0;
}

E-Commerce
Telegram - t.me/codingsolution_IT

22.5K views03:57

Open / Comment

2022-01-28 06:51:22 Python
Qsn 3 Infosys(Problem statement)
Telegram - t.me/codingsolution_IT Open / Comment

2022-01-28 06:37:45 REVATURE & INFOSYS EXAM SOLUTION GROUP

t.me/codingsolution_IT

t.me/infosys_exam_revature_exam

Share post in ur college Whatsapp grps. Open / Comment

2022-01-27 16:30:07 import java.util.Scanner;

public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int[] array = new int[6];
int max = 0;
for (int i = 0; i < array.length; i++) {
array[i] = in.nextInt();
if (array[max] < array[i]) {
max = i;
}
}
int cities = in.nextInt();
System.out.println(max);
}
}

Java
ALT TAB Window Code
Telegram - t.me/codingsolutions_IT Open / Comment

2022-01-27 16:28:27 Python 3
Alfred McDonald's Code
Telegram - t.me/codingsolution_IT Open / Comment

2022-01-27 16:26:38 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 - t.me/codingsolution_IT Open / Comment

2022-01-27 16:22:26 C++ Language
Maximum subarray
Write This code in your function side
Telegram: t.me/codingsolution_IT Open / Comment

2022-01-27 16:20:05 C++
World of Flavors Code
Telegram - t.me/codingsolution_IT Open / Comment

2022-01-27 15:13:14 INFOSYS ON-CAMPUS EXAM PAPER – 12th July 2021:
Telegram - t.me/studymaterial_IT Open / Comment