Netflix SDE Sheet: Interview Questions and Answers (original) (raw)

This Netflix SDE sheet is a collection of all popular and important coding questions that have been asked in Netflix technical interviews so far. Questions here are grouped topic-wise based on the DSA category they fall into. It covers mostly all important DSA topics that are given emphasis in Netflix interviews. This sheet will assist you in landing a job at Netflix.

**Interview Rounds

• **Prescreen with a recruiter: Your initial phone screen will be around 30 minutes when the recruiter will dig into your resume and ask questions about your past projects and cultural fit.
• **Phone Call Interview: A 45–60 minute discussion with the hiring or engineering manager, covering open-ended and technology-specific technical questions, along with a live coding challenge in a shared editor.
• **On-site Interview –
  • **Part 1: Four 45-minute sessions with team members, focusing on technical questions, whiteboarding exercises, and cultural fit, conducted mostly in 1:1 or 2:1 formats.
  • **Part 2: Three 45-minute rounds with HR, the hiring manager, and the engineering manager—mainly behavioral, with a technical, resume-based discussion in the final round.

**Phone Screenings

**Behavioral Skills

Many candidates find behavioral interview questions intimidating because they are less structured than technical ones. Unlike technical questions with clear answers, behavioral questions are more open-ended and can feel uncomfortable. Here are some tips to prepare effectively.

**Technical Phone Screening

While phone interviews offer flexibility and access to notes, they come with unique challenges—so thorough preparation is essential to move forward in the selection process.

We have prepared tips to crack a telephonic Interview.

**Netflix Interview Questions and Answers

**Array

An array is a collection of items stored at contiguous memory locations. The idea is to store multiple items of the same type together.

• Find a triplet that sums to a given value [Practice Problem]
• Boolean Matrix [Practice Problem]
• Maximum subset XOR [Practice Problem]
• Number of subsets with product less than k [Practice Problem]
• Given a number, find the next smallest palindrome [Practice Problem]
• Arrange given numbers to form the biggest number [Practice Problem]
• Nuts & Bolts Problem [Practice Problem]
• Maximize elements using another array [Practice Problem]
• Capacity To Ship Packages Within D Days [Practice Problem]
• Longest Arithmetic Progression [Practice Problem]
• Construct a List using the given Q XOR queries [Practice Problem]
• Find the row with the maximum number of 1s [Practice Problem]
• Find top k (or most frequent) numbers in a stream [Practice Problem]
• Find duplicates in O(n) time and O(1) extra space [Practice Problem]
• Move all Zeros to End of Array [Practice Problem]
• Stock Buy and Sell - Multiple Transaction Allowed [Practice Problem]
• Rearrange Array Elements by Sign [Practice Problem]

**Strings

Strings are defined as an array of characters. The difference between a character array and a string is the string is terminated with a special character ‘\0’.

• Find all distinct palindromic sub-strings of a given string [Practice Problem]
• Longest substring whose characters can be rearranged to form a Palindrome [Practice Problem]
• How to design a tiny URL or URL shortener [Practice Problem]
• Longest repeating and non-overlapping substring [Practice Problem]
• Length of the longest valid substring [Practice Problem]
• Find a pair with the given difference [Practice Problem]
• Find the Largest number with a given number of digits and the sum of digits [Pra]ctice Problem]
• Find Excel column name from a given column number [Practice Problem]
• Count words that appear exactly two times in an array of words [Practice Problem]
• Implement Atoi [Practice Problem]
• Count substrings with k distinct characters [Practice Problem]
• Trapping Rain Water Problem [Practice Problem]

**Linked List

A linked list is a linear data structure, in which the elements are not stored at contiguous memory locations.

• Convert a given Binary Tree to a Doubly Linked List [Practice Problem]
• Clone a linked list with the next and random pointer [Practice Problem]
• Rearrange a given linked list in-place[Practice Problem]
• Flatten a binary tree into a linked list [Practice Problem]
• Reverse a sublist of the linked list [Practice Problem]
• Extract Leaves of a Binary Tree in a Doubly Linked List [Practice Problem]
• QuickSort on Singly Linked List [Practice Problem]
• Insertion Sort for Singly Linked List [Practice Problem]
• Remove all occurrences of duplicates from a sorted Linked List [Practice Problem]
• Detect and Remove Loop in a Linked List [Practice Problem]
• Intersection Point in Y-Shaped Linked Lists [Practice Problem]
• Reverse a Doubly Linked List [Practice Problem]
• Detect and Remove Loop in Linked List [Practice Problem]
• Merge two sorted linked lists [Practice Problem]

**Stack

A Stack is a linear data structure in which elements can be inserted and deleted only from one side of the list, called the top. A stack follows the LIFO (Last In First Out) principle.

• Stock Span Problem [Practice Problem]
• Sort a stack using recursion [Practice Problem]
• Implement two stacks in an array [Practice Problem]
• Length of the longest valid substring [Practice Problem]
• Next Greater Element [ Practice Problem]
• Maximum size rectangle binary sub-matrix with all 1s [Practice Problem]

Queue

A Queue is a linear data structure in which elements can be inserted only from one side of the list called the rear, and the elements can be deleted only from the other side called the front. The queue data structure follows the FIFO (First In First Out) principle.

• Find a maximum or minimum for every window size in a given array [Practice Problem]
• Celebrity Problem [Practice Problem]
• Implement Stack using Queues [Practice Problem]
• Circular tour [Practice Problem]
• Snake and Ladder Problem [Practice Problem]
• Reversing a queue using recursion [Practice Problem]

**Searching

