50. Pow(x, n)

[ishaangupta-YB]

Enter your question -

Implement pow(x, n), which calculates x raised to the power n (i.e., xn).

Enter link to the question(if question belongs to any online platform) -

https://leetcode.com/problems/powx-n/

Tags for the question(eg - Array, Basic, Stack, etc.) -

Recursion, Medium

Pull request - #44

[SarthakKeshari]

@ishaangupta-YB,
Kindly add your solution to "leetcode" folder.
Deadline - 02/10/2021

I am assigning the issue since you have created PR already.
Gentle advice for futher Issues -

1. Abide by the guidelines.
2. Medium and hard level questions will be given preference for Hacktoberfest tag.

[navjotdadwal]

Sir please assign this issue to me

Why you should assign this to me?
i am current rated 5 star at codechef with rating of 2153 and rated expert at codeforces with rating of 1776
https://codeforces.com/profile/navjotdadwal
https://www.codechef.com/users/navjot1234
So i can handle and solve this issue

[Anova07]

Enter your question -
Implement pow(x, n), which calculates x raised to the power n (i.e., xn).

Enter link to the question(if question belongs to any online platform) -
https://www.geeksforgeeks.org/write-a-c-program-to-calculate-powxn/
https://leetcode.com/problems/powx-n/

Tags for the question(eg - Array, Basic, Stack, etc.) -
Recursion, Medium

@SarthakKeshari please assign this issue to me

[SarthakKeshari]

@Anova07,
Kindly go through CONTRIBUTING.md

[SarthakKeshari]

@ishaangupta-YB,
Deadline crossed

[Anova07]

@SarthakKeshari is this issue assigned to me, can I work on it and provide a solution to this question ?
I have gone through the CONTRIBUTING.md , do I need to add a new question ?

[SarthakKeshari]

@Anova07,
Now since the deadline is crossed you can solve this.
Kindly add your solution to "leetcode" folder.
Deadline - 05/10/2021

[SarthakKeshari]

@ishaangupta-YB,
Kindly do not close the issue, its assigned under @Anova07 for now