Udemyallen

Break Away: Programming And Coding Interviews

Master pointers, linked lists, algorithms & recursion. Level up your programming skills with expert techniques! Learn general programming concepts.

4.5(880)
8,300students
20h 10m
Certificate
Loony Corn
Loony CornAn ex-Google, Stanford and Flipkart team

Course Content

Break Away: Programming And Coding Interviews is an all-levels Udemy course taught by Loony Corn. It runs 20h 10m, is taught in English, and includes a certificate of completion. Learners rate it 4.5 out of 5 from 880 reviews, with 8,300 students enrolled. It is a paid course, last updated February 2018.

Programming interviews require a specific preparation strategy – think of them like standard plays in professional sports! Don't get tripped up by common programming interview gotchas. These assessments differ significantly from typical software development roles, demanding a tailored approach, much like teams studying their opponent's strategies.

This course, developed by a team with extensive experience conducting technical interviews at companies like Google and Flipkart, equips you with the knowledge and skills to excel.

Here's a detailed look at what we cover:

  • Pointers: Gain a deep understanding of pointers, including memory layout, pointer arithmetic, and how they relate to arrays, pointers to pointers, and pointers to structures. Learn about argument passing to functions, pointer reassignment, and modification, all explained with helpful visuals.
  • Strings: Master strings and character pointers. We'll cover character arrays, null termination, and detailed explanations of common string.h function implementations.
  • Linked Lists: Visualize, traverse, create, and delete nodes in linked lists. Learn to perform sorted merges and reverse linked lists. We'll explore both singly and doubly linked lists, with numerous problems and solutions.
  • Bit Manipulation: Develop proficiency in working with bits and performing essential bit operations.
  • Sorting & Searching Algorithms: Visualize the workings of common sorting algorithms and searching algorithms, understanding their efficiency and speed.
  • Recursion: Become comfortable with recursion through extensive practice. We'll explain 8 common and less common recursive problems, including binary search, finding all subsets of a set, finding all anagrams of a word, the classic 8 Queens problem, executing dependent tasks, finding a path through a maze, and implementing PaintFill.
  • Data Structures: Gain a comprehensive understanding of fundamental data structures: queues, stacks, heaps, binary trees, and graphs. We'll cover common operations and their complexities, providing code implementations for each. The course includes solved interview problems specifically designed around these data structures.

Step-by-step solutions to dozens of common programming problems: Learn to solve practical challenges like Palindromes, Game of Life, Sudoku Validator, Breaking a Document into Chunks, Run Length Encoding, and determining Points within a distance.

$ whoami — the devs behind tutorialsearch.io

Need a web app built? Hire the team behind TutorialSearch.io

We ship fast, production-grade full-stack apps (Next.js, React, edge infra) — the same stack that powers this site.