{"id":1305,"date":"2021-11-04T19:08:36","date_gmt":"2021-11-04T19:08:36","guid":{"rendered":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/2021\/11\/04\/sdet-interview-questions-part-5\/"},"modified":"2021-11-04T19:08:36","modified_gmt":"2021-11-04T19:08:36","slug":"sdet-interview-questions-part-5","status":"publish","type":"post","link":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/2021\/11\/04\/sdet-interview-questions-part-5\/","title":{"rendered":"Top SDET Interview Questions in Java – Part 5"},"content":{"rendered":"

<\/p>\n

\n

\n

\n

\n

<\/div>\n

\n

\n

<\/div>\n<\/div>\n

<\/div>\n

\n

<\/div>\n

\n

\n

Table of Contents<\/div>\n<\/p><\/div>\n<\/div>\n<\/div>\n

\n

\n

<\/div>\n

\n

\n

\n

1. Write a program to sort ArrayList using Comparable and Comparator<\/a><\/div>\n

2. I have arrayList like [Test1, Test2, Test3, Test4, Test5] Write a Program to replace the “Test2” with string “ReplacedTest”<\/a><\/div>\n

3. Write a Java program to insert the specified element at the end of a linked list<\/a><\/div>\n

4. Write a program to perform Pairwise swap elements of a given linked list<\/a><\/div>\n

5. Check if two arrays have same number of items and values<\/a><\/div>\n

6. Write a Java Program to find the largest and smallest word in a string<\/a><\/div>\n

7. Java Program to Check if a Given Number is Perfect Square<\/a><\/div>\n

8. Write a Program to cover all major concepts of OOPs<\/a><\/div>\n

9. Write a program to find the length of the string without using string.length();<\/a><\/div>\n

Course Alert<\/a><\/div>\n<\/div>\n

<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n

1. Write a program to sort ArrayList using Comparable and Comparator<\/a><\/h3>\n
Solution: Sort ArrayList using Comparable<\/strong><\/p>\n
\n

\n<\/ins>\n<\/div>\n<\/div>\n
\n
<\/div>\n
\n
\n
import java.util.ArrayList;<\/span><\/p>\n
import java.util.Collections;<\/span><\/p>\n
\/\/Using Comparable<\/span><\/p>\n
class Employee implements Comparable<Employee> {<\/span><\/p>\n
\u00a0\u00a0\u00a0 \u00a0private String name;<\/span><\/p>\n
\u00a0\u00a0\u00a0 \u00a0private int empId;<\/span><\/p>\n
\u00a0\u00a0\u00a0 \u00a0private int age;<\/span><\/p>\n
\u00a0\u00a0\u00a0<\/span><\/p>\n
\u00a0\u00a0\u00a0 \u00a0public Employee(String name, int empId, int age) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0this.name= name;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0this.empId=empId;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0this.age=age;<\/span><\/p>\n
\u00a0\u00a0\u00a0 \u00a0}<\/span><\/p>\n
\u00a0\u00a0\u00a0 \u00a0<\/span><\/p>\n
\u00a0\u00a0\u00a0 @Override<\/span><\/p>\n
\u00a0\u00a0\u00a0 public int compareTo(Employee employee) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0return this.age – employee.age;<\/span><\/p>\n
\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0<\/span><\/p>\n
\u00a0\u00a0\u00a0 @Override<\/span><\/p>\n
\u00a0\u00a0\u00a0 public String toString() {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0return “[ Name= ” + name + “, Employee Id = ” + empId + “, Employee age = ” + age + “]”;<\/span><\/p>\n
\u00a0\u00a0\u00a0 }<\/span><\/p>\n
}<\/span><\/p>\n
class Main {<\/span><\/p>\n
\u00a0\u00a0\u00a0 public static void main(String[] args) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 ArrayList<Employee> list = new ArrayList<Employee>();<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 list.add(new Employee(“Rahul”,6589586,35));<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 list.add(new Employee(“John”,854756,30));<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 list.add(new Employee(“Robin”,784125,32));<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0Collections.sort(list);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0for(Employee e: list){<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println(e);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0 }<\/span><\/p>\n
}<\/span><\/p>\n
Output:<\/span><\/p>\n
[ Name= John, Employee Id = 854756, Employee age = 30]<\/span><\/p>\n
[ Name= Robin, Employee Id = 784125, Employee age = 32]<\/span><\/p>\n
[ Name= Rahul, Employee Id = 6589586, Employee age = 35]<\/span><\/p>\n<\/div>\n<\/div>\n<\/div>\n
\n
Solution: Sort ArrayList using Comparator<\/strong><\/p>\n<\/div>\n
\n
<\/div>\n
\n
\n
import java.util.ArrayList;<\/span><\/p>\n
import java.util.Collections;<\/span><\/p>\n
import java.util.Comparator;<\/span><\/p>\n
\/\/Using Comparator<\/span><\/p>\n
class Employee {<\/span><\/p>\n
\u00a0\u00a0\u00a0 private String name;<\/span><\/p>\n
\u00a0\u00a0\u00a0 private int empId;<\/span><\/p>\n
\u00a0\u00a0\u00a0 private int age;<\/span><\/p>\n
\u00a0\u00a0\u00a0 public Employee(String name, int empId, int age) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 this.name = name;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 this.empId = empId;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 this.age = age;<\/span><\/p>\n
\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0 public String getName() {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 return this.name;<\/span><\/p>\n
\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0 public int getEmpId() {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 return this.empId;<\/span><\/p>\n
\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0 public int getAge() {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 return this.age;<\/span><\/p>\n
\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0 public static Comparator<Employee> EmployeeNameComparator = new Comparator<Employee>() {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 public int compare(Employee e1, Employee e2) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 String empName1 = e1.getName().toLowerCase();<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 String empName2 = e2.getName().toLowerCase();<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 return empName1.compareTo(empName2);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0 };<\/span><\/p>\n
\u00a0\u00a0\u00a0 public static Comparator<Employee> EmployeeAgeComparator = new Comparator<Employee>() {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 public int compare(Employee e1, Employee e2) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 int empAge1 = e1.getAge();<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 int empAge2 = e2.getAge();<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 return empAge1 – empAge2;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0 };<\/span><\/p>\n
\u00a0\u00a0\u00a0 @Override<\/span><\/p>\n
\u00a0\u00a0\u00a0 public String toString() {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 return “[ Name= ” + name + “, Employee Id = ” + empId + “, Employee age = ” + age + “]”;<\/span><\/p>\n
\u00a0\u00a0\u00a0 }<\/span><\/p>\n
}<\/span><\/p>\n
class Main {<\/span><\/p>\n
\u00a0\u00a0\u00a0 public static void main(String[] args) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 ArrayList<Employee> list = new ArrayList<Employee>();<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 list.add(new Employee(“Rahul”, 6589586, 35));<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 list.add(new Employee(“John”, 854756, 32));<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 list.add(new Employee(“Lukas”, 784125, 30));<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println(“Sort Employee List by Name”);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Collections.sort(list, Employee.EmployeeNameComparator);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 for (Employee e : list) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println(e);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println(“nSort Employee List by Age”);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Collections.sort(list, Employee.EmployeeAgeComparator);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 for (Employee e : list) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println(e);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0 }<\/span><\/p>\n
}<\/span><\/p>\n
Output:<\/span><\/p>\n
Sort Employee List by Name<\/span><\/p>\n
[ Name= John, Employee Id = 854756, Employee age = 32]<\/span><\/p>\n
[ Name= Lukas, Employee Id = 784125, Employee age = 30]<\/span><\/p>\n
[ Name= Rahul, Employee Id = 6589586, Employee age = 35]<\/span><\/p>\n
Sort Employee List by Age<\/span><\/p>\n
[ Name= Lukas, Employee Id = 784125, Employee age = 30]<\/span><\/p>\n
[ Name= John, Employee Id = 854756, Employee age = 32]<\/span><\/p>\n
[ Name= Rahul, Employee Id = 6589586, Employee age = 35]<\/span><\/p>\n<\/div>\n<\/div>\n<\/div>\n
\n
2. I have arrayList like [Test1, Test2, Test3, Test4, Test5]<\/em> Write a Program to replace the “Test2” with string “ReplacedTest”<\/a><\/h3>\n
Solution:<\/strong><\/p>\n<\/div>\n
\n
<\/div>\n
\n
\n
import java.util.ArrayList;<\/span><\/p>\n
class Main {<\/span><\/p>\n
\u00a0\u00a0\u00a0 public static void main(String[] args) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 ArrayList<String>\u00a0 list = new ArrayList<String>();<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 list.add(“Test1”);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 list.add(“Test1”);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 list.add(“Test2”);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 list.add(“Test3”);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 list.add(“Test4”);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println(“ArrayList before Replace”);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println(list);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 int index = list.indexOf(“Test2”);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 list.set(index,”ReplacedTest”);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println(“nArrayList after Replace”);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println(list);<\/span><\/p>\n
\u00a0\u00a0\u00a0 }<\/span><\/p>\n
}<\/span><\/p>\n
Output:<\/span><\/p>\n
ArrayList before Replace<\/span><\/p>\n
[Test1, Test1, Test2, Test3, Test4]<\/span><\/p>\n
ArrayList after Replace<\/span><\/p>\n
[Test1, Test1, ReplacedTest, Test3, Test4]<\/span><\/p>\n<\/div>\n<\/div>\n<\/div>\n
\n
3. Write a Java program to insert the specified element at the end of a linked list<\/a><\/h3>\n
Solution:<\/strong><\/p>\n<\/div>\n
\n
<\/div>\n
\n
\n
import java.util.LinkedList;<\/span><\/p>\n
class Main {<\/span><\/p>\n
\u00a0\u00a0\u00a0 public static void main(String[] args) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 LinkedList<String>\u00a0 list = new LinkedList<String>();<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 list.add(“Test1”);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 list.add(“Test1”);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 list.add(“Test2”);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 list.add(“Test3”);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 list.add(“Test4”);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println(“LinkedList before Inserting Element at the End\/Last”);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println(list);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 list.offerLast(“LastInsertedElement”);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println(“nLinkedList after Inserting Element at the End\/Last”);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println(list);<\/span><\/p>\n
\u00a0\u00a0\u00a0 }<\/span><\/p>\n
}<\/span><\/p>\n
Output:<\/span><\/p>\n
LinkedList before Inserting Element at the End\/Last<\/span><\/p>\n
[Test1, Test1, Test2, Test3, Test4]<\/span><\/p>\n
LinkedList after Inserting Element at the End\/Last<\/span><\/p>\n
[Test1, Test1, Test2, Test3, Test4, LastInsertedElement]<\/span><\/p>\n<\/div>\n<\/div>\n<\/div>\n
\n
4. Write a program to perform Pairwise swap elements of a given linked list<\/a><\/h3>\n
In Pairwise swapping each pair will be swapped<\/p>\n
Example:<\/strong><\/p>\n
Input\u00a0 1 > 2 > 3 > 4 > 5<\/p>\n
Output 2 > 1 > 4 > 3 > 5<\/p>\n
Solution:<\/strong><\/p>\n<\/div>\n
\n
<\/div>\n
\n
\n
\/\/Pairwise Swap<\/span><\/p>\n
public class LinkedList {<\/span><\/p>\n
\u00a0\u00a0\u00a0 Node head;<\/span><\/p>\n
\u00a0\u00a0\u00a0 class Node {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 int data;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Node next;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Node(int d)<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 data = d;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 next = null;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0 void pairWiseSwap()<\/span><\/p>\n
\u00a0\u00a0\u00a0 {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Node temp = head;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 while (temp != null && temp.next != null) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 int k = temp.data;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 temp.data = temp.next.data;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 temp.next.data = k;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 temp = temp.next.next;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0 public void push(int new_data)<\/span><\/p>\n
\u00a0\u00a0\u00a0 {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Node new_node = new Node(new_data);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 new_node.next = head;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 head = new_node;<\/span><\/p>\n
\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0 void print()<\/span><\/p>\n
\u00a0\u00a0\u00a0 {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Node temp = head;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 while (temp != null) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.print(temp.data + ” “);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 temp = temp.next;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println();<\/span><\/p>\n
\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0 public static void main(String args[])<\/span><\/p>\n
\u00a0\u00a0\u00a0 {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 LinkedList list = new LinkedList();<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 list.push(5);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 list.push(4);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 list.push(3);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 list.push(2);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 list.push(1);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println(“Linked List before PairWise Swap “);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 list.print();<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 list.pairWiseSwap();<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println(“Linked List after PairWise Swap”);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 list.print();<\/span><\/p>\n
\u00a0\u00a0\u00a0 }<\/span><\/p>\n
}<\/span><\/p>\n
Output:<\/span><\/p>\n
Linked List before PairWise Swap<\/span><\/p>\n
1 2 3 4 5<\/span><\/p>\n
Linked List after PairWise Swap<\/span><\/p>\n
2 1 4 3 5<\/span><\/p>\n<\/div>\n<\/div>\n<\/div>\n
\n
5. Check if two arrays have same number of items and values<\/a><\/h3>\n
Consider I have two arrays<\/a><\/p>\n
a = [1,2,3,4]<\/p>\n
b = [2,1,4,3]<\/p>\n
Considering the above array, We have the same Item in both the arrays, but the index is different<\/p>\n
Write a program to check a is having the same number of items and same values compared with b<\/p>\n
You should not use Arrays.Equals() method<\/p>\n
<\/strong><\/p>\n
Solution:<\/strong><\/p>\n
There are two requirements here<\/p>\n
1. Number of Elements in a[] should be same as b[] \/\/a.length == b.length<\/p>\n
2. Both a[] and b[] should have the same element, order sequence can be different<\/p>\n
3. You should not use Arrays.Equals method<\/p>\n<\/div>\n
\n
<\/div>\n
\n
\n
import java.util.Arrays;<\/span><\/p>\n
public class Main {<\/span><\/p>\n
\u00a0\u00a0\u00a0 public static void main(String args[]) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 int[] array1 = { 1, 2, 3, 4 };<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 int[] array2 = { 2, 1, 4, 3 };<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 boolean b = false;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if (array1.length != array2.length) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0b = false;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 } else {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Arrays.sort(array1);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Arrays.sort(array2);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 for(int i=0;i<array1.length;i++) {<\/span><\/p>\n
\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if(array1[i]!=array2[i]) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 b=false;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 break;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 b=true;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if (b)<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println(“Arrays are having same values”);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 else<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println(“Arrays are not having same values”);<\/span><\/p>\n
\u00a0\u00a0\u00a0 }<\/span><\/p>\n
}<\/span><\/p>\n
Output:<\/span><\/p>\n
Arrays are having same values<\/span><\/p>\n<\/div>\n<\/div>\n<\/div>\n
\n
6. Write a Java Program to find the largest and smallest word in a string<\/a><\/h3>\n
Solution:<\/strong><\/p>\n<\/div>\n
\n
<\/div>\n
\n
\n
public class Main {<\/span><\/p>\n
\u00a0\u00a0\u00a0 \u00a0public static void main(String[] args){<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0String string = “Rahul Shetty Academy is the best”;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0String[] words = string.trim().replaceAll(“\\s+”, ” “).split(” “);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0 String shortest = words[0];<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0 String longest =\u00a0 words[0];<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0 for(String word : words){<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0 if(word.length() < shortest.length()){<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 shortest = word;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0 if(word.length() > longest.length()){<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 longest = word;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0 System.out.println(“The Shortest Word = “+shortest);\u00a0\u00a0<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0 System.out.println(“The Longest Word = “+ longest);<\/span><\/p>\n
\u00a0\u00a0\u00a0 \u00a0 }\u00a0<\/span><\/p>\n
}<\/span><\/p>\n
Output:<\/span><\/p>\n
The Shortest Word = is<\/span><\/p>\n
The Longest Word = Academy<\/span><\/p>\n<\/div>\n<\/div>\n<\/div>\n
\n
7. Java Program to Check if a Given Number is Perfect Square<\/a><\/h3>\n
A perfect square is a positive integer, it is the product of the number itself<\/p>\n
Example:<\/strong><\/p>\n
**49 = 7*7, So the 49 is Perfect Square<\/p>\n
Solution:<\/strong><\/p>\n<\/div>\n**
\n
<\/div>\n
\n
\n
class Main {<\/span><\/p>\n
\u00a0\u00a0\u00a0 static boolean isPerfectSquare(int x)<\/span><\/p>\n
\u00a0\u00a0\u00a0 {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if (x >= 0) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 int sqrt = (int)Math.sqrt(x);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 return ((sqrtsqrt) == x);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 return false;<\/span><\/p>\n
\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0 public static void main(String[] args)<\/span><\/p>\n
\u00a0\u00a0\u00a0 {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 int x = 8100;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if (isPerfectSquare(x))<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.print(“Given Number is a Perfect Square”);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 else<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.print(“Given Number is Not a Perfect Square”);<\/span><\/p>\n
\u00a0\u00a0\u00a0 }<\/span><\/p>\n
}<\/span><\/p>\n
Output:<\/span><\/p>\n
Given Number is a Perfect Square<\/span><\/p>\n<\/div>\n<\/div>\n<\/div>\n
\n
8. Write a Program to cover all major concepts of OOPs<\/a><\/h3>\n
Note: There are multiple ways to write this program, we have shown one way.<\/em><\/p>\n*
Solution:<\/strong><\/p>\n<\/div>\n
\n
<\/div>\n
\n
\n
\/\/Abstraction<\/span><\/p>\n
interface Car {<\/span><\/p>\n
\u00a0\u00a0\u00a0 void printName();<\/span><\/p>\n
}<\/span><\/p>\n
\/\/Inheritance<\/span><\/p>\n
class Ford {<\/span><\/p>\n
\u00a0\u00a0\u00a0 private String name; \/\/Encapsulation<\/span><\/p>\n
\u00a0\u00a0\u00a0 public String getName() {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 return name;<\/span><\/p>\n
\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0 public void setName(String newName) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 name = newName;<\/span><\/p>\n
\u00a0\u00a0\u00a0 }<\/span><\/p>\n
}<\/span><\/p>\n
class OneMore extends Ford implements Car{<\/span><\/p>\n
\u00a0\u00a0\u00a0 @Override \/\/Overriding<\/span><\/p>\n
\u00a0\u00a0\u00a0 public void printName() {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println(“Override Method Print ” + super.getName());<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/span><\/p>\n
\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0 \/\/Overloading<\/span><\/p>\n
\u00a0\u00a0\u00a0 public void printName(String string) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println(“Overloaded Method Print ” + string);<\/span><\/p>\n
\u00a0\u00a0\u00a0 }<\/span><\/p>\n
}<\/span><\/p>\n
class Main {<\/span><\/p>\n
\u00a0\u00a0\u00a0 public static void main(String[] args) {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 OneMore object = new OneMore();<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 object.setName(“Eco Sport”);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 object.printName();<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 object.printName(“Aspire”);<\/span><\/p>\n
\u00a0\u00a0\u00a0 }<\/span><\/p>\n
}<\/span><\/p>\n
Output:<\/span><\/p>\n
Overloading Print Eco Sport<\/span><\/p>\n
Overloading Print Aspire<\/span><\/p>\n<\/div>\n<\/div>\n<\/div>\n
\n
9. Write a program to find the length of the string without using string.length();<\/a><\/h3>\n
Note: There are multiple ways to write this program, we have shown one way.<\/em><\/p>\n
<\/em><\/p>\n
Solution:<\/strong><\/p>\n<\/div>\n
\n
<\/div>\n
\n
\n
public class Main<\/span><\/p>\n
{<\/span><\/p>\n
\u00a0\u00a0\u00a0 static int i,c,res;<\/span><\/p>\n
\u00a0\u00a0\u00a0 static void length(String s)<\/span><\/p>\n
\u00a0\u00a0 \u00a0{<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 try<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 for(i=0,c=0;0<=i;i++,c++)<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 s.charAt(i);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 catch(StringIndexOutOfBoundsException e)<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0 System.out.println(“”);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.print(“The length of the string “”+s+”” is ” +c);<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0 }<\/span><\/p>\n
\u00a0\u00a0\u00a0<\/span><\/p>\n
\u00a0\u00a0\u00a0 public static void main (String args[])<\/span><\/p>\n
\u00a0\u00a0\u00a0 {<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 String string = “Rahul Shetty Academy”;<\/span><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 length(string);<\/span><\/p>\n
\u00a0\u00a0\u00a0 }<\/span><\/p>\n
}<\/span><\/p>\n
Output:<\/span><\/p>\n
The length of the string “Rahul Shetty Academy” is 20<\/span><\/p>\n<\/div>\n<\/div>\n<\/div>\n
\n
Course Alert<\/span><\/em><\/h5>\n
If you are interested in landing a SDET or Sr. QA Automation Engineer role, check out our popular SDET course to learn the fundamental skills required an SDET needs to perform at work. Also, I have another popular course which covers Top 150+ Interview questions most commonly asked in SDET \/ Automation interviews.<\/strong><\/p>\n<\/div>\n
\n
\n
\n
\n
SDET\/Test Architect Essentials -Road to Full stack QA<\/a><\/span><\/li>\n
\n
\n
SDET\/QA Automation Interview Kit + Java logic Programs<\/a><\/span><\/li>\n<\/ul>\n<\/div>\n
\n
\n
<\/div>\n
\n
\n
A Quick Note<\/strong><\/em><\/h4>\n<\/div>\n\n
Please remember all these courses comes with 100% Lifetime acces<\/strong>s<\/strong> and free updates for Lifetime!!<\/strong><\/p>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n
\n
With this we end the 5-part series of Sr.QA and SDET Interview Questions in Java. Please click on the link Top 30 API Testing Interview Questions and Answers \u2013 Part 1<\/a><\/em><\/strong> to where we will cover Top API Interview questions.<\/p>\n<\/div>\n<\/div>\n<\/div>\n
<\/div>\n<\/section>\n
<\/body><\/html><\/p>\n","protected":false},"excerpt":{"rendered":"
Table of Contents 1. Write a program to sort ArrayList using Comparable and Comparator 2. I have arrayList like [Test1, Test2, Test3, Test4, Test5] Write a Program to replace the “Test2” with string “ReplacedTest” 3. Write a Java program to insert the specified element at the end of a linked list 4. Write a program […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[4,5],"tags":[],"class_list":["post-1305","post","type-post","status-publish","format-standard","hentry","category-interview-questions","category-java","post-wrapper","thrv_wrapper"],"_links":{"self":[{"href":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/wp-json\/wp\/v2\/posts\/1305","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/wp-json\/wp\/v2\/comments?post=1305"}],"version-history":[{"count":0,"href":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/wp-json\/wp\/v2\/posts\/1305\/revisions"}],"wp:attachment":[{"href":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/wp-json\/wp\/v2\/media?parent=1305"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/wp-json\/wp\/v2\/categories?post=1305"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/wp-json\/wp\/v2\/tags?post=1305"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}