Software Engineer

Step 1 : Run a for loop from 2 to N
Step 2 : check each number if it is prime or not
Step 3 : if prime then print

Step 1 : We will Iterate through the array and pivot each element as the first side of the triangle. Let’s say we are at ‘I’ th index, So we will pivot ‘I’th index as our first side of the triangle.

Step 2 : And for the second side of the triangle, we will start exploring from the next index of ‘I’ and pivot each element from (I+1) till the end as the second side of the triangle. Let’s say we are at the ‘J’th index, So we will pivot the ‘J’th index as our second side of the triangle.

Step 3 : And for the third side of the triangle we will iterate from the next index of ‘J’ till the end of the array/list and pivot each element from (J+1) to till the end as the third side of the triangle, say at index ‘K’.

Step 4 : For each triplet, we will check whether it satisfies all the conditions for forming a non-degenerate triangle or not, I.e
          1. 'ARR'[I] +'ARR'[J] >'ARR'[K]

          2. 'ARR'[J] + 'ARR'[K] > 'ARR'[I]

          3. 'ARR'[I] + 'ARR'[K] > 'ARR'[J] 

If yes, then return true otherwise we will go to the next triplet.
If no triplet can become sides of a non-degenerate triangle, return false.

string remove_duplicate(string str) 
{
   	int v[256];
   	for (int i = 0; i < 256; i++) {
		v[i] = 0;
	}
	string ans = "";
	for (int i = 0; i < str.length(); i++) {
		int asc = int(str[i]);
		if (v[asc] == 0) {
			ans.push_back(str[i]);
			v[asc] = 1;
		}
	}
	return ans;
}