[Java] Leetcode 977. Squares of a Sorted Array [Two Pointers #4]

preview_player
Показать описание
In this video, I'm going to show you how to solve Leetcode 977. Squares of a Sorted Array which is related toTwo Pointers.

Here’s a quick rundown of what you’re about to learn:
⭐️ Course Contents ⭐️
⌨️ (0:00) Question
⌨️ (1:50) Solution 1 (Large square values to small square values)
⌨️ (5:30) Solution 2 (Small square values to large square values)

In the end, you’ll have a really good understanding on how to solve Leetcode 977. Squares of a Sorted Array and questions that are similar to thisTwo Pointers.

#leetcode #programming #softwareengineering #computerscience
  1. Eric Programming
  2. leetcode Squares of a Sorted Array
  3. leetcode 977
  4. leetcode 977 Squares of a Sorted Array
  5. 977 Squares of a Sorted Array
  6. eric programming leetcode 977
Рекомендации по теме
Squares of Sorted 0:11:01

Squares of Sorted Array (LeetCode 977) | Full Solution with examples & animation | Study Algorit...

[Java] Leetcode 977. 0:09:00

[Java] Leetcode 977. Squares of a Sorted Array [Two Pointers #4]

Squares of a 0:03:25

Squares of a Sorted Array | Live Coding with Explanation | Leetcode #977

Squares of a 0:08:14

Squares of a Sorted Array - Leetcode 977 - Python

Squares of a 0:11:07

Squares of a Sorted Array | Java Coding Interview Question and Answer | Leetcode 977 | Code Decode

LeetCode Problem: 977. 0:15:38

LeetCode Problem: 977. Squares of a Sorted Array | Java Solution

Squares of a 0:08:07

Squares of a Sorted Array | LeetCode 977 | Top Interview Question | Arrays Java DSA | Geekster

Leetcode | 977. 0:07:31

Leetcode | 977. Squares of a Sorted Array | Easy | Java Solution [O(n) Time]

Leetcode 977 | 0:07:19

Leetcode 977 | Squares of a Sorted Array | Easy Coding Interview Question (Java Solution)

Leetcode 977 - 0:02:15

Leetcode 977 - Squares of a Sorted Array (JAVA, Solution Explain!)

LeetCode Squares of 0:08:56

LeetCode Squares of a Sorted Array Explained - Java

LeetCode Problem 977. 0:10:25

LeetCode Problem 977. Squares of a Sorted Array || Java Solution Walkthrough

Squares of a 0:17:01

Squares of a Sorted Array - Two Pointers - Leetcode 977 - Python and Java

SQUARES OF A 0:14:08

SQUARES OF A SORTED ARRAY LEETCODE 977 SOLUTION IN JAVA | LEETCODE | 977 | SQUARES OF A SORTED ARRAY

[Java] LeetCode - 0:07:30

[Java] LeetCode - 977 - Squares of a Sorted Array - In O(N) Time And O (N) Space Complexity

977. Squares of 0:11:52

977. Squares of a Sorted Array | when to use 2 Pointer | Sorting | 2 Ways

LeetCode 977: Squares 0:13:47

LeetCode 977: Squares of a Sorted Array | Java Code Tutorial | Step by Step Explanation #google

Squares of a 0:06:25

Squares of a Sorted Array | 2 Approaches | Follow Up | Leetcode 977

LeetCode 977 - 0:08:28

LeetCode 977 - Squares of a Sorted Array in O(n) time - Exploring a Must-Know Programming Challenge!

Squares of a 0:08:35

Squares of a Sorted Array | LeetCode #977 | Python 3 | Intuitive to Optimized

LeetCode 977 | 0:04:14

LeetCode 977 | Squares of a Sorted Array | 2 Pointers | Java

LeetCode 977: Squares 0:04:08

LeetCode 977: Squares of a Sorted Array (Java)

977. Squares of 0:08:58

977. Squares of a Sorted Array || Java || Leetcode || Hindi

Squares of a 0:03:47

Squares of a Sorted Array | Leetcode Solution Explained | JAVA

Комментарии
Автор

Please Make your dsa tutorial public 😢😢

Kaafirpeado-ayesha
Автор

Solution with typescript
function sortedSquares(nums: number[]) {
//base case
let n :number = nums.length ;
if(n < 2 ){
nums[0] = nums[0] ** 2 ;
return nums;
}

//define 2 pointers
let left :number = 0;
let right :number = n - 1 ;
let result :number[] = [] ;
let i :number = n - 1 ;
while(i >= 0){
let check :boolean = nums[left]**2 < nums[right]**2;
if(check){
result[i--] = nums[right]**2;
right -- ;
}else{
result[i--] = nums[left]** 2;
left++;
}
}
return result;
};

minhnhatnguyen
Автор

how is the space complexity O(1) despite creating a new array with size 'n' (the result array)? shouldn't it be O(n) instead?

ahmadhesham
Автор

the first time I tried this exercise with javascript, I wrote this.

Math.pow(nums).sort();

hahaha

ferreiradelima