public class Solution {
static int largestElement(int[] arr, int n) {
return Arrays.stream(arr).max().getAsInt();
}
}
Problem of the day
Given an array ‘arr’ of size ‘n’ find the largest element in the array.
Example:
Input: 'n' = 5, 'arr' = [1, 2, 3, 4, 5]
Output: 5
Explanation: From the array {1, 2, 3, 4, 5}, the largest element is 5.
Input Format :
The first line will contain a single integer 'n', the size of the array ‘arr’
The second line will contain ‘n’ integers representing the array elements.
Output format :
Print the maximum of elements.
Note :
You don't need to print anything. It has already been taken care of. Just implement the given function.
6
4 7 8 6 7 6
8
The answer is 8.
From {4 7 8 6 7 6}, 8 is the largest element.
8
5 9 3 4 8 4 3 10
10
O(n), Where ‘n’ is the size of an input array ‘arr’.
1 <= 'n' <= 10^5
1 <= 'arr[i]' <= 10^9
Time Limit: 1 sec
Think about how to iterate through the array and keep track of the largest element encountered so far.
We can create a temporary variable ‘temp’ and traverse the array and update the temporary variable ‘temp’ with the max of the elements.
The steps are as follows:-
O(n), Where ‘n’ is the size of an input array ‘arr’.
We are traversing the array of size ‘n’
.
Hence time complexity is O(n).
O(1).
We are creating a temporary variable that takes constant space with respect to array size.
Hence space complexity is O(1).
Interview problems
Solution By Java8
public class Solution {
static int largestElement(int[] arr, int n) {
return Arrays.stream(arr).max().getAsInt();
}
}
Interview problems
Largest Element in the Array
import java.util.* ;
import java.io.*;
public class Solution {
static int largestElement(int[] arr, int n) {
// Write your code here.
int max = arr[0];
for(int i=0; i<arr.length; i++){
if(arr[i] > max){
max = arr[i];
}
}
return max;
}
}
Interview problems
Java Program
public class Solution {
static int largestElement(int[] arr, int n) {
// Write your code here.
int max=arr[0];
for(int i=1;i<n;i++){
if(arr[i]>max)
max=arr[i];
}
return max;
}
}
Interview problems
JAVA
import java.util.* ;
import java.io.*;
public class Solution {
static int largestElement(int[] arr, int n) {
// Write your code here.
int max=Integer.MIN_VALUE;
int min=0;
for(int i=0;i<arr.length;i++){
if(arr[i]>max){
max=arr[i];
// min=max;
}
}
return max;
}
}
Interview problems
Largest Element in the Array using stream API
import java.util.* ;
import java.io.*;
public class Solution {
static int largestElement(int[] arr, int n) {
return Arrays.stream(arr).max().getAsInt();
}
}
Interview problems
Easy c/c++ solution
int largestElement(vector<int> &arr, int n) {
// Write your code here.
int max = INT_MIN;
for(int i=0;i<n;i++)
{
if(arr[i] >= max)
{
max = arr[i];
}
}
return max;
}
Interview problems
Logic using C++ (Better than 100%)
#include <bits/stdc++.h>
int largestElement(vector<int> &arr, int n) {
int largest=0;
for(int i=0;i<n;i++){
if(arr[i]>largest){
largest=arr[i];
}
}
return largest;
// Write your code here.
}
Interview problems
c++ solution
#include <bits/stdc++.h>
int largestElement(vector<int> &arr, int n) {
int max=0;
// Write your code here.
for (int i=0;i<n;i++)
{
if(arr[i]>max)
{
max=arr[i];
}
}
return max;
}
Interview problems
Python EASY soln with O(n) complexity
def largestElement(arr: [], n: int) -> int:
max =arr[0]
for i in range (n):
if arr[i] > max :
max = arr[i]
return max
pass
Interview problems
Largest Element in the Array - JAVA
import java.util.* ;
import java.io.*;
public class Solution {
static int largestElement(int[] arr, int n) {
int temp = 0;
for(int i =0 ;i<n;i++){
if(temp<arr[i]){
temp = arr[i];
}
}
return temp;
}
}