Break Away: Programming And Coding Interviews [Video]
 7day free trial Subscribe Access now
 $50.99 Video Buy

Advance your knowledge in tech with a Packt subscription
 Instant online access to over 7,500+ books and videos
 Constantly updated with 100+ new titles each month
 Breadth and depth in over 1,000+ technologies

Introduction

Pointer and Arrays

Strings are just pointers at heart

Linked lists can be fun!

Bit Manipulation

General programming problems  practice makes perfect

BigO Notation, Sorting And Searching Algorithms

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

Stacks And Queues

Binary Trees

Binary Search Trees

Binary Tree Problems

Heaps

Revisiting Sorting  The Heap Sort

Heap Problems

Graphs

Graph Algorithms
About this video
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.
Style and Approach
This course requires some basic understanding of a programming language, preferably C. Some solutions are in Java, though Java is not a requirement
 Publication date:
 January 2018
 Publisher
 Packt
 Duration
 20 hours 11 minutes
 ISBN
 9781789130591