ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

7 results

Confreaks
RubyConf 2018 - Refactoring the Technical Interview by Mark Siemers

RubyConf 2018 - Refactoring the Technical Interview by Mark Siemers Is your technical interview optimized? Could it use a ...

36:39
RubyConf 2018 - Refactoring the Technical Interview by Mark Siemers

1,715 views

7 years ago

Tyler Caraza-Harter
CS 320 Oct 2 (Part 2) - BST Search

um so one issue i'm seeing is that i'm never gonna ever return false right i kind of do this recursive call but when do i actually ...

21:00
CS 320 Oct 2 (Part 2) - BST Search

209 views

5 years ago

Kurt Zoglmann
Easy Phrases 20wpm

For each sentence, try to head-copy it. Then listen to it spoken to catch any words that you missed. Then listen again to the ...

2:18:33
Easy Phrases 20wpm

2,948 views

6 years ago

I Hate Programming
Find the most frequent item of an array | I hate programming

PLEASE DON'T FORGET TO SUBSCRIBE MY CHANNEL AND IT WILL NOT TAKE YOU MUCH TIME TO HELP ME THANK YOU ...

20:46
Find the most frequent item of an array | I hate programming

1,500 views

3 years ago

Tyler Caraza-Harter
CS 320 Oct 7 (Part 1) - BFS Backtrace

... run this and again i'm kind of having the same problem i i wonder why this didn't didn't work right um why for example you know ...

26:25
CS 320 Oct 7 (Part 1) - BFS Backtrace

261 views

5 years ago

Tyler Caraza-Harter
CS 320 Oct 7 (Part 2) - Stacks, Queues, and Priority Queues
23:37
CS 320 Oct 7 (Part 2) - Stacks, Queues, and Priority Queues

235 views

5 years ago

NPTEL IIT Bombay
Lecture 13C: Shortest path problem

Week 7: Lecture 13C: Shortest path problem.

30:06
Lecture 13C: Shortest path problem

681 views

4 years ago