Back to Back SWE Coding Interview Course Review + Discount Code

preview_player
Показать описание


♡♡♡♡♡♡♡♡♡♡♡♡♡♡♡♡♡♡♡♡♡♡♡♡♡

CLICK THE 🔔 FOR NOTIFICATIONS EVERY TIME I POST!
💎 Don't forget to subscribe, Give this video a thumbs up! & Don’t hesitate to leave suggestions in the comment section.

♡♡♡♡♡♡♡♡♡♡♡♡♡♡♡♡♡♡♡♡♡♡♡♡♡

✨ REFERRAL CODES ✨

♡♡♡♡♡♡♡♡♡♡♡♡♡♡♡♡♡♡♡♡♡♡♡♡♡

Frequently Asked Questions:

≫How old are you?
21

≫What camera/editing software do you use?
Sony ZV-1, Final Cut Pro

≫ College & Major?
Recent grad - The University of British Columbia, Business and Computer Science
  1. Jasmine Wu
  2. back to back swe review
  3. Back to back swe coding interview course
  4. backtobackswe.com
  5. Benyam Ephrem
  6. cracking the coding interview
Рекомендации по теме
i'm starting a 0:04:19

i'm starting a coding interview class

The Backtracking Blueprint: 0:13:44

The Backtracking Blueprint: The Legendary 3 Keys To Backtracking Algorithms

Back to Back 0:08:54

Back to Back SWE Coding Interview Course Review + Discount Code

How To Get 0:16:57

How To Get A Job At Google | The Ultimate Guide To Algorithmic/Coding Interviews

Build A Min 0:06:55

Build A Min Height BST From A Sorted Array | Coding Interview Question

Introducing Asymptotic Notations 0:05:17

Introducing Asymptotic Notations

Deeply Understanding Logarithms 0:10:24

Deeply Understanding Logarithms In Time Complexities & Their Role In Computer Science

Total Unique Ways 0:11:42

Total Unique Ways To Make Change - Dynamic Programming ('Coin Change 2' on LeetCode)

Important Coding Interview 0:00:52

Important Coding Interview Concept | 3 Keys to Backtracking #shorts #datastructures

Edit Distance Between 0:16:16

Edit Distance Between 2 Strings - The Levenshtein Distance ('Edit Distance' on LeetCode)

Coding Interview | 0:00:56

Coding Interview | Binary Tree Traversal #shorts #datastructures #binarytree #codinginterview

Add Two Numbers 0:18:25

Add Two Numbers Without The '+' Sign (Bit Shifting Basics)

Implement A Binary 0:20:19

Implement A Binary Heap - An Efficient Implementation of The Priority Queue ADT (Abstract Data Type)

3 Test Cases 0:00:49

3 Test Cases You Should Always Keep in Mind #shorts #datastructures

Coding Interview Concept 0:00:58

Coding Interview Concept | Asymptotic Behaviour #shorts #datastructures #codinginterview

Why Is Merge 0:36:50

Why Is Merge Sort O(n * log(n))? The Really Really Long Answer.

Find The Longest 0:19:21

Find The Longest Increasing Subsequence - Dynamic Programming Fundamentals

Egg Dropping Problem: 0:25:39

Egg Dropping Problem: Dynamic Programming Fundamentals & Understanding Subproblem Decomposition

Important Coding Interview 0:00:57

Important Coding Interview Concept | Parts of a Recursive Function #shorts #datastructures

Compute The Next 0:12:40

Compute The Next Permutation of A Numeric Sequence - Case Analysis ('Next Permutation' on ...

The Change Making 0:23:12

The Change Making Problem - Fewest Coins To Make Change Dynamic Programming

Don't Make This 0:00:50

Don't Make This Mistake | SWE

Coding Interview | 0:00:50

Coding Interview | Terms to know | API & ADT #shorts #datastructures #codinginterview

BackToBack SWE - 0:00:30

BackToBack SWE - Introduction

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

@TechGalDiaries Thanks for the review. I was planning to buy the course, and then realised that not all videos are from Benyam himself. Do you mind sharing roughly how many of them are not by Benyam? I am a big fan of his teaching.

rohit
Автор

There are a few drawbacks of the course I forgot to mention in video:
1. There is no Slack / Discord channel to ask questions
2. Some ambiguity with instructions for a few questions
3. Not all video explanations in the course are by Benyam Ephrem (seen on BacktoBack's Youtube channel), a few are by other people

But overall, I think the course is a great resource for structured extra practice if you enjoy their YouTube videos!

JasmineeeWu