How to create half of the string in uppercase and the other half in lowercase?
Last Updated :
29 Jan, 2024
The first thing that we have to keep in my mind while solving this kind of problem is that the strings are immutable i.e,
If I am taking the following string
var string1 = "geeksforgeeks";
string1[0] = "G";
console.log(string1);
As strings are immutable, so we cannot change the character of the string, so the output of the above code will be the following.
Output:
geeksforgeeks
Approach:
There are several ways to solve this problem. Some of them are as follows.
- Splitting the string into 2 different parts and changing the first part to the UPPERCASE and concatenating the new strings to get the output.
- Create an empty string and add each character of the string to it using FOR loop.
- Using the slicing property of strings to get the output.
Method 1: This method is implemented using 2 new variables.
- Add the string into the variable.
- Store the length of the string into a variable using string.length function.
- Create two empty strings which are used in the future to store the newly created strings.
- Use of for loops to traverse in the string.
- Convert the first string to the upper case using toUpperCase().
- Concatenate both of the strings to get the output.
C++
#include <iostream>
using namespace std;
int main() {
string str = "geeksforgeeks",ans;
int len = str.length();
for(int i = 0;i<len;i++){
if(i<=len/2){
char a = toupper(str[i]);
ans.push_back(a);
}else
ans.push_back(str[i]);
}
cout<<ans;
return 0;
}
// This code is co ntributed by rohitsingh07052
Java
public class GFG {
public static void main(String[] args) {
// Input string
String str = "geeksforgeeks";
// StringBuilder to store the result
StringBuilder ans = new StringBuilder();
// Get the length of the input string
int len = str.length();
// Loop through each character in the input string
for (int i = 0; i < len; i++) {
// Check if the current character is in the first half of the string
if (i <= len / 2) {
// Convert the character to uppercase and append it to the result
char a = Character.toUpperCase(str.charAt(i));
ans.append(a);
} else {
// If the character is in the second half, just append it as is
ans.append(str.charAt(i));
}
}
// Print the final result
System.out.println(ans);
}
}
Python3
import math
string1 = 'geeksforgeeks'
string1_len = len(string1)
part_a = ''
part_b = ''
for i in range(int(math.ceil(string1_len // 2 + 1))):
part_a += string1[i]
for i in range(int(math.ceil(string1_len // 2)) + 1,
string1_len):
part_b += string1[i]
new_part_a = part_a.upper()
changed_string = new_part_a + part_b
print(changed_string)
# This code is contributed by ukasp
C#
using System;
public class GFG
{
public static void Main(string[] args)
{
// Input string
string str = "geeksforgeeks";
// String builder to store the result
System.Text.StringBuilder ans = new System.Text.StringBuilder();
// Get the length of the input string
int len = str.Length;
// Loop through each character in the input string
for (int i = 0; i < len; i++)
{
// Check if the current character is in the first half of the string
if (i <= len / 2)
{
// Convert the character to uppercase and append it to the result
char a = char.ToUpper(str[i]);
ans.Append(a);
}
else
{
// If the character is in the second half, just append it as is
ans.Append(str[i]);
}
}
// Print the final result
Console.WriteLine(ans);
}
}
JavaScript
<script>
var string1 = 'geeksforgeeks';
var string1_len = string1.length;
var part_a = '';
var part_b = '';
for(var i=0 ; i<Math.ceil(string1_len/2) ; i++)
{
part_a+=string1[i];
}
for(var i=Math.ceil(string1_len/2) ; i<string1_len ; i++)
{
part_b+=string1[i];
}
var new_part_a = part_a.toUpperCase();
var changed_string = new_part_a + part_b;
console.log(changed_string);
</script>
Time Complexity: O(N)
Auxiliary Space: O(1)
Method 2: This method is implemented using a single new variable.
- Add the string into the variable.
- Store the length of the string into a variable using string.length function.
- Create an empty string that is used in the future to store the newly created string.
- Use of for loops to traverse the string.
- Log the final string to get the output.
C++
#include <iostream>
using namespace std;
string convertFun(string& s1, int n)
{
string ans = "";
// Running loop on first half and making it
// upper case
for (int i = 0; i < n / 2; i++) {
ans += toupper(s1[i]);
}
// Running loop on secone half
for (int i = n / 2; i < n; i++) {
ans += s1[i];
}
return ans;
}
// Driver code
int main()
{
string s1 = "geeksforgeeks";
// Finding length of string
int n = s1.size();
cout << convertFun(s1, n);
return 0;
}
// This code is added by Arpit Jain
Java
public class StringConversion {
// Function to convert the first half of the string to
// uppercase
static String convertFun(String s1, int n)
{
StringBuilder ans = new StringBuilder();
// Running loop on the first half and making it
// uppercase
for (int i = 0; i < n / 2; i++) {
ans.append(Character.toUpperCase(s1.charAt(i)));
}
// Running loop on the second half
for (int i = n / 2; i < n; i++) {
ans.append(s1.charAt(i));
}
return ans.toString();
}
// Driver code
public static void main(String[] args)
{
String s1 = "geeksforgeeks";
// Finding the length of the string
int n = s1.length();
System.out.println(convertFun(s1, n));
}
}
Python3
import math
string1 = 'gfg';
string1_len = len(string1)
changed_string = ''
for i in range(math.ceil(string1_len/2)):
changed_string += string1[i].upper();
for i in range(math.ceil(string1_len/2), string1_len):
changed_string += string1[i]
print(changed_string)
# This code is contributed by avanitrachhadiya2155
C#
using System;
class Program
{
// Function to convert the first half of the string to uppercase
static string ConvertFun(string s1, int n)
{
string ans = "";
// Running loop on the first half and making it upper case
for (int i = 0; i < n / 2; i++)
{
ans += char.ToUpper(s1[i]);
}
// Running loop on the second half
for (int i = n / 2; i < n; i++)
{
ans += s1[i];
}
return ans;
}
// Driver code
static void Main()
{
string s1 = "geeksforgeeks";
// Finding the length of the string
int n = s1.Length;
Console.WriteLine(ConvertFun(s1, n));
// This code is added by Arpit Jain
}
}
// This code is contributed by shivamgupta310570
JavaScript
<script>
var string1 = 'gfg';
var string1_len = string1.length;
var changed_string = '';
for(var i=0 ; i<Math.ceil(string1_len/2) ; i++)
{
changed_string+=string1[i].toUpperCase();
}
for(var i=Math.ceil(string1_len/2) ; i<string1_len ; i++)
{
changed_string+=string1[i];
}
console.log(changed_string);
</script>
Time Complexity: O(N)
Auxiliary Space: O(1)
Method 3: This method is implemented using the JavaScript Slice property.
- Add the string into the variable.
- Store the length of the string into a variable using string.length function.
- Store the ceil value of half of the length of the string to the new variable.
- Create 2 empty strings which are used in the future to store the newly created strings.
- Add string to the variables using string slicing property.
- Convert the first string to the upper case using toUpperCase().
- Concatenate both of the strings to get the output.
C++
#include <cmath>
#include <iostream>
int main()
{
// Given string
std::string string1 = "geeks for geeks";
// Calculate the length of the string
int string1Len = string1.length();
// Calculate the index to split the string into two
// halves
int halfString
= static_cast<int>(std::ceil(string1Len / 2.0));
// Declare variables to store the two parts of the
// string
std::string partA;
std::string partB;
// Extract the first half of the string
partA = string1.substr(0, halfString);
// Convert the first half to uppercase
for (char& ch : partA) {
ch = std::toupper(ch);
}
// Extract the second half of the string
partB = string1.substr(halfString, string1Len);
// Concatenate the modified first half and the second
// half
std::string changedString = partA + partB;
// Print the modified string
std::cout << changedString << std::endl;
return 0;
}
Java
public class Main {
public static void main(String[] args) {
// Given string
String string1 = "geeks for geeks";
// Calculate the length of the string
int string1Len = string1.length();
// Calculate the index to split the string into two halves
int halfString = (int) Math.ceil(string1Len / 2.0);
// Declare variables to store the two parts of the string
String partA;
String partB;
// Extract the first half of the string
partA = string1.substring(0, halfString);
// Convert the first half to uppercase
String newPartA = partA.toUpperCase();
// Extract the second half of the string
partB = string1.substring(halfString, string1Len);
// Concatenate the modified first half and the second half
String changedString = newPartA + partB;
// Print the modified string
System.out.println(changedString);
}
}
Python3
import math
string1 = 'geeksforgeeks'
string1_len = len(string1)
half_string = math.ceil(string1_len/2)
part_a = ''
part_b = ''
part_a = string1[:half_string]
new_part_a = part_a.upper()
part_b = string1[half_string:string1_len]
changed_string = new_part_a+part_b
print(changed_string)
# This code is contributed by rag2127
C#
using System;
class Program
{
static void Main()
{
// Given string
string string1 = "geeks for geeks";
// Calculate the length of the string
int string1Len = string1.Length;
// Calculate the index to split the string into two halves
int halfString = (int)Math.Ceiling(string1Len / 2.0);
// Extract the first half of the string
string partA = string1.Substring(0, halfString);
// Convert the first half to uppercase
partA = partA.ToUpper();
// Extract the second half of the string
string partB = string1.Substring(halfString, string1Len - halfString);
// Concatenate the modified first half and the second half
string changedString = partA + partB;
// Print the modified string
Console.WriteLine(changedString);
}
}
JavaScript
<script>
var string1 = 'geeks for geeks';
var string1_len = string1.length;
var half_string = Math.ceil(string1_len/2);
var part_a;
var part_b;
part_a = string1.slice(0,half_string);
var new_part_a = part_a.toUpperCase();
part_b = string1.slice(half_string,string1_len);
var changed_string = new_part_a+part_b;
console.log(changed_string);
</script>
Time Complexity: O(N)
Auxiliary Space: O(N)
In these ways, you can solve these kinds of problems.
Similar Reads
DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on
7 min read
Non-linear Components In electrical circuits, Non-linear Components are electronic devices that need an external power source to operate actively. Non-Linear Components are those that are changed with respect to the voltage and current. Elements that do not follow ohm's law are called Non-linear Components. Non-linear Co
11 min read
Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s
12 min read
Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge
14 min read
Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st
2 min read
Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir
8 min read
Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta
15+ min read
Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc
15 min read
JavaScript Tutorial JavaScript is a programming language used to create dynamic content for websites. It is a lightweight, cross-platform, and single-threaded programming language. It's an interpreted language that executes code line by line, providing more flexibility.JavaScript on Client Side: On the client side, Jav
11 min read
Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T
9 min read