Video Description
A course that teaches pointers, linked lists, general programming, algorithms and recursion like no one else
About This Video
 Learn more about C programming to crack hundreds of technical interviews
 Programming interviews are like standard plays in professional sport prepare accordingly.
In Detail
Programming interviews are like standard plays in professional sport  prepare accordingly. Don't let Programming Interview gotchas get you down! Programming interviews differ from real programming jobs in several important aspects, so they merit being treated differently, just like set pieces in sport. Just like teams prepare for their opponent's playbooks in professional sport, it makes sense for you to approach programming interviews anticipating the interviewer's playbook this course has been drawn by a team that has conducted hundreds of technical interviews at Google and Flipkart. Pointers: Memory layout of pointers and variables, pointer arithmetic, arrays, pointers to pointers, pointers to structures, argument passing to functions, pointer reassignment and modification  complete with visuals to help you conceptualize how things work. Strings: Strings, Character pointers, character arrays, null termination of strings, string.h function implementations with detailed explanations. Linked lists: Visualization, traversal, creating or deleting nodes, sorted merge, reversing a linked list and many problems and solutions, doubly linked lists. Bit Manipulation: Work with bits and bit operations. Sorting and searching algorithms: Visualize how common sorting and searching algorithms work and the speed and efficiency of those algorithms. Recursion: Master recursion with lots of practice! 8 common and uncommon recursive problems explained. Binary search, finding all subsets of a subset, finding all anagrams of a word, the infamous 8 Queens problem, executing dependent tasks, finding a path through a maze, implementing PaintFill, comparing two binary trees. Data Structures: Understand queues, stacks, heaps, binary trees and graphs in detail along with common operations and their complexity. Includes code for every data structure along with solved interview problems based on these data structures. Stepbystep solutions to dozens of common programming problems: Palindromes, Game of Life, Sudoku Validator, Breaking a Document into Chunks, Run Length Encoding, and Points within a distance are some of the problems solved and explained.
Publisher Resources
Table of Contents
 Chapter 1 : Introduction

Chapter 2 : Pointer and Arrays
 Introduction to pointers 00:20:00
 Pointer problems and arrays 00:13:35
 Pointer arithmetic 00:11:43
 Practice makes perfect  pointer problems 00:07:38

Chapter 3 : Strings are just pointers at heart
 Working with strings 00:14:07
 Pointer as arguments to functions 00:09:39
 Practice makes perfect  string problems 00:19:24

Chapter 4 : Linked lists can be fun!
 Pointers to pointers  bend your mind 00:10:28
 Pointers to pointers  reassignment and modification 00:11:14
 Get started with linked lists 00:17:17
 Warming up to  they get tricky quickly 00:16:20
 Cruising along  linked lists are fun aren't they? 00:19:00
 Autopilot  linked lists are easy after all 00:16:31
 Do not overlook the doubly linked list 00:10:03

Chapter 5 : Bit Manipulation
 Bit Manipulation – I 00:10:08
 Bit Manipulation – II 00:08:39
 Useful Bit Manipulation Techniques 00:13:14
 Get And Set The Nth Bit 00:13:30
 Print And Count Bits 00:18:54
 Reverse The Bits In An Integer 00:10:11
 Chapter 6 : General programming problems  practice makes perfect

Chapter 7 : BigO Notation, Sorting And Searching Algorithms
 Performance and Complexity 00:16:02
 Big O Notation 00:15:59
 Big O Notation More Examples 00:19:12
 Sorting TradeOffs 00:10:53
 Selection Sort 00:15:25
 Bubble Sort 00:14:42
 Insertion Sort 00:14:32
 Shell Sort 00:14:13
 Merge Sort 00:19:23
 Quick Sort 00:15:30
 Binary Search  search quickly through a sorted list 00:11:11

Chapter 8 : Recursion and the recursive sense
 What is recursion  why is it so hard? 00:16:59
 Binary search  implemented recursively 00:13:22
 Find all subsets of a set 00:14:55
 Check whether 2 binary trees are the same 00:14:52
 Implement paint fill to color a region on screen 00:11:01
 Build A car Given Tasks And Dependencies 00:14:18
 Generate Anagrams Of A Word 00:16:35
 Help A Rat Find It's Way Through a Maze 00:13:01
 Place 8 Queens On A Board Safely 00:17:51

Chapter 9 : Stacks And Queues
 Meet The Stack  Simple But Powerful 00:15:41
 Building A Stack Using Java 00:16:53
 Match Parenthesis To Check A Well Formed Expression 00:11:22
 Find The Minimum Element In A Stack In Constant Time 00:08:51
 Meet The Queue  A Familiar Sight In Everyday Life 00:14:11
 The Circular Queue  Tricky But Fast 00:19:45
 Build A Queue With Two Stacks 00:17:30

Chapter 10 : Binary Trees
 Meet The Binary Tree  A Hierarchical Data Structure 00:13:03
 Breadth First Traversal 00:18:43
 Depth First  PreOrder Traversal 00:14:35
 Depth First  InOrder and PostOrder Traversal 00:13:52
 Chapter 11 : Binary Search Trees
 Chapter 12 : Binary Tree Problems

Chapter 13 : Heaps
 The Heap Is Just The Best Way to Implement a Priority Queue 00:17:16
 Meet The Binary Heap  It's A Tree At Heart 00:12:40
 The Binary Heap  Logically A Tree Really An Array 00:17:14
 The Binary Heap  Making It Real With Code 00:07:38
 Heapify! 00:19:33
 Insert And Remove From A Heap 00:16:35

Chapter 14 : Revisiting Sorting  The Heap Sort
 Heap Sort Phase I – Heapify 00:19:31
 Heap Sort Phase II  The Actual Sort 00:17:43
 Chapter 15 : Heap Problems

Chapter 16 : Graphs
 Introducing The Graph 00:15:40
 Types Of Graphs 00:07:21
 The Directed And Undirected Graph 00:14:29
 Representing A Graph In Code 00:08:09
 Graph Using An Adjacency Matrix 00:15:25
 Graph Using An Adjacency List And Adjacency Set 00:17:54
 Comparison Of Graph Representations 00:10:09
 Graph Traversal  Depth First And Breadth First 00:14:56

Chapter 17 : Graph Algorithms
 Topological sort is an ordering of vertices in a graph where a vertex comes before every other vertex to which it has outgoing edges. 00:17:31
 Here is the code in Java to implement topological sort. 00:06:57
 Given a course list and prereqs for every course design a course schedule so prereqs are done before the courses. 00:13:02
Product Information
 Title: Break Away: Programming And Coding Interviews
 Author(s):
 Release date: January 2018
 Publisher(s): Packt Publishing
 ISBN: 9781789130591