NATARAJA MURTHY

Task: Given an array of N numbers. Print only those numbers, which are consist of 1, 2 and 3. Example: Input: 1 4 1 2 3 4 Output: 1 2 3 Here is the Code: Program in C++: #include<iostream> #include<bits/stdc++.h> using namespace std; bool isValid(int n) {     int a;     if(n==0) return 0;     while(n!=0)     {         a=n%10;         if(a==1||a==2||a==3) n/=10;         else return 0;     }     return 1; } int numbers(int *a,int n) {     map<int,int> m;     for(int i=0;i<n;i++)     {         if(isValid(a[i]))         {             m[a[i]]++;         }     }     int c=0;     for(auto i=m.begin();i!=m.end();i++)     {         while(i->second--) cout<<i->first<...

Task: Given a string S, Find the longest sub string with all distinct characters. Example: Input: 1 abca Output: abc Here is the Code: Program in C++: #include<iostream> #include<bits/stdc++.h> using namespace std; int longestDistinctCharacters(string s) {     map<char,int> m;     int c=0,l=0;     for(int i=0;i<s.length();i++)     {         if(m.find(s[i])==m.end())         {             m[s[i]]=i;             c++;         }         else         {             if(l<c)             {                 l=c;             }             i=m[s[i]];             c=0;       ...

Task: Given a N*N matrix, print the values of matrix in anti diagonal way. Example: Input: 1 1 2 3 4 5 6  7 8 9 Output: 1 2 4 5 6 7 6 8 9 // 1-2,4-3,5,7-6,8-9. Here is the Code: Program in C++: #include<iostream> using namespace std; int main()  { int t; cin>>t; while(t--) {     int n;     cin>>n;     int a[n][n];     for(int i=0;i<n;i++)     {         for(int j=0;j<n;j++)         {             cin>>a[i][j];         }     }     int i,k;         for(int j=0;j<n;j++)         {             i=0,k=j;             while(k>=0)             {                 cout<<a[i++][k--]<<" "; ...

Task: Given a string S. Find the first repeated character in it. Example: Input: 1 geeksforgeeks Output: e // first repeated character and second time occurred character index is smallest. Here is the Code: Program in C++:  #include<iostream> #include<bits/stdc++.h> using namespace std; int main()  { int t; cin>>t; while(t--) {     string s;     cin>>s;     map<char,int> m;     int c=0;     for(int i=0;i<s.length();i++)     {         m[s[i]]++;         if(m[s[i]]==2)         {             cout<<s[i]<<endl;             c=1;             break;         }     }     if(c==0)     {         cout<<-1<<endl; ...

Task: Given an array arr[] of size N. Reverse every sub array of K elements. Example: Input: 1 5 3 1 2 3 4 5 Output: 3 2 1 5 4 Here is the Code: Program in C++: #include<iostream> #include<bits/stdc++.h> using namespace std; void reverseArrayInGroups(long long int *a,int n,int k) {     int t=(n+k-1)/k;     int i=0,j;     stack<long long int> st;     while(t--)     {         j=k;         int l=i;         while(j!=0&&i<n)         {             st.push(a[i]);             i++;             j--;         }         while(!st.empty())         {             a[l]=st.top();             l++;             st.p...

Task: Given two arrays A and B of size N and M respectively. Sort the array A based on elements in B. If A elements not present in B then append them at the end in sorted order. Example: Input: 1 11 4 2 1 2 5 7 1 9 3 6 8 8 2 1 8 3 Output: 2 2 1 1 8 8 3 5 6 7 9 Here is the Code: Program in C++: #include<iostream> #include<bits/stdc++.h> using namespace std; int main()  { int t; cin>>t; while(t--) {     int n,m;     cin>>n>>m;     int a[n],b[m];     map<int,int> rs;     for(int i=0;i<n;i++)     {         cin>>a[i];         rs[a[i]]++;     }     for(int i=0;i<m;i++)     {         cin>>b[i];         if(rs.find(b[i])!=rs.end())         {             int t = rs[b[i]];   ...

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;       ...

Task: Given an array of distinct elements, Find the number of triplets. Triplet means two elements sum is equals to third element. Example: Input: 1 4 1 5 3 2 Output: 2 // 1 + 2 = 3 and 2 + 3 = 5. Here is the Code: Program in C++: #include<iostream> #include<bits/stdc++.h> int countTheTriplets(int *a,int n) {     sort(a,a+n);     //1 2 3 5     int j,k,c=0;     for(int i=0;i<n-2;i++)     {         j=i+1;         k=j+1;         while(k<n)         {             if(a[i]+a[j]==a[k])             {                 c++;                 j++;                 //k--;             }             else if(a[i]+a[j]<a[k]...