Write a java program to print concatenated strings . You can + operator to concatenate strings and print it.
Input: // two inputs
Enter the strings:
I am
Fine
Output:
I am Fine
import java.io.*; import java.util.Scanner; public class temp{ public static void main(String[] args){ Scanner scan = new Scanner(System.in); String a,b; System.out.println("Enter the Strings: "); a = scan.nextLine(); b = scan.nextLine(); System.out.println(a+" "+b); } }
INPUT_1:
Enter the Strings:
I am
Fine
OUTPUT:
I am Fine
INPUT_2:
Enter the Strings:
fcuk
the code
OUTPUT:
fcuk the code
INPUT_3:
Enter the Strings:
I am
almighty Overlord
OUTPUT:
I am almighty Overlord
INPUT_4:
Enter the Strings:
Hello
World
OUTPUT:
Hello World
INPUT_5:
Enter the Strings:
Hello
Metaverse, its the new Hello World Program nowadays!!!
OUTPUT:
Hello Metaverse, its the new Hello World Program nowadays!!!
ILLUSTRATION
![](http://www.fcukthecode.com/wp-content/uploads/2022/03/Screenshot-from-2022-03-27-20-05-12.png)
Morae Q!
- Convert from binary number to decimal number.
- Swap two numbers by using division and multiplication.
- Compute foot and inches into centimetres.
- Concatenate Strings.
- Convert lowercase letters to uppercase letters.
- Compute the sum of all the digits of N.
- Compute the area of the pentagon.
- Get input using scanner.
- Find the distance between two points (x1,y1) and (x2,y2).
- Finding patterns in a file using frep and egrep .
- Detecting a cycle in a directed graph using Depth First Traversal.
- Topological ordering in a Graph.
- Storing graphs using adjacency list.
- Introduction to graph theory.
- Graph Adjacency Matrix pseudo code.
- Adjacency Matrix for storing graphs.
- Dijkstra’s shortest path algorithm .
- Breadth first search (BFS) Algorithm.
- Find the multiple of given number in the list of integers.
- Finding patterns in files using grep .