NATARAJA MURTHY

Task: Given an array of strings, Find the longest common prefix among all the strings in the array. Example: Input: 1 4 geeksforgeeks geeks geek geezer Output: gee Here is the Code: Program in C++: #include<iostream> using namespace std; void longestCommonPrefix(string *a,int n) {     string s1= a[0];     for(int i=1;i<n;i++)     {         string s2=a[i];         int j=0;         while(j<s1.length())         {             if(s1[j]==s2[j])             {                 j++;             }             else             {                 s1.erase(j,s1.length());                 break;       ...