Day 16 of July LeetCode Challenge

1 min readJul 16, 2020

--

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

If there are more possible approaches, please comment.

Julyleetcodechallenge

Aanchal Patial

Written by Aanchal Patial

We never really grow up, we only learn how to act in public

Recommended from Medium

My Interview Experience at Meta [E5 Offer]

Rohit Verma

My Interview Experience at Meta [E5 Offer]

From Getting a Referral to Receiving the Offer

10 min readNov 20

--

4

Time Complexity and Space Complexity of DFS and BFS Algorithms

Tech Sauce

Time Complexity and Space Complexity of DFS and BFS Algorithms

In this post, we will analyze the time and space complexity for Depth First Search and Breadth First Search algorithms …

3 min readJun 6

--

Lists

Practical Guides to Machine Learning

10 stories729 saves

General Coding Knowledge

20 stories624 saves

Staff Picks

518 stories480 saves

Don’t Just LeetCode; Follow the Coding Patterns Instead

Arslan Ahmad
in
Level Up Coding

Don’t Just LeetCode; Follow the Coding Patterns Instead

What if you don’t like to practice 100s of coding questions before the interview?

5 min readSep 15, 2022

--

37

Mastering the Two-Pointer Technique: A Guide to Solving Array Problems Efficiently

Architect Algos
in
ArchitectAlgos

Mastering the Two-Pointer Technique: A Guide to Solving Array Problems Efficiently

Unlock the Power of Two-Pointer Algorithms for Optimal Solutions to Common Array Problems

5 min readSep 6

--

Decision Tree

Kalim

Decision Tree

In this Blog I will be writing about a widely used classification (machine learning) algorithm, that is, Decision Tree.

9 min readAug 19

--

Mastering Sliding Window Techniques

Ankit Singh

Mastering Sliding Window Techniques

The sliding window technique is a common algorithmic approach used for solving various problems that involve processing or analyzing a…

6 min readAug 8

--

See more recommendations

Help
Status
About
Careers
Blog
Privacy
Terms
Text to speech
Teams