Sale!
Break Away: Programming And Coding Interviews

Break Away: Programming And Coding Interviews

$29 $7

A course that teaches pointers, linked lists, general programming, algorithms and recursion like no one else

Product 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

What’s Covered:

  • 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 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.
    Step-by-step solutions to dozens of common programming problems: Palindromes, Game of Life, Sudoku Validator, Breaking a Document into Chunks, Run Length Encoding, Points within a distance are some of the problems solved and explained.

Talk to us!

Mail us about anything – anything! – and we will always reply 🙂

What am I going to get from this course?

  • 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!

What is the target audience?

  • YEP! New engineering graduate students who are interviewing for software engineering jobs
  • YEP! Professionals from other fields with some programming knowledge looking to change to a software role
  • YEP! Software professionals with several years of experience who want to brush up on core concepts
  • NOPE! Other technology-related professionals who are looking for a high-level overview of pointer concepts.

Curriculum

  • M1 – Coding interviews are tough - but beatable
  • M2 - Introduction to pointers
  • M2 - Pointer problems and arrays
  • M2 - Pointer arithmetic
  • M2 - Practice makes perfect - pointer problems
  • M3 - Working with strings
  • M3 - Pointer as arguments to functions
  • M3 - Practice makes perfect - string problems
  • M4 - Pointers to pointers - bend your mind
  • M4 - Pointers to pointers - reassignment and modification
  • M4 - Get started with linked lists
  • M4 - Warming up to - they get tricky quickly
  • M4 - Cruising along - linked lists are fun aren't they?
  • M4 - Autopilot - linked lists are easy after all
  • M4 - Do not overlook the doubly linked list
  • M5 - Bit Manipulation I
  • M5 - Bit Manipulation II
  • M5 - Useful Bit Manipulation Techniques
  • M5 - Get And Set The Nth Bit
  • M5 - Print And Count Bits
  • M5 - Reverse The Bits In An Integer
  • M6 - Starting up - palindromes and points within a distance
  • M6 - Play the Game Of Life and Break A Document Into Chunks
  • M6 - Run Length Encoding And Adding Numbers Digit By Digit
  • M6 - Sudoku Board Validation and Incrementing A Number In Another Number System
  • M7 - Performance and Complexity
  • M7 - Big O Notation
  • M7 - Big O Notation More Examples
  • M7 - Sorting Trade-Offs
  • M7 - Selection Sort
  • M7 - Bubble Sort
  • M7 - Insertion Sort
  • M7 - Shell Sort
  • M7 - Merge Sort
  • M7 - Quick Sort
  • M7 - Binary Search - search quickly through a sorted list
  • M8 - What is recursion - why is it so hard?
  • M8 - Binary search - implemented recursively
  • M8 - Find all subsets of a set
  • M8 - Check whether 2 binary trees are the same
  • M8 - Implement paint fill to color a region on screen
  • M8 - Build A car Given Tasks And Dependencies
  • M8 - Generate Anagrams Of A Word
  • M8 - Help A Rat Find It's Way Through a Maze
  • M8 - Place 8 Queens On A Board Safely
  • M9 - Meet The Stack - Simple But Powerful
  • M9 - Building A Stack Using Java
  • M9 - Match Parenthesis To Check A Well Formed Expression
  • M9 - Find The Minimum Element In A Stack In Constant Time
  • M9 - Meet The Queue - A Familiar Sight In Everyday Life
  • M9 - The Circular Queue - Tricky But Fast
  • M9 - Build A Queue With Two Stacks
  • M10 - Meet The Binary Tree - A Hierarchical Data Structure
  • M10 - Breadth First Traversal
  • M10 - Depth First Pre-OrderTraversal
  • M10 - Depth First - In-Order and Post-Order Traversal
  • M11 - The Binary Search Tree - an introduction
  • M11 - Insertion and Lookup in a Binary Search Tree
  • M12 - Minimum Value, Maximum Depth And Mirror
  • M12 - Count Trees Print Range and Is BST
  • M12 - Has Path Sum, Print Paths Least Common Ancestor
  • M13 - The Heap Is Just The Best Way to Implement a Priority Queue
  • M13 - Meet The Binary Heap - It's A Tree At Heart
  • M13 - Heapify!
  • M13 - Insert And Remove From A Heap
  • M14 - Heap Sort Phase I Heapify
  • M14 - Heap Sort Phase II - The Actual Sort
  • M15 - Maximum Element In A Minimum Heap and K Largest Elements In A Stream
  • M15 - Merge K Sorted Lists Into One Sorted List Using A Heap
  • M15 - Find The Median In A Stream Of Elements
  • M16 - Introducing The Graph
  • M16 - Types of Graphs
  • M16 - The Directed And Undirected Graph
  • M16 - Representing A Graph In Code
  • M16 - Graph Using An Adjacency Matrix
  • M16 - Graph Using An Adjacency List And Adjacency Set
  • M16 - Comparison Of Graph Representations
  • M16 - Graph Traversal - Depth First And Breadth First

Course Requirements

This course requires some basic understanding of a programming language, preferably C.

Some solutions are in Java, though Java is not a requirement

Hurry up! The price rises inRefreshing countdownClose Countdown

GET STARTED

Register | Lost your password?