Skip to main content

Strings In Java

Question: What is String in JAVA ?
Ans: Java me, "String" ek data type hota hai jo text ko represent karta hai. String ek sequence of characters hoti hai, jaise ki alphabets, numbers, symbols, aur special characters. Java me, String class predefined hoti hai, aur aap iska istemal karke text data ko store, manipulate, aur access kar sakte hain.

Strings are non Primitive Data Type.

Question: What is .length(); ?
Ans: this is to check length of a String .

Question: Different between single quote and double quote in String .
Ans: Single quote ' ' ['D'] is basically used to store character but double quote is used to store " " ["Divyanshu"] a string basically sequence of character . 


Question: How to add, concat a string ?
Ans : There is two way to concat or add a string
            1) first is to use 
Addition (+) arithemetic operator
            2) .concat




package learningJava;

import java.util.*;

public class regPract {

/* Find the maximum and minimum element in an array

*/

public static void main(String[] args) {

String str1 = ("Digital");

String str2 = ("India");

*\this is method of java concat is a                         method of java two concatenate string*/

String str = str1.concat(str2);

System.out.println(str);

//this is general option to add a string

System.out.println(str1+str2);

}

}







Output:
DigitalIndia

DigitalIndia

Question: What is .equals in String ?
Ans: str1.equals(str2); This is for check 2 strings are qual or not and it will give you boolean result like true and false

Question: What is .compareTo method in java ?
Ans: 
String str1 = "apple";

String str2 = "banana"; int result = str1.compareTo(str2); if (result < 0) { System.out.println("str1 is smaller than str2"); } else if (result > 0) { System.out.println("str1 is larger than str2"); } else { System.out.println("str1 is equal to str2"); 

} 


This will compare two strings 


Question: What is equalsIgnoreCase is java ?

Ans: The equalsIgnoreCase method is a Java String class method used to compare two strings for equality while ignoring the differences in their letter case (uppercase or lowercase). It checks if two strings have the same characters, regardless of whether the characters are in uppercase or lowercase.

String is a class


Question: How many types of class available on java to create String class ?
Ans: There're 3 classes available here to create a String class

1) String
2) String buffer
3) String builder

Question: How to use concat is JAVA ?
Ans: 


package learningJava;

import java.util.*;

public class regPract {

/* Find the maximum and minimum element in an array

*/

public static void main(String[] args) {

String str = "Divyanshu";

str = str.concat("khare");

System.out.println(str);

}

}

Question: contains what is this ?





Comments

Popular posts from this blog

Block vs Inline Elements In HTML

  Block: Block element always start in New Line  Block element always start in new line occupy complete width available  Example: h2, p, div Inline Element: They do not start in new line occuply width as much required  Example: img, anchor a,span There are no different between div and span, only difference is div is block element and span is Inline, it will help you to group your content or elements

Time Complexity

What is time complexity ? Ans: Time complexity not a run time of a code, its totally depends on system configuration, processor, server , input size will increase time complexity. Time complexity ko likhne ke tarike jo hote hai use notation kehte hai. Notation is basically symbol NOTATION OF COMPLEXITY Best Case: kam se kam time me chla gya code best case hota hai Ω (Omega) Ω(1) se likhte hai Average Case: Ek average time jisme code chle  Θ(n+1)/2 Worst Case: Worst case ka mtlb kuch bhi ho jaye is time ko ye exceed nhi kregea O(n) Nested Loop me Time Complexity multiply hoti hai aur n^2 banti hai Wahi Do different loops me N+M hoti hai jisme jiski sabse bdi value hai wo big of O me jati hai O(1) - Constant Time: Operations that take a constant amount of time, regardless of the size of the input data. O(log n) - Logarithmic Time: Algorithms that have a logarithmic time complexity, often seen in binary search or certain tree-based algorithms. This is best time Complexity this i...

Find Unique Number in Array Java , XOR

 Question:  WAP to find unique number in Array Java package aRray ; import java . util .*; public class practicalArray { public static void main ( String [] args ) { Scanner scan = new Scanner ( System . in ) ; // Step 1: Input size of the array from the user int size = scan . nextInt () ; // Step 2: Create an integer array of the specified size int [] arr = new int [ size ] ; // Step 3: Initialize 'res' with the first element of the array int res = arr [ 0 ] ; // Step 4: Loop to read array elements and find the unique number for ( int i = 1 ; i < size ; i ++ ) { // Read an integer from the user and store it in the array arr [ i ] = scan . nextInt () ; // Step 5: Use XOR (^) operation to find the unique number res = res ^ arr [ i ] ; } // Step 6: Print the unique number System . out . print...