Welcome back brave human being,

Yesterday we learned the pattern of Two-Pointers. Now that we have learned the two-pointer pattern, let’s put it to a test. 

Now, let’s put it to the test.

Problem:

Day 2:  977. Squares of a Sorted Array 

Given a sorted array, return an array of the squares of each number sorted.  

How can you do it in O(N)? 

Can you think about the naive approach? How could the two-pointer technique make this go faster? 

Need motivation to be consistent?

Start your log with this problem and when the challenge is done send it to me! You’ll be in for a treat.

I’ll send the solution on Monday with an editorial,

Keep up the great work,

Denisse

Job Application Hack!

Download the Chrome extension Simplify and add your CV to it. This will allow you to reduce the Job application time to 3 seconds.

Job postings I came across:

• Miquel Ball looking for a SummerCS Intern @Apple 

• Shubham Lal is looking for a Data Science intern @Microsoft