You are given an array/list 'ARR' of size 'N'. You task is to find if there exists a triplet (i, j, k) such that 0 < i , i + 1 < j , j + 1 < k and k < 'N'...
Tip 1 : Don't waste much time on easy questions Tip 2 : If you can't make a solution to the problem. Check out other's solution Tip 3 : Do some good projects
Application Process
Where:
Campus
Eligibility:
Above 7 CGPA
Resume Tip
Tip 1 : Write only those skills in which you are confident Tip 2 : Have a variety of achievements in your resume
0 upvotes
Have an interview experience that you want to contribute?