Find the Area of a Circle – Java Program
Area of a circle = πR2
Where π = 3.14 and R = radius of circle
Example:
Radius = 4.0 Area = π*radius*radius = 3.14*4*4 = 50.24
Code:
Output:
Area of circle with radius=4.0 is: 50.24
More Problems
- Java Program to determine if Given Year is Leap Year
- Calculate Logn base r – Java Implementation
- Print My IP Address – Java Code
- Find Factorial of a given Number
- Calculate Log2n without using built-in function
- Check if given number is Prime - O(√N) Solution – Java Program
- Find the roots of Quadratic Equation – Java Program
- Reverse the given String using Stack
- Reverse a String using Recursion
- Reverse a given number – Java Code
- Check if Given Number is power of 2.
- Fizz Buzz Challenge - Java Implementation
- Front and Back Search in an Array
- Bubble Sort and Optimized Bubble Sort- Java Implementation
- Sum of all Unique elements in a given array
- Rotate the given array in cycles
- Product of all Unique elements in a given array.
- Smallest Number after Removing K digits
- Print Numbers from 1 to N without using loop
- Print all Unique elements in a given array
Recent Posts
- Given Graph – Remove a vertex and all edges connect to the vertex
- Print Stack in reverse order.
- Sort a given stack – Using Recursion
- Given an array, Print sum of all subsets
- Determine the given routing number belong to which bank
- Check if interval is covered in given coordinates
- Lexicographically previous permutation With One swap
- Find all unique combinations of exact K numbers (from 1 to 9 ) with sum to N
- Number’s Complement – 2 Approaches
- Print all subsets of an array with a sum equal to zero
Subscribe ( No Spams!!)
Top Posts & Pages
- Binary Search Tree (BST) Complete Implementation.
- Binary Min - Max Heap
- Backtracking - N Queens Problem
- AVL Tree - Insertion
- Graph Representation - Adjacency Matrix and Adjacency List
- Kruskal's Algorithm – Minimum Spanning Tree (MST) - Complete Java Implementation
- Inorder Predecessor and Successor in Binary Search Tree
- Dynamic Programming - Coin Change Problem
- Weighted Graph Implementation – JAVA
- Graph Implementation – Adjacency List - Better| Set 2
Difficulty Level
Bonus Problems
Categories
- Adobe (57)
- Airbnb (11)
- Amazon Questions (191)
- Apache (33)
- Apple (8)
- Arrays (139)
- Backtracking (9)
- Beginner (173)
- Binary Tree (73)
- Bit Manipulation (21)
- Bloomberg (22)
- Deque (3)
- Difficulty Level (45)
- Divide and Conquer (12)
- Dynamic Programming (30)
- Epic Systems (31)
- Expedia (11)
- Expert (91)
- Expressions (12)
- Facebook (54)
- Flipkart (25)
- Goldman Sachs (15)
- Google Interview (74)
- Graphs (45)
- Greedy Algorithm (6)
- Groupon (17)
- Hash Table (9)
- HCL (10)
- Heaps (4)
- Hulu (11)
- Informatica (14)
- Intermediate (164)
- Java Concepts (9)
- Linked List (29)
- LinkedIn (16)
- Machine Learning (2)
- Maths (31)
- Microsoft Interview (123)
- MISC (32)
- NetApp (25)
- Numbers (39)
- NVIDIA (15)
- Oracle (24)
- Pair (2)
- Position (1)
- Priority Queue (9)
- Qualcomm (14)
- Queue (5)
- Recursion (128)
- Samsung (3)
- Scheduling/Intervals (2)
- Search Algorithms (10)
- Software Development Engineer (SDE) (235)
- Software Development Engineer in Test (105)
- Software Engineer (236)
- Software Engineer In Test (115)
- Sorting Techniques (17)
- Stack (20)
- Strings (49)
- Test Enginner (71)
- Top Companies (82)
- Trees (58)
- Twitter (21)
- Uncategorized (7)
- Yahoo (49)