C :

#include "stdio.h"


void delSpeCh(char *s)
{
 char *f, *e;
f = e = s;  
 int i, j;

while(*e) 
 e++;
 e--;  
 while(*e == '*') 
 e--;
 while(*f == '*') 
f++;

for (i = 0 , j = 0; &f[i] < e; i++)
 {
 if (f[i] != '*')

 f[j++] = f[i];

}
 for (i = 0; e[i]; i++, j++) 
 f[j] = e[i];
 f[j] = '\0';  

}
int main(int agrc, char *agrv[])
{
char s[100];
gets(s); 
 delSpeCh(s);


puts(s);
return 0;
}

C++ :

#include<bits/stdc++.h>
using namespace std;
int main(){
	int i,x,y;
	char s[1000];
	gets(s);
	for (i=0;i<strlen(s);i++) {
		if (s[i]!='*') {
			x=i;
			break;
		}
	}
	for (i=strlen(s)-1;i>=0;i--) {
		if (s[i]!='*') {
			y=i;
			break;
		}
	}
	for (i=0;i<strlen(s);i++) {
		if (i>=x&&i<=y) {
			if (s[i]!='*') {
				cout<<s[i];	
			}			
		} else {
			cout<<s[i];
		}
	}

    return 0;
}

Java :

import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String c = scanner.nextLine();
        String b = new String();
        int count1 = 0,count2 = 0;
        for (int i = 0; i < c.length(); i++) {
            if(String.valueOf(c.charAt(i)).equals("*")){
                count1++;
                b = b + c.charAt(i);
            }else break;
        }
        for (int i = c.length() - 1; i >= 0; i--) {
            if(String.valueOf(c.charAt(i)).equals("*")){
                count2++;
            }else break;
        }
        for(int i = count1 - 1;i < c.length() - count2;i++){
            if(!String.valueOf(c.charAt(i)).equals("*")){
                b = b + c.charAt(i);
            }
        }
        for (int i = c.length() - 1; i >= c.length() - count2; i--) {
            if(String.valueOf(c.charAt(i)).equals("*"))b = b + c.charAt(i);
        }
        System.out.println(b);


    }public static void paiXu(int[] a,int length){
        int temp;
        for(int i = 0;i < length - 1;i++){
            for(int k = 0;k < length - i - 1;k++){
                if(a[k] > a[k + 1]){
                    temp = a[k];
                    a[k] = a[k + 1];
                    a[k + 1] = temp;
                }
            }
        }
    }
    public static int er(int n)
    {
        if(n==0)
        {return 0;}
        int f1=1,f2;
        n--;
        while(n != 0)
        {
            f2=f1*2;
            f1=f2;
            n--;
        }
        return f1;
    }

    public static void paiXud(int[] a){
        int temp;
        for(int i = 0;i < a.length - 1;i++){
            for(int k = 0;k < a.length - i - 1;k++){
                if(a[k] < a[k + 1]){
                    temp = a[k];
                    a[k] = a[k + 1];
                    a[k + 1] = temp;
                }
            }
        }
    } public static void paiXux(int[] a){
        int temp;
        for(int i = 0;i < a.length - 1;i++){
            for(int k = 0;k < a.length - i - 1;k++){
                if(a[k] > a[k + 1]){
                    temp = a[k];
                    a[k] = a[k + 1];
                    a[k + 1] = temp;
                }
            }
        }
    }

    public static int MAX2(int[][] a){
        int max = a[0][0];
        for (int i = 0; i < a.length; i++) {
            for(int j = 0;j < a[0].length;j++){
                if(max < a[i][j])max = a[i][j];
            }
        }
        return max;
    }public static int MIN2(int[][] a){
        int min = a[0][0];
        for (int i = 0; i < a.length; i++) {
            for(int j = 0;j < a[0].length;j++){
                if(min > a[i][j])min = a[i][j];
            }
        }
        return min;
    }
    public static int MAX(int[] a){
        int max = a[0];
        for (int i = 0; i < a.length; i++) {
            if(max < a[i]){
                max = a[i];
            }
        }
        return max;
    }

    public static int MIN(int[] a){
        int min = a[0];
        for (int i = 0; i < a.length; i++) {
            if(min > a[i]){
               min = a[i];
            }
        }
        return min;
    }
    public static int sum(int a){
        int x,s = 0;
        while(a != 0){
            x = a % 10;
            s = s + x;
            a /= 10;
        }
        return s;
    }
    public static boolean isPrime(int a){
        if(a <= 1)return false;
        else
        for(int i = 2;i <= Math.sqrt(a);i++){
            if(a % i == 0)return false;
        }return true;
    }

    public static long qiuYu(long i){
        long a;
        a = i % 10;
        return a;
    }
    public static int daoXu(int x){
        int s = 0,m;
        while(x != 0){
            m = x % 10;
            s = s * 10 + m;
            x /= 10;
        }
        return s;
    }

    public static int jiaWei(int x){
        int s = 0,m;
        while(x != 0){
            m = x % 10;
            s = s + m;
            x /= 10;
        }
        return s;
    }

    public static int fun(int x){
        if(x == 1 || x == 2)return 1;
        else return fun(x - 1) + fun(x - 2);
    }
}

Python :

str1 = input();
x = 0
y = 0
for i in str1:
   if i == '*':
      print(i,end='')
   else:
      break;

for i in str1:
     if i != '*':
        print(i,end='')

li = list(str1)
li.reverse();
str1 = ""
for i in li:
   str1 += i

for i in str1:
   if i == '*':
      print(i,end='')
   else:
      break;