Find Square Root of an Integer

By | | , ,
Leave a comment

Find Square Root of an Integer. How to calculate square root in java without sqrt function.

Given an integer x (non-negative integer). Write a code to compute the square root of x.

If x is not a perfect square in that case return floor of square root of x (floor(sqrt(x))).

NOTE: Do not use the sqrt function from the standard library.

For example –

Example 1:

           Input: 4

Output: 2

Example 2:

          Input: 11

          Output: 3

The square root of 11 is 3.316624 but we have returned the integer part only after truncating the decimal digits.

floor(3.316624) is 3

Example 3:

         Input: 17

         Output: 4

The square root of 17 is 4.12310. Floor(4.12310) is 4.

→

Count Frequency of a Number in a Sorted Array

By | | , ,
Leave a comment

Count Frequency of a Number in a Sorted Array.

Given a sorted array and a number k. We have to write a code to count how many times a number k appears in a sorted array.

For example –

Input: { 1, 4, 7, 8, 8, 11, 11, 11, 11, 12, 13 }, k = 11

Output: 4

In this input array, The number 11 appears Four time.

→

Path Sum (Binary Tree Root to Leaf Path Sum)

By | | ,
Leave a comment

Binary Tree Root to Leaf Path Sum Equal to a Given Number.

Given a binary tree and a sum, Determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.

If path is found then return true else return false.

Note: What is leaf node? Any node whose left and right children is null is known as leaf node.

For example –

In this Binary tree, there exist a path from root-to-leaf node whose sum is equal to the given sum (which is 16).






Now, suppose if the given value of sum is 12. Then in this case we simply return false. As the root-to-leaf node path does not exist in a Binary tree whose sum is equal to 12.

→