Searching Algorithms are designed to check for an element or retrieve an element from any data structure where it is stored.

• Allocate a minimum number of pages [Practice Problem]
• painter’s partition problem [Practice Problem]
• Minimum Number of Platforms Required for a Railway/Bus Station [Practice Problem]
• The square root of an integer [Practice Problem]
• Sort an array according to the order defined by another array [Practice Problem]
• Find the element that appears once [Practice Problem]
• Find the farthest smaller number on the right side [Practice Problem]
• Distribute N candies among K people [Practice Problem]
• Two elements whose sum is closest to zero [Practice Problem]
• Capacity To Ship Packages Within D Days [Practice Problem]
• Kth Missing Positive Number in a Sorted Array [Practice Problem]

**Sorting

The sorting Algorithm is used to rearrange a given array or list of elements according to a comparison operator on the elements

• .Merge two sorted arrays with O(1) extra space [Practice Problem]
• Chocolate Distribution Problem [Practice Problem
• Find a triplet that sums to a given value [Practice Problem]
• Minimum number of swaps required to sort an array [Practice Problem]
• QuickSort [Practice Problem]
• The floor in a Sorted Array [Practice Problem]
• Chocolate Distribution Problem [Practice Problem]
• k largest(or smallest) elements in an array [Practice Problem]
• Sort an array according to the order defined by another array [Practice Problem]
• Overlapping Intervals [Practice Problem]
• Minimum sprinklers required to be turned on to water the plants [Practice Problem]
• Surpasser Count of Each Element in Array [Practice Problem]

Hash

Hashing is a popular technique for storing and retrieving data as fast as possible.

• Find four elements that sum to a given value [Practice Problem]
• Find the first non-repeating character from a stream of characters [Practice Problem]
• Given a sequence of words, print all anagrams together [Practice Problem]
• Number of subarrays having a sum exactly equal to k [Practice Problem]
• Count pairs with a given sum [Practice Problem]Practice Problem
• Check if two strings are k-anagrams or not [Practice Problem]
• Second most repeated word in a sequence [Practice Problem]
• Largest subarray with an equal number of 0s and 1s [Practice Problem]

Heap

Heap is a special case of balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly.

• Heap Sort [Practice Problem]
• Find a triplet in an array whose sum is closest to a given number [Practice Problem]
• Meeting Rooms - Room with Maximum Meetings [Practice Problem]
• Dijkstra's Algorithm [Practice Problem]

**Trees

A tree is non-linear and a hierarchical data structure consisting of a collection of nodes such that each node of the tree stores a value, a list of references to nodes (the “children”).

• Lowest Common Ancestor in a Binary Tree [Practice Problem]
• A program to check if a binary tree is BST or not [Practice Problem]
• Print level order traversal line by line [Practice Problem]
• The maximum difference between a node and its ancestor in Binary Tree [Practice Problem]
• Symmetric Tree [Practice Problem]
• Inorder to Successor in Binary Search Tree [Practice Problem]
• Print BST elements in a given range [Practice Problem]
• Level Order Binary Tree Traversal [Practice Problem]
• Convert a Binary Tree to a Circular Doubly Link List [Practice Problem]
• Convert a given Binary Tree to a Doubly Linked List [Practice Problem]
• Burn the binary tree starting from the target node [Practice Problem]
• AVL Tree [Practice Problem]
• Distribute candies in a Binary Tree [Practice Problem]
• Print a Binary Tree in Vertical Order [Practice Problem]
• Convert a Binary Tree to a Circular Doubly Link List [Practice Problem]
• Balanced Binary Tree or Not [Practice Problem]
• Print Ancestors of a given node in Binary Tree [Practice Problem]

**Graph

A Graph is a non-linear data structure consisting of nodes and edges. The nodes are sometimes also referred to as vertices and the edges are lines or arcs that connect any two nodes in the graph.

• Strongly Connected Components (Kosaraju's Algo) [Practice Problem]
• Prerequisite Tasks [Practice Problem]
• Distance from the Source (Bellman-Ford Algorithm) [Practice Problem]
• Word Boggle - II [Practice Problem]
• Check whether a given graph is Bipartite or not [Practice Problem]
• Find the number of islands [Practice Problem]
• Topological sort [Practice Problem]
• Boggle (Find all possible words in a board of characters) [Practice Problem]
• Program to cyclically rotate an array by one [Practice Problem]
• Flood fill Algorithm – how to implement fill() in paint? [Practice Problem]
• The shortest path to reach one prime to another by changing a single digit at a time [Practice Problem]
• Check whether a given graph is Bipartite or not [Practice Problem]
• Detect cycle in an undirected graph [Practice Problem]

**Dynamic Programming

Dynamic Programming is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming.

• Count All Palindrome Sub-Strings in a String [Practice Problem]
• Count ways to reach the n’th stair [Practice Problem]
• Maximum size rectangle binary sub-matrix with all 1s [Practice Problem]
• Maximum Sum Increasing Subsequence [Practice Problem]
• Count the number of ways to cover a distance [Practice Problem]
• Word Break Problem [Practice Problem]
• Knapsack with Duplicate Items [Practice Problem]
• Coin Change [Practice Problem]
• Subset Sum Problem [Practice Problem]
• Longest Increasing Subsequence [Practice Problem]
• Find if a string is interleaved with two other strings [Practice Problem]
• Minimum number of jumps to reach the end [Practice Problem]
• Count Possible Decodings of a given Digit Sequence [Practice Problem]
• Bell Numbers (Number of ways to Partition a Set) [Practice Problem]
• Coin Change - Count Ways to Make Sum [Practice Problem]