Video description
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.
What You Will Learn
 Know how to approach and prepare for coding interviews
 Understand pointer concepts and memory management at a very deep and fundamental level
 Tackle a wide variety of linked list problems and know how to get started when asked linked list questions as a part of interviews
 Tackle a wide variety of general pointer and string problems and know how to answer questions on them during interviews
 Tackle a wide variety of general programming problems which involve just plain logic, no standard algorithms or data structures, these help you get the details right!
Audience
New engineering graduate students who are interviewing for software engineering jobs. Professionals from other fields with some programming knowledge looking to change to a software role. Software professionals with several years of experience who want to brush up on core concepts.
About The Author
Loonycorn: Janani Ravi is a certified Google Cloud Architect and Data Engineer. She has earned her master's degree in electrical engineering from Stanford. She is currently in Loonycorn, a technical video content studio, of which she is a cofounder. Prior to cofounding Loonycorn, she worked at various leading companies, such as Google and Microsoft, for several years as a software engineer.
Table of contents
 Chapter 1 : Introduction
 Chapter 2 : Pointer and Arrays
 Chapter 3 : Strings are just pointers at heart
 Chapter 4 : Linked lists can be fun!
 Chapter 5 : Bit Manipulation
 Chapter 6 : General programming problems  practice makes perfect
 Chapter 7 : BigO Notation, Sorting And Searching Algorithms

Chapter 8 : Recursion and the recursive sense
 What is recursion  why is it so hard?
 Binary search  implemented recursively
 Find all subsets of a set
 Check whether 2 binary trees are the same
 Implement paint fill to color a region on screen
 Build A car Given Tasks And Dependencies
 Generate Anagrams Of A Word
 Help A Rat Find It's Way Through a Maze
 Place 8 Queens On A Board Safely
 Chapter 9 : Stacks And Queues
 Chapter 10 : Binary Trees
 Chapter 11 : Binary Search Trees
 Chapter 12 : Binary Tree Problems
 Chapter 13 : Heaps
 Chapter 14 : Revisiting Sorting  The Heap Sort
 Chapter 15 : Heap Problems
 Chapter 16 : Graphs

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.
 Here is the code in Java to implement topological sort.
 Given a course list and prereqs for every course design a course schedule so prereqs are done before the courses.
Product information
 Title: Break Away: Programming And Coding Interviews
 Author(s):
 Release date: January 2018
 Publisher(s): Packt Publishing
 ISBN: 9781789130591
You might also like
book
Programming Interviews Exposed, 4th Edition
Ace technical interviews with smart preparation Programming Interviews Exposed is the programmer’s ideal first choice for …
book
Programming Rust, 2nd Edition
Systems programming provides the foundation for the world's computation. Writing performancesensitive code requires a programming language …
book
Clean Code: A Handbook of Agile Software Craftsmanship
Even bad code can function. But if code isn’t clean, it can bring a development organization …
video
Ultimate Go Programming, Second Edition
16+ Hours of Video Instruction provides an intensive, comprehensive, and idiomatic view of the Go programming …