Java String.copyValueOf() Method Last Updated : 24 Apr, 2025 Comments Improve Suggest changes Like Article Like Report The copyValueOf() method in Java is used to create a new String by copying characters from a character array. It is a static method of the String class.Variants: There are two variants of this method.Copy Entire Character ArrayCopy Subarray1. Copy Entire Character ArrayThis method copies the entire contents of a character array into a new string.Syntax:public static String copyValueOf(char[] ch)Parameter: ch: The character array to copy.Return Value: It returns a string containing the contents of the character array.Example: Java // Java code to demonstrate the working of // copyValueOf implementation 1 public class Geeks { public static void main(String args[]) { // Initialising Character array char[] ch = {'S', 'w', 'e', 't', 'a', ' ', 'D', 'a', 's', 'h'}; // Copying value into a String String ch2 = String.copyValueOf(ch); System.out.println("The new copied string is: " + ch2); } } OutputThe new copied string is: Sweta Dash 2. Copy SubarrayThis method copies a specific portion that is a subarray of a character array into a new string.Syntax:public static String copyValueOf(char[] ch, int index, int count)Parameter: ch: The character array to copy.index: Starting index to copycount: Number of characters to copyReturn Value: It returns a string consisting of the specified subarray of the character array.Example: Java // Java code to demonstrate the working of // copyValueOf implementation 2 public class Geeks { public static void main(String args[]) { // Initialising Character array char[] ch = {'S', 'w', 'e', 't', 'a', ' ', 'D', 'a', 's', 'h'}; // Copying only first 5 characters String ch2 = String.copyValueOf(ch, 0, 5); System.out.println("The new copied string is: " + ch2); } } OutputThe new copied string is: Sweta Application Example: Extracting SubstringsThis function can be used to general copy or extract only prefix or suffix from the string using implementation 2. One possible example can be extracting only the amount from the given “Rs 1024” type of strings which deal with denominations.Illustration: Java // Java code to demonstrate application of copyValueOf public class Geeks { public static void main(String args[]) { // Initialising Character array char[] ch = {'R', 's', ' ', '1', '0', '2', '4'}; // Display original array System.out.print("The original array is: "); for (char c : ch) System.out.print(c); System.out.print("\n"); // Extract only "1024" String ch2 = String.copyValueOf(ch, 3, 4); System.out.println("The new string is: " + ch2); } } OutputThe original array is: Rs 1024 The new string is: 1024 Comment More infoAdvertise with us Next Article Java String.copyValueOf() Method A Astha Tyagi Improve Article Tags : Strings Java DSA Java-Strings Java-lang package +1 More Practice Tags : JavaJava-StringsStrings 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 Java Tutorial Java is a high-level, object-oriented programming language used to build web apps, mobile applications, and enterprise software systems. It is known for its Write Once, Run Anywhere capability, which means code written in Java can run on any device that supports the Java Virtual Machine (JVM).Java s 10 min read Java Interview Questions and Answers Java is one of the most popular programming languages in the world, known for its versatility, portability, and wide range of applications. Java is the most used language in top companies such as Uber, Airbnb, Google, Netflix, Instagram, Spotify, Amazon, and many more because of its features and per 15+ min read Java OOP(Object Oriented Programming) Concepts Java Object-Oriented Programming (OOPs) is a fundamental concept in Java that every developer must understand. It allows developers to structure code using classes and objects, making it more modular, reusable, and scalable.The core idea of OOPs is to bind data and the functions that operate on it, 13 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 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 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 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 Like