Power of number | Pow(x,n) | 3 Approach | Day 16 | [ July LeetCoding Challenge ] [ Leetcode #50 ]
Автор: Algorithms Made Easy
Загружено: 2020-07-16
Просмотров: 1018
Описание:
The day 16 problem in July Leetcoding Challenge. ( Power(x,n) ).
0:00 Finding the Power of x
1:40 Brute Force Approach
2:55 Fast Power Algorithm using Recursion
5:47 Fast Power Algorithm using Iteration
Check out our other popular playlists:
[ Cracking the Coding Interview - Unique String ] : • Cracking the Coding Interview - Unique String
[ June Leetcoding Challenges ] : • June LeetCoding Challenge 2020
[ May Leetcoding challenges ]: • May LeetCoding Challenge 2020
Problem Link: https://leetcode.com/problems/powx-n/
Problem statement:
Implement pow(x, n), which calculates x raised to the power n (xn).
Example 1:
Input: 2.00000, 10
Output: 1024.00000
Example 2:
Input: 2.10000, 3
Output: 9.26100
Example 3:
Input: 2.00000, -2
Output: 0.25000
Explanation: 2-2 = 1/22 = 1/4 = 0.25
Note:
-100.0 = x = 100.0
n is a 32-bit signed integer, within the range [−231, 231 − 1]
If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful.
Code Link: https://github.com/Algorithms-Made-Ea...)
#coding #interview #programminglife #programmingisfun #programmer #tech #software #codinglife #leetcode
Повторяем попытку...
![Power of number | Pow(x,n) | 3 Approach | Day 16 | [ July LeetCoding Challenge ] [ Leetcode #50 ]](https://imager.clipsaver.ru/JMHL9geRAKI/max.jpg)
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке:
![Reverse Words in a String | Day 15 Built-in Dequeue| [ July LeetCoding Challenge ] [ Leetcode #151 ]](https://imager.clipsaver.ru/2GFy13zpRw8/max.jpg)
