Skip to main content

Java Interview Question: Why String is Immutable in Java (With Examples & Benefits)

 🔹 Introduction

One of the most commonly asked Core Java interview questions is:

👉 “Why is String immutable in Java?”

This question tests your understanding of:

  • Memory management
  • Security
  • Performance

🔹 What Does Immutable Mean?

An immutable object is one whose state cannot be changed after creation.

👉 In Java:

  • Once a String is created, it cannot be modified

🔹 Example

public class Test {
public static void main(String[] args) {
String str = "hello";

str.concat(" world");

System.out.println(str);
}
}

🔹 Output

hello

👉 Because original string is not modified


🔍 How String is Immutable Internally

  • String class is final
  • Internal value stored in char array
  • No setter methods

👉 Any modification creates a new object


🔹 Example with New Object

String str = "hello";
str = str.concat(" world");

System.out.println(str);

👉 Output:

hello world

🧠 String Constant Pool Concept

String a = "java";
String b = "java";

👉 Both refer to same memory location
👉 Saves memory


🔹 Why String is Immutable?


🥇 1. Security

  • Used in:
    • Database URLs
    • File paths
  • Prevents modification

🥈 2. Thread Safety

  • Immutable objects are thread-safe
  • No synchronization needed

🥉 3. Performance (String Pool)

  • Reuse existing objects
  • Saves memory

🏅 4. HashMap Key Stability

  • Used as keys in HashMap
  • Ensures consistent hashCode

🔹 Time Complexity

  • Depends on operation
  • String creation → O(n)

🔹 Key Takeaways

✔ String is immutable
✔ Any change creates new object
✔ Improves security and performance
✔ Frequently asked interview question


🔹 Conclusion

String immutability is a core concept in Java and plays a crucial role in performance, security, and memory optimization.

🔗 Also Read

Comments

Popular posts from this blog

Top Java Interview Question: First Non-Repeating Character in a String

  🔹 Introduction Java interviews often include string-based questions. One of the most commonly asked questions is: 👉 Find the first non-repeating character in a string. In this article, we will solve it step by step in a simple and easy-to-understand way. 🔹 Problem Statement Given a string, find the first character that does not repeat. Example: Input: aabbcde Output: c 🔹 Approach To solve this problem efficiently: Count frequency of each character Maintain insertion order Traverse again to find the first character with frequency = 1 👉 We use LinkedHashMap because: It maintains insertion order Helps us find the first non-repeating character 🔹 Java Code import java . util . *; public class FirstNonRepeating { public static void main ( String [] args ) { String str = "aabbcde" ; Map < Character , Integer > map = new LinkedHashMap <>(); // Count frequency for ( char ch : str . to...

Java Interview Question: Separate Even and Odd Numbers Using Streams (With Examples)

  🔹 Introduction Separating even and odd numbers is a common Java interview question. It helps test your understanding of Java Streams, filtering, and partitioning . 👉 In this article, we will solve this using: Traditional approach Java Streams (modern approach) 🔹 Problem Statement Given a list of integers, separate even and odd numbers. Example: Input: [1, 2, 3, 4, 5, 6] Output: Even: [2, 4, 6], Odd: [1, 3, 5] 🔹 Approach 1: Using Loop (Basic) 💡 Explanation Traverse list Check number % 2 Store in separate lists 👨‍💻 Java Code import java . util . *; public class EvenOdd { public static void main ( String [] args ) { List < Integer > list = Arrays . asList ( 1 , 2 , 3 , 4 , 5 , 6 ); List < Integer > even = new ArrayList <>(); List < Integer > odd = new ArrayList <>(); for ( int num : list ) { if ( num % 2 == 0 ) { even . add ( num )...

Java Interview Question: Check if a String is a Palindrome

 🔹 Introduction String problems are very common in Java interviews. One of the easiest yet frequently asked questions is: 👉 Check whether a given string is a palindrome. Let’s understand how to solve it step by step. 🔹 Problem Statement A string is called a palindrome if it reads the same forward and backward. Example: Input: madam Output: Palindrome Input: hello Output: Not a Palindrome 🔹 Approach 1: Using Two Pointers (Best Method) Start one pointer from the beginning Start another pointer from the end Compare characters If all match → Palindrome 🔹 Java Code (Two Pointer Approach) public class PalindromeCheck { public static void main ( String [] args ) { String str = "madam" ; int left = 0 ; int right = str . length () - 1 ; boolean isPalindrome = true ; while ( left < right ) { if ( str . charAt ( left ) != str . charAt ( right )) { isPalindr...