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
- 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
- Sum of length of subsets which contains given value K and all elements in subsets are less than equal to K.
- Replace array elements with maximum element on the right.
- Find all unique combinations of numbers (from 1 to 9 ) with sum to N
- Number of Intervals in which given value lies
- Unique Integers in array that sum up to zero.
- Activity Selection Problem
- Find the sum of overlapping elements in two sets
- Given two coordinates, Print the line equation
- Check if Graph is Bipartite – Adjacency List using Breadth-First Search(BFS)
- Articulation Points OR Cut Vertices in a Graph
Subscribe ( No Spams!!)
Top Posts & Pages
- Print all subarrays of a given array
- Convert Infix to Postfix Expression
- Dynamic Programming - Coin Change Problem
- Binary Search Tree (BST) Complete Implementation.
- Graph – Detect Cycle in a Directed Graph
- Graph Implementation – Adjacency List - Better| Set 2
- Home - All Articles
- Evaluation of Infix expressions
- Kruskal's Algorithm – Minimum Spanning Tree (MST) - Complete Java Implementation
- Binary Min - Max Heap
Difficulty Level
Bonus Problems
Categories
- Activity Selection (1)
- Adobe (59)
- Airbnb (13)
- Amazon Questions (202)
- Apache (35)
- Apple (12)
- Arrays (149)
- Backtracking (9)
- Beginner (184)
- Binary Tree (76)
- Bit Manipulation (22)
- Bloomberg (24)
- Deque (3)
- Difficulty Level (45)
- Divide and Conquer (12)
- Dynamic Programming (31)
- Epic Systems (33)
- Expedia (13)
- Expert (96)
- Expressions (12)
- Facebook (59)
- Flipkart (26)
- Goldman Sachs (16)
- Google Interview (79)
- Graphs (53)
- Greedy Algorithm (6)
- Groupon (18)
- Hash Table (9)
- HCL (10)
- Heaps (4)
- Hulu (13)
- Informatica (17)
- Intermediate (176)
- Java Concepts (9)
- Linked List (29)
- LinkedIn (18)
- Machine Learning (2)
- Maths (32)
- Microsoft Interview (128)
- MISC (32)
- NetApp (26)
- Numbers (43)
- NVIDIA (16)
- Oracle (26)
- Pair (2)
- Position (1)
- Priority Queue (9)
- Qualcomm (16)
- Queue (7)
- Recursion (133)
- Samsung (4)
- Scheduling/Intervals (4)
- Search Algorithms (10)
- Software Development Engineer (SDE) (252)
- Software Development Engineer in Test (111)
- Software Engineer (253)
- Software Engineer In Test (121)
- Sorting Techniques (18)
- Stack (21)
- Strings (49)
- Test Enginner (73)
- Top Companies (82)
- Trees (62)
- Twitter (23)
- Uncategorized (8)
- Yahoo (51)