Top 10 Javascript Algorithms to Prepare for Coding Interviews

Build a solid foundation and prepare you for Leetcode-style coding challenges. Learn the top 10 must-know Javascript algorithms interview questions to help you ace your coding interviews. This course will help you build a strong foundation in Javascript algorithms and tackle Leetcode problems with confidence.

✏️ Course developed by @CodingMoney

⌨️ (0:00:00) Introduction
⌨️ (0:01:00) Reverse String & Integers
⌨️ (0:11:29) Palindrome
⌨️ (0:15:58) Max Char
⌨️ (0:33:43) Array Chunking
⌨️ (0:41:56) Title Case
⌨️ (0:49:31) Anagrams
⌨️ (1:07:54) Count Vowels
⌨️ (1:15:21) Fizz Buzz
⌨️ (1:20:02) Steps String Pattern
⌨️ (1:30:52) Pyramid String Pattern
⌨️ (1:39:24) Bonus - Spiral Matrix

🎉 Thanks to our Champion and Sponsor supporters:
👾 davthecoder
👾 jedi-or-sith
👾 南宮千影
👾 Agustín Kussrow
👾 Nattira Maneerat
👾 Heather Wcislo
👾 Serhiy Kalinets
👾 Justin Hual
👾 Otis Morgan
👾 Oscar Rahnama

--

[CodingMoney]

1:00 Reverse String & Integers
11:29 Palindrome
15:58 Max Char
33:43 Array Chunking
41:56 Title Case
49:31 Anagrams
1:07:54 Count Vowels
1:15:21 Fizz Buzz
1:20:02 Steps String Pattern
1:30:52 Pyramid String Pattern
1:39:24 Bonus - Spiral Matrix

[sayedrezaomid]

I am very happy that i saw my Afghan and ex colleaque trainings at this channel.

[WhitneyChakara]

This is excellent and able to be completed as it's short and straight to the point.

[throbicon]

Awesome video! Thank you for making it 😀

[MyCodingDiary]

You're changing lives with your content. Keep inspiring!

[khanhphamthanh]

amazing spiral Matrix. It really so hard for me to find out the way. Thank you for your code

[daisy_haniii]

Palindrome using two pointers technique:

function isPalindrome(str) {
let min = 0
let max = str.length - 1

do {
if(str[min] == str[max]) {
min++
max--
} else {
return false
}
}while(min < max)

return true
}

[dysibft]

So engaging and interesting thank you sir for this lecture ❤

[LokeshKumar-tkri]

Thank you Free code Camp for providing DSA in Javascript and also need more content on JS DSA

[nazardzys]

Hi, thanks for your video!
On example 5 you can also use Array.splice() method. I believe, it looks more cleaner comparing to solution with Array.slice().

here's the whole solution:
return str
.split(" ")
.map((item) => {
const word = item.split("");
word.splice(0, 1, word[0].toUpperCase());

return word.join("");
})
.join(" ");
}

[DavidMorenoH]

OMG please do this but with Java or Python

[atultrp]

// every method

function palindrome(str) {
return str.split('').every((ele, i) => {
return ele == str[str.length - i - 1]
})
}

// two pointer technique

function palindrome2(str) {
let start = 0
let last = str.length - 1
while (start < last) {
if (str[start] != str[last]) {
return false
}
else {
start++
last--
}
}
return true
}

[narekmeliksetyan]

it was very useful. but I will suggest the following solution for problem 9.

function foo(n){
for(i=1;i<=n;i++){
const
console.log(x)
}
}
foo(7)

[ajiteshmishra]

We want more videos on these String and Array manipulation methods and programming questions

[cutwvbk]

Q1:

function reverseIt(str){

let newArr = '';
for(let i = 0; i< str.length ; i ++)
{
newArr += str[str.length -i-1];
}

return newArr;

}

[savchenkoilliya]

In my opinion I can give better and more javascript-style solutions for at least couple tasks. Maybe it's a little bit harder to read, but it works better when we are talking about js:

var chunk = (array, size) =>
(array.length <= size ? [array] : [array.slice(0, size),
...chunk(array.slice(size), size)])

var toCapitalize = (str) => (str.split(" ")
.map((word)=>
(word.charAt(0).toUpperCase() + word.slice(1)).join(" ")))

P.S.
Good practice show O(n) complexity for each solution, because it's a think that can be asked on any interview.

[ajiteshmishra]

We are learning well from these type of Videos


But please zoom in something more so that we can see the screen properly.

[giftedfingers]

I'm having a hard time understanding what part of the reverse function is the actual part doing the reversing can someone please clarify...

[edwarddk]

my solution for the Pyramid String Pattern exercise: function pyramid(n, level, body, space) {
if(level <= n) {
let text =``
for(let i = 0; i < body; i++){
text+=`#`

}
text = text.padStart(space+text.length, ' ').padEnd(space+text.length+space, ' ')
console.log(text);
pyramid(n, level+1, body+2, space-1)
}
}
let n = 10
pyramid(n, 1, 1, n-1)

[FULLUPE]

great and awesome thanks sir but with steps this is a little modification const (no if and else)

steps=(n)=>{
for (let i=1; i<n; i++){
let line=""
for(let k=1; k<=i; k++){
line += "#"
}
console.log(line)
}}
steps(5)