Added Largest Perimeter leetcode problem solution in c++

Author: sunilkumarmaurya786693

.gitignore

@@ -3,9 +3,13 @@
 !*.*
 !*/
 .vscode
+.DS_Store
+testCPP/*
 Coding-ninjas-competitive
 Competitive-Coding
 Dynamic-Programming
 leetcode_company_wise_questions-master
 comptetive-programming_interview-resource
-coding template by other
+coding template by other
+low level/Online_Examination_CPP
+low level/Online_Examination_CPP

leetcode/array/976_Largest_Perimeter_Triangle.cpp

@@ -0,0 +1,25 @@
+// Given an integer array nums, return the largest perimeter of a triangle with a non-zero area, formed from three of these lengths. If it is impossible to form any triangle of a non-zero area, return 0.
+// Example 1:
+
+// Input: nums = [2,1,2]
+// Output: 5
+// Example 2:
+
+// Input: nums = [1,2,1]
+// Output: 0
+
+class Solution {
+public:
+ int largestPerimeter(vector<int>& nums) {
+ sort(nums.begin(),nums.end(), greater<int>());
+ for(int i=0;i<nums.size()-2;i++){
+ int a = nums[i];
+ int b = nums[i+1];
+ int c = nums[i+2];
+ if(a < b+c){
+ return a+b+c;
+ }
+ }
+ return 0;
+ }
+};