Watch Demo

Rs. 1499

Job Seeker's Guide To Cracking the Technical Interview

Learn all the concepts you need to know for your Technical Interview Preparation such as Pointers, Linked Lists, General Programming concepts, Algorithms and Data Structures.

Lifetime access
1064 learners

Course Introduction:

Programming Interviews are like standard plays in professional sport - prepare accordingly. Don't let Programming Interview gotchas get you down!

Programming Interviews are very different from the real programming jobs. There are several important aspects which set the two apart. They merit being treated differently, just like set pieces in sport.

Technical Interviews are stressful and require the interviewee to have a strong grip over the core concepts. They are tough to crack but with regular practice, in-depth knowledge of core programming topics, and correct guidance it is not impossible to crack these interviews.

Read more

Course Objectives

On completing this comprehensive course on Programming Interview Preparation, you will:

  • Have the knowledge of all time FAVOURITE technical interview questions asked during an interview.
  • Be able to use tips and shortcuts to wow the interviewer with your programming skills.

Read more

Pre-requisites & Target Audience:

The structure of this course assumes students to have a basic knowledge in programming. Understanding concepts and fundamentals in C language would be very helpful. This comprehensive course on Programming Interview Preparation targets the following set of learners:

  • Freshers/ Engineering graduates aiming for a job as a software engineer.
  • Professionals with some programming background looking for a career in software industry.
  • Software Professionals who want to brush up on their core concepts.
  • Other technology- related professionals looking for a high-level overview of pointers.

Course Plan

1. Introduction
1 video
4. Linked lists can be fun!
7 videos
Pointers to Pointers - Bend your Mind 10:28

Pointers to Pointers - Reassignment and Modification 11:13

Get started with Linked Lists 17:17

Warming up to - they get Tricky Quickly 16:20

Cruising along - Linked Lists are fun aren't they? 19:00

Autopilot - Linked Lists are Easy After All 16:31

Do not overlook the Doubly Linked List 10:04
5. Bit Manipulation
6 videos
Bit Manipulation - I 10:08

Bit Manipulation - II 08:39

Useful Bit Manipulation Techniques 13:14

Get And Set The Nth Bit 13:30

Print And Count Bits 18:54

Reverse The Bits In An Integer 10:11
6. General Programming Problems - Practice Makes Perfect
4 videos
Starting up - Palindromes and Points within a Distance 18:17

Play the Game Of Life and Break A Document Into Chunks 18:33

Run Length Encoding and Adding Numbers Digit By Digit 19:46

Sudoku Board Validation and Incrementing A Number In Another Number System 19:55
7. Big-O Notation, Sorting, and Searching Algorithms
11 videos
Performance and Complexity 16:02

Big O Notation 16:47

Big O Notation More Examples 19:14

Sorting Trade-Offs 10:53

Selection Sort 15:25

Bubble Sort 14:42

Insertion Sort 14:32

Shell Sort 14:25

Merge Sort 19:23

Quick Sort 15:24

Binary Search - Search Quickly through a Sorted List 11:35
8. Recursion and the Recursive Sense
9 videos
What is Recursion - Why is it so hard? 17:33

Binary Search - Implemented Recursively 13:49

Find all Subsets of a Set 15:25

Check whether 2 Binary Trees are the same 15:33

Implement Paint Fill to Color a Region on Screen 11:42

Build A car Given Tasks And Dependencies 15:08

Generate Anagrams of a Word 17:17

Help a Rat Find It's Way Through a Maze 13:01

Place 8 Queens on a Board Safely 17:51
9. Stacks And Queues
7 videos
Meet The Stack - Simple But Powerful 15:41

Building a Stack using Java 16:53

Match Parenthesis to Check a Well Formed Expression 11:22

Find the Minimum Element in a Stack in Constant Time 08:51

Meet the Queue - A Familiar Sight in Everyday Life 14:11

The Circular Queue - Tricky but Fast 19:45

Build A Queue with Two Stacks 17:30
10. Binary Trees
4 videos
Meet the Binary Tree - A Hierarchical Data Structure 13:03

Breadth First Traversal 18:43

Depth First - Pre-OrderTraversal 14:35

Depth First - In-Order and Post-Order Traversal 13:52
11. Binary Search Trees
2 videos
The Binary Search Tree - an introduction 09:50

Insertion and Lookup in a Binary Search Tree 17:00
12. Binary Tree Problems
3 videos
Minimum Value, Maximum Depth, and Mirror 11:47

Count Trees, Print Range, and Is BST 14:39

Has Path Sum, Print Paths, Least Common Ancestor 14:50
13. Heaps
6 videos
The Heap is Just the Best Way to Implement a Priority Queue 17:16

Meet the Binary Heap - It's a Tree at Heart 12:40

The Binary Heap - Logically a Tree, Really an Array 17:14

The Binary Heap - Making it Real with Code 07:38

Heapify! 19:33

Insert and Remove from a Heap 16:35
14. Revisiting Sorting - The Heap Sort
2 videos
Heap Sort Phase I - Heapify 19:31

Heap Sort Phase II - The Actual Sort 17:43
15. Heap Problems
3 videos
Maximum Element in a Minimum Heap and K Largest Elements in a Stream 15:54

Merge K Sorted Lists into One Sorted List using a Heap 11:41

Find the Median in a Stream of Elements 16:05
16. Graphs
8 videos
Introducing the Graph 15:40

Types of Graphs 07:21

The Directed and Undirected Graph 14:29

Representing a Graph in Code 08:09

Graph using an Adjacency Matrix 15:25

Graph using an Adjacency List and Adjacency Set 17:54

Comparison of Graph Representations 10:09

Graph Traversal - Depth First and Breadth First 14:56

Meet the Author

4 Alumni of Stanford, IIM-A, IITs and Google, Microsoft, Flipkart

Loonycorn is a team of 4 people who graduated from reputed top universities. Janani Ravi, Vitthal Srinivasan, Swetha Kolalapudi and Navdeep Singh have spent years (decades, actually) working in the Tech sector across the world.

  • Janani: Graduated from Stanford and has worked for 7 years at Google (New York, Singapore). She also worked at Flipkart and Microsoft.
  • Vitthal: Studied at Stanford; worked at Google (Singapore), Flipkart, Credit Suisse, and INSEAD.
  • Swetha: An IIM Ahmedabad and IIT Madras alumnus having experience of working in Flipkart.
  • Navdeep: An IIT Guwahati alumnus and Longtime Flipkart employee.
  • More from Loonycorn
    Ratings and Reviews     4.5/5

    You may also like