Move all Uppercase char to the end of string

Given a string, move all Uppercase alphabets char to the end of the String. 

Examples:

Input : Geeksforgeeks A Computer Science Portal for Geeks!!
Output : eeksforgeeks  omputer cience ortal for eeks!!GACSPG

Input : Hello India
Output : ello ndiaHI              

Method #1: Without Using Regular Expression 
The idea is to traverse the input string and maintain two strings, one string that contains lowercase characters (a, c, z, etc) and the other string that maintains Uppercase characters (A, C, Z, etc). Finally, concatenate the two strings and return. 

Below is the implementation.  

C++

// C++ program move all uppercase alphabets
// to the end of string

#include<bits/stdc++.h>
using namespace std;

string move(string str)
{
    // take length of given string
    int len = str.length();

    // low store lowercase alphabets
    string low = "";

    // upr store uppercase alphabets
    string upr = "";

    // traverse string first char to last char
    char ch;
    for (int i = 0; i < len; i++) {
        ch = str[i] ;

        // check char is in uppercase or lower case
        if (ch >= 'A' && ch <= 'Z') {
            upr += ch;
        }
        else {
            low += ch;
        }
    }
        return low + upr;
}

int main()
{
    string str = "Geeksforgeeks A Computer Science Portal for Geeks!!";
    cout << "Before Operation: " << str << endl;
    cout << "After Operation: " << move(str) << endl;

   return 0;
}
// This code is contributed by Ryuga

Java

// Java program move all uppercase alphabets
// to the end of string

public class GFG {

    static public String move(String str)
    {
        // take length of given string
        int len = str.length();

        // low store lowercase alphabets
        String low = "";

        // upr store uppercase alphabets
        String upr = "";

        // traverse string first char to last char
        char ch;
        for (int i = 0; i < len; i++) {
            ch = str.charAt(i);

            // check char is in uppercase or lower case
            if (ch >= 'A' && ch <= 'Z') {
                upr += ch;
            }
            else {
                low += ch;
            }
        }
        return low + upr;
    }

    public static void main(String args[])
    {
        String str = "Geeksforgeeks A Computer Science Portal for Geeks!!";
        System.out.println("Before Operation:   " + str);
        System.out.println("After Operation:    " + move(str));
    }
}

Python3

# Python3 program move all uppercase
# alphabets to the end of string

def move(str):

    # take length of given string
    len__ = len(str)

    # low store lowercase alphabets
    low = ""

    # upr store uppercase alphabets
    upr = ""

    # traverse string first char to last char
    for i in range(0, len__, 1):
        ch = str[i]

        # check char is in uppercase or
        # lower case
        if (ch >= 'A' and ch <= 'Z'):
            upr += ch

        else:
            low += ch

    return low + upr

# Driver Code
if __name__ == '__main__':
    str = "Geeksforgeeks A Computer Science Portal for Geeks!!"
    print("Before Operation:", str)
    print("After Operation:", move(str))

# This code is contributed by
# Sahil_Shelangia

C#

// C# program move all uppercase
// alphabets to the end of string
using System;

class GFG
{

static public string move(string str)
{
    // take length of given string
    int len = str.Length;

    // low store lowercase alphabets
    string low = "";

    // upr store uppercase alphabets
    string upr = "";

    // traverse string first char
    // to last char
    char ch;
    for (int i = 0; i < len; i++)
    {
        ch = str[i];

        // check char is in uppercase
        // or lower case
        if (ch >= 'A' && ch <= 'Z')
        {
            upr += ch;
        }
        else
        {
            low += ch;
        }
    }
    return low + upr;
}

public static void Main()
{
    string str = "Geeksforgeeks A Computer Science Portal for Geeks!!";
    Console.WriteLine("Before Operation: " + str);
    Console.WriteLine("After Operation: " + move(str));
}
}

// This code is contributed
// by Mukul Singh

Javascript

function move(str) {
    // take length of given string
    const len = str.length;

    // low store lowercase alphabets
    let low = "";

    // upr store uppercase alphabets
    let upr = "";

    // traverse string first char to last char
    let ch;
    for (let i = 0; i < len; i++) {
        ch = str.charAt(i);

        // check char is in uppercase or lower case
        if (ch >= "A" && ch <= "Z") {
            upr += ch;
        } else {
            low += ch;
        }
    }
    return low + upr;
}

const str = "Geeksforgeeks A Computer Science Portal for Geeks!!";
console.log("Before Operation:   " + str);
console.log("After Operation:    " + move(str));
// This code is contributed by dtewbxkn77n

Output

Before Operation: Geeksforgeeks A Computer Science Portal for Geeks!!
After Operation: eeksforgeeks  omputer cience ortal for eeks!!GACSPG

Time Complexity: O(n), where n is the length of the given string.
Auxiliary Space: O(n)

Method #2: Using Regular Expression

C++

//C++ program move all uppercase alphabets to
// the end of string
#include <bits/stdc++.h>
using namespace std;

// Function return a string with all
// uppercase letter to the end of string
string move(string s)
{
    // first take all lower case letter
    // and take all uppercase letter
    // and Finally concatenate both and return  str1.replace(8,1,"C##",2);
    regex re("[A-Z]+");
    regex re1("[^A-Z]+");
    return regex_replace(s, re, "") + regex_replace(s, re1, "");
}

int main()
{
    string str = "Geeksforgeeks A Computer Science Portal for Geeks!!";

    cout << "Befour Operation:   " << str << endl;
    cout << "After Operation:    " << move(str);
}
// This code is contributed by shubhamsingh10

Java

// Java program move all uppercase alphabets to
// the end of string
public class GFG {

    // Function return a string with all
    // uppercase letter to the end of string
    static public String move(String s)
    {
        // first take all lower case letter
        // and take all uppercase letter
        // and Finally concatenate both and return
        return s.replaceAll("[A-Z]+", "") + s.replaceAll("[^A-Z]+", "");
    }

    public static void main(String args[])
    {
        String str = "Geeksforgeeks A Computer Science Portal for Geeks!!";

        System.out.println("Befour Operation:   " + str);
        System.out.println("After Operation:    " + move(str));
    }
}

Python3

# Python3 program move all uppercase alphabets
# to the end of string
import  re

# Function return a string with all
# uppercase letter to the end of string
def move(s):

    # First take all lower case letter
    # and take all uppercase letter
    # and Finally concatenate both and return
    words = re.findall('[a-z]*', s)
    words1 = re.findall('[A-Z]*', s)
    words2 = re.findall('[@_!#$%^&*()<>?/|}{~:]', s)

    return (' '.join(words) + ''.join(words2) +
             ''.join(words1))

# Driver code
if __name__ == '__main__':

    str = "Geeksforgeeks A Computer " \
          "Science Portal for Geeks!!"

    print("Befour Operation:   " + str)
    print("After Operation:    " + move(str))

# This code is contributed by gauravrajput1

C#

// C# program move all uppercase
// alphabets to the end of string
using System;
using System.Text.RegularExpressions;
class GFG{

// Function return a string with
// all uppercase letter to the
// end of string
static public String move(String s)
{
  // first take all lower case
  // letter and take all uppercase
  // letter and Finally concatenate
  // both and return
  var reg = new Regex(@"[A-Z]");
  var reg1 = new Regex(@"[^A-Z]");
  return reg.Replace(s, "") +
         reg1.Replace(s, "") ;
}

// Driver code
public static void Main(String []args)
{
  String str = "Geeksforgeeks A Computer" +
               "Science Portal for Geeks!!";
  Console.WriteLine("Befour Operation:   " +
                     str);
  Console.WriteLine("After Operation:    " +
                     move(str));
}
}

// This code is contributed by Rajput-Ji

Javascript

<script>

// JavaScript program move all uppercase alphabets to
// the end of string

// Function return a string with all
// uppercase letter to the end of string
function move(s)
    {

        // first take all lower case letter
        // and take all uppercase letter
        // and Finally concatenate both and return
        return s.replace(/[A-Z]/g, "");
    }

// Drive code
        var str = "Geeksforgeeks A Computer Science Portal for Geeks!!";

        document.write("Befour Operation:   " + str + "<br>");
        document.write("After Operation:    " + move(str));

// This code is contributed by shivanisinghss2110
</script>

Output

Befour Operation:   Geeksforgeeks A Computer Science Portal for Geeks!!
After Operation:    eeksforgeeks  omputer cience ortal for eeks!!GACSPG

Time Complexity: O(n), where n is the length of the given string.
Auxiliary Space: O(1)