Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://www.geeksforgeeks.org/java/java-exercises/ below:

Java Exercises - Basic to Advanced Java Practice Programs with Solutions

Looking for Java exercises to test your Java skills, then explore our topic-wise Java practice exercises? Here you will get 25 plus practice problems that help to upscale your Java skills.

As we know Java is one of the most popular languages because of its robust and secure nature. But, programmers often find it difficult to find a platform for Java Practice Online. In this article, we have provided Java Practice Programs. That covers various Java Core Topics that can help users with Java Practice.

So, with ado further take a look at our free Java Exercises to practice and develop your Java programming skills. Our Java programming exercises Practice Questions from all the major topics like loops, object-oriented programming, exception handling, and many more.

This Java exercise is designed to deepen your understanding and refine your Java coding skills, these programs offer hands-on experience in solving real-world problems, reinforcing key concepts, and mastering Java programming fundamentals. Whether you're a beginner who looking to build a solid foundation or a professional developer aiming to sharpen your expertise, our Java practice programs provide an invaluable opportunity to sharpen your craft and excel in Java programming language .

Java enthusiasts can also benefit from practicing various java exercises on the GeeksforGeeks Online Practice Platform, where challenges cater to both beginners and advanced programmers.

The solution to the Problem is mentioned below:

// Java Program to Print
// Hello World
import java.io.*;

// Driver Class
class GFG {
    // main function
    public static void main(String[] args)
    {

        // Printing Hello World
        System.out.println("Hello World!");
    }
}

Input: 2 3
Output: 5

Input: a=2  b=5
Output: a=5  b=2

Input: 9 
Output: 1001

Input: 5
Output: 120

Input:   1+2i
             4+5i
Output: 5+7i

Input :  P = 10000  R = 5  T = 5
Output : 2500

Input : N = 5
Output:
          1
        1   1
      1   2   1
    1   3   3   1
  1   4   6   4   1
1   5   10   10   5   1

Input: n = 4
Output: 33
Explaination: Sum of numbers at even indexes = 0 + 1 + 3 + 8 + 21 = 33.

    *
   ***
  *****
 *******

* * * * * * 
*         * 
*         * 
*         *
*         *
* * * * * *

          1 
        2 1 2 
      3 2 1 2 3 
    4 3 2 1 2 3 4 
  5 4 3 2 1 2 3 4 5 
6 5 4 3 2 1 2 3 4 5 6 

     *
    ***
   *****
  *******
 *********
***********
 *********
  *******
   *****
    ***
     *

Input: [ 2, 4, 6, 7, 9]
Output: 28

Input: [ 7, 2, 5, 1, 4]
Output: 7

Input: 
[ [ 1, 2, 3 ]
  [ 4, 5, 6 ]
  [ 7, 8, 9 ] ]
Output: 
[ [ 1, 4, 7]
  [ 2, 5, 8]
  [ 3, 6, 9] ]

Input: arr[] = {1, 2, 3, 4, 5, 6, 7},  d = 2
Output:  3 4 5 6 7 1 2
Explaination: d=2 so 2 elements are rotated to the end of the array. So, 1 2 is rotated back

So, Final result: 3, 4, 5, 6, 7, 1, 2

Input: [ 1, 2, 2, 3, 3, 3, 4, 5 ]
Output: [ 1, 2, 3, 4, 5 ]

Input: array = [ 1, 2, 1, 3, 5, 1 ] , key = 1
Output: [2, 3, 5]
Explaination: all the occurrences of element 1 is removed from the array So, array becomes from

[ 1, 2, 1, 3, 5, 1 ]  to
Final result: [2, 3, 5]

Input: "racecar"
Output: Yes
Explaination: As racerar after reversing becomes racecar. As Reverse of String is same as String so it is Palindrome

Input: str1 = "Silent"
            str2 ="Listen"
Output: Strings are Anagram 
Explaination: As all the elements in str1 are exact same as to create str2 .

i.e., we can create str2 using elements of str1 without removing any element or removing any extra element.

Input: str= "Geeks"
Output: "skeeG"

Input : 00000123569
Output : 123569

Time Complexity: O(N)
Space Complexity: O(N)

Time Complexity: O(logN)
Space Complexity: O(N)

Time Complexity: O(N ² )
Space Complexity: O(1)

Time Complexity: O(N ² )
Space Complexity: O(1)

Time Complexity: O(N ² )
Space Complexity: O(1)

Time Complexity: O(N logN)
Space Complexity: O(N)

Time Complexity: O(N logN)
Space Complexity: O(1)

After completing these Java exercises you are a step closer to becoming an advanced Java programmer. We hope these exercises have helped you understand Java better and you can solve beginner to advanced-level questions on Java programming.

Solving these Java programming exercise questions will not only help you master theory concepts but also grasp their practical applications, which is very useful in job interviews.

• Java Array Exercise
• Java String Exercise
• Java Collection Exercise

Click Here - To Practice Java Online please check our Practice Portal.

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4