Netskope Interview Questions

Note: ensure you read the disclaimer on the previous page reading the accuracy and sourcing of these problems.

Traverse in a Zig Zag

Here's a fun one: can you write a method to return the nodes of a binary tree lessons an intro to binary trees and search trees in a zig zag level order? It should return a multi dimensional array of arrays, with each child array being a level of the tree. That's a mouthful, so here's an...

Difficulty: 6/10

Stock Buy and Sell Optimization

This is a classic technical interview question that I've seen a number of times in real life interviews. Let's say you're given an array of stock prices, with each element being an integer that represents a price in dollars. 10, 7, 6, 2, 9, 4 Each index of the array represents a s...

Difficulty: 5/10

Merge Sorted Linked Lists

Write an algorithm to merge two sorted linked lists and return it as a new sorted list. The new list should be constructed by joining the nodes of the input lists. You may assume the following node definition: js function Node val this.value val this.next null const...

Difficulty: 5/10

Merge Intervals

This is a classic interview question that is used in _a lot_ in technical interviews, frequently in the form of a calendar or meeting management application. As such, we'll also assume the same use case, as it's easier to visualize. Suppose we're given a few arrays, like 1, 4 , 2, 5 , 7,...

Difficulty: 5/10

Merge Two Binary Trees

Merging Two Binary Trees The Problem Statement You are presented with two binary trees. Your task is to merge these trees into a single, new binary tree. ! Merging Binary Trees https: storage.googleapis.com algodailyrandomassets curriculum trees merge two binary trees cover image.png ...

Difficulty: 5/10

Max of Min Pairs

We have an array of length 2 * n even length that consists of random integers. 1, 3, 2, 6, 5, 4 We are asked to create pairs out of these integers, like such: 1, 3 , 2, 6 , 5, 4 How can we divide up the pairs such that the sum of smaller integers in each pair is maximized? ...

Difficulty: 4/10

Reverse Only Alphabetical

Reversing Only Alphabetical Characters in a String ! Visual Diagram https: storage.googleapis.com algodailyrandomassets curriculum easy strings reverse only alphabetical.png The Problem Statement You are provided with a string that's a blend of alphabetic and non alphabetic characters. T...

Difficulty: 3/10

Implement the Trie Data Structure

Suppose you're asked during an interview to design an autocompletion system. On the client side, you have an input box. When users start typing things into the input, it should parse what's been typed and make suggestions based on that. For example, if the user has typed "cat", we may fetch "c...

Difficulty: 7/10

Add Linked List Numbers

We're provided the following two linked lists: 1 2 3 4 and 2 5 8 Each one represents a number in reversed order, so 1 2 3 4 represents 4321 and 2 5 8 represents 852 *note: for an extra challenge, consider if they weren't reversed* . The lists are guarante...

Difficulty: 7/10

Stacks and Queues

The concept of a **stack** is similar to a stack of books or plates, where the last item placed on top is the first item to be removed. In computer science, a stack is a data structure that follows a similar last in, first out LIFO order. Imagine you have a pile of plates, and you want to add mo...

Difficulty: 5/10

Kadane's Algorithm Explained

Kadane's Algorithm is a powerful technique used to solve the Maximum Subarray Problem. This tutorial is designed to guide you step by step through understanding the problem, exploring different solutions, and finally, mastering Kadane's Algorithm itself. Here's what we'll cover: 1. Kadane's Al...

Difficulty: 5/10

Getting to Know Greedy Algorithms Through Examples

In this tutorial, we'll look at yet another technique for finding an optimal solution to a problem. ** Dynamic programming lessons memoization in dynamic programming ** considers all the solutions of a problem and selects the best or optimal one. But despite finding the most efficient solution, t...

Difficulty: 5/10