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
- Find Factorial of a given Number
- Print My IP Address – Java Code
- 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
- Check if Given Number is power of 2.
- Reverse a given number – Java Code
- Front and Back Search in an Array
- Fizz Buzz Challenge - Java Implementation
- Given two coordinates, Print the line equation
- Bubble Sort and Optimized Bubble Sort- Java Implementation
- Rotate the given array in cycles
- Sum of all Unique elements in a given array
- Product of all Unique elements in a given array.
- Smallest Number after Removing K digits
- Print all Unique elements in a given array
Recent Posts
- Lexicographically next permutation With One swap
- Find all subsets of size K from a given number N (1 to N)
- Sum of distinct elements among two given sets
- Find all possible combinations with sum K from a given number N(1 to N) with the repetition of numbers is allowed
- Stable Marriage Problem – Gale–Shapley Algorithm – Java
- Insert a node in the given sorted linked list.
- Construct the largest number from the given array.
- Given an array, find three-element sum closest to Zero
- Print sorted unique elements of a given array
- Given an array, print all unique subsets with a given sum.
Subscribe ( No Spams!!)
Top Posts & Pages
- Print all subarrays of a given array
- Count and print all Subarrays with product less than K in O(n)
- Print all sub sequences of a given array
- Binary Min - Max Heap
- Binary Search Tree (BST) Complete Implementation.
- Dynamic Programming - Subset Sum Problem
- Dynamic Programming - Coin Change Problem
- Sum of all sub arrays in O(n) Time
- Home - All Articles
- Inorder Predecessor and Successor in Binary Search Tree
Difficulty Level
Bonus Problems
Categories
- Activity Selection (1)
- Adobe (60)
- Airbnb (14)
- Amazon Questions (206)
- Apache (36)
- Apple (14)
- Arrays (155)
- Backtracking (9)
- Beginner (187)
- Binary Tree (76)
- Bit Manipulation (22)
- Bloomberg (25)
- Deque (3)
- Difficulty Level (45)
- Divide and Conquer (12)
- Dynamic Programming (31)
- Epic Systems (33)
- Expedia (13)
- Expert (97)
- Expressions (12)
- Facebook (63)
- Flipkart (26)
- Goldman Sachs (16)
- Google Interview (82)
- Graphs (53)
- Greedy Algorithm (6)
- Groupon (18)
- Hash Table (9)
- HCL (10)
- Heaps (4)
- Hulu (13)
- Informatica (18)
- Intermediate (182)
- Java Concepts (9)
- Linked List (30)
- LinkedIn (19)
- Machine Learning (2)
- Maths (32)
- Microsoft Interview (134)
- MISC (32)
- NetApp (26)
- Numbers (43)
- NVIDIA (16)
- Oracle (26)
- Pair (2)
- Position (1)
- Priority Queue (9)
- Qualcomm (16)
- Queue (7)
- Recursion (136)
- Samsung (5)
- Scheduling/Intervals (5)
- Search Algorithms (10)
- Software Development Engineer (SDE) (258)
- Software Development Engineer in Test (115)
- Software Engineer (259)
- Software Engineer In Test (125)
- Sorting Techniques (18)
- Stack (21)
- Strings (49)
- Test Enginner (74)
- Top Companies (82)
- Trees (62)
- Twitter (25)
- Uncategorized (8)
- Yahoo (52)
Area is calculated incorrectly
double area = 2*pi*radius;
should be
double area = pi * radius * radius
and the Out put should be 50.24 instead of 25.12
Thanks Lipsa. We have modified the code