Break Away - Interview
Crack any interview
Crack any interview
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
<strong>Break</strong> <strong>Away</strong>: Programming And Coding<br />
<strong>Interview</strong>s<br />
DESCRIPTION<br />
Programming interviews are like standard plays in professional sport - prepare<br />
accordingly. Don't let Programming <strong>Interview</strong> gotchas get you down!<br />
• Programming interviews differ from real programming jobs in several important<br />
aspects, so they merit being treated differently, just like set pieces in sport.<br />
• Just like teams prepare for their opponent's playbooks in professional sport, it makes<br />
sense for you to approach programming interviews anticipating the interviewer's<br />
playbook<br />
• This course has been drawn by a team that has conducted hundreds of technical<br />
interviews at Google and Flipkart<br />
What's Covered:<br />
• Pointers: Memory layout of pointers and variables, pointer arithmetic, arrays, pointers to<br />
pointers, pointers to structures, argument passing to functions, pointer reassignment and<br />
modification - complete with visuals to help you conceptualize how things work.<br />
• Strings: Strings, Character pointers, character arrays, null termination of strings, string.h<br />
function implementations with detailed explanations.<br />
• Linked lists: Visualization, traversal, creating or deleting nodes, sorted merge, reversing<br />
a linked list and many many problems and solutions, doubly linked lists.<br />
• Bit Manipulation: Work with bits and bit operations.<br />
• Sorting and searching algorithms: Visualize how common sorting and searching<br />
algorithms work and the speed and efficiency of those algorithms<br />
• Recursion: Master recursion with lots of practice! 8 common and uncommon recursive<br />
problems explained. Binary search, finding all subsets of a subset, finding all anagrams of<br />
a word, the infamous 8 Queens problem, executing dependent tasks, finding a path<br />
through a maze, implementing PaintFill, comparing two binary trees<br />
• Data Structures: Understand queues, stacks, heaps, binary trees and graphs in detail<br />
along with common operations and their complexity. Includes code for every data<br />
structure along with solved interview problems based on these data structures.<br />
• Step-by-step solutions to dozens of common programming problems: Palindromes, Game<br />
of Life, Sudoku Validator, <strong>Break</strong>ing a Document into Chunks, Run Length Encoding, Points<br />
within a distance are some of the problems solved and explained.<br />
Who is the target audience?<br />
• YEP! New engineering graduate students who are interviewing for software engineering<br />
jobs<br />
• YEP! Professionals from other fields with some programming knowledge looking to change<br />
to a software role<br />
• YEP! Software professionals with several years of experience who want to brush up on<br />
core concepts<br />
• NOPE! Other technology related professionals who are looking for a high level overview of<br />
pointer concepts.<br />
BASIC KNOWLEDGE
• This course requires some basic understanding of a programming language, preferably C.<br />
Some solutions are in Java, though Java is not a requirement<br />
WHAT YOU WILL LEARN<br />
• Know how to approach and prepare for coding interviews<br />
• Understand pointer concepts and memory management at a very deep and fundamental<br />
level<br />
• Tackle a wide variety of linked list problems and know how to get started when asked<br />
linked list questions as a part of interviews<br />
• Tackle a wide variety of general pointer and string problems and know how to answer<br />
questions on them during interviews<br />
• Tackle a wide variety of general programming problems which involve just plain logic, no<br />
standard algorithms or data structures, these help you get the details right!