Your browser is not supported. Please, update your browser or switch to a different one. Learn more about which browsers are supported.
Task description
An array A consisting of N integers is given. A triplet (P, Q, R) is triangular if 0 ≤ P < Q < R < N and:
- A[P] + A[Q] > A[R],
- A[Q] + A[R] > A[P],
- A[R] + A[P] > A[Q].
For example, consider array A such that:
A[0] = 10 A[1] = 2 A[2] = 5 A[3] = 1 A[4] = 8 A[5] = 20Triplet (0, 2, 4) is triangular.
Write a function:
class Solution { public int solution(int[] A); }
that, given an array A consisting of N integers, returns 1 if there exists a triangular triplet for this array and returns 0 otherwise.
For example, given array A such that:
A[0] = 10 A[1] = 2 A[2] = 5 A[3] = 1 A[4] = 8 A[5] = 20the function should return 1, as explained above. Given array A such that:
A[0] = 10 A[1] = 50 A[2] = 5 A[3] = 1the function should return 0.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [0..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].
Task timeline
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
Array.Sort(A);
if (A.Length <3) return 1;
for (int i=0 ; i<A.Length-3 ; i++)
{ if (A[i] + A[i+1] > A[i+2] )
{return 1;
break;
}
}
return 0;
}
}
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
Array.Sort(A);
if (A.Length <3) return 1;
for (int i=0 ; i<A.Length-2 ; i++)
{ if (A[i] + A[i+1] > A[i+2] )
{return 1;
break;
}
}
return 0;
}
}
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
Array.Sort(A);
if (A.Length <3) return 0;
for (int i=0 ; i<A.Length-2 ; i++)
{ if (A[i] + A[i+1] > A[i+2] )
{return 1;
break;
}
}
return 0;
}
}
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
Array.Sort(A);
if (A.Length <3) return 0;
for (int i=0 ; i<A.Length-2 ; i++)
{ if (A[i] + A[i+1] > A[i+2] )
{return 1;
break;
}
}
return 0;
}
}
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
Array.Sort(A);
if (A.Length <3) return 0;
for (int i=0 ; i<A.Length-2 ; i++)
{ if (A[i] + A[i+1] > A[i+2] )
{return 1;
break;
}
}
return 0;
}
}
The following issues have been detected: wrong answers.