Pivotal Interview Questions

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

Implement a Binary Search Tree

Let's implement a Binary Search Tree ! Recall that a binary search tree , or a BST , is a binary tree lessons an intro to binary trees and search trees that is ordered via these two properties: 1. The left sub tree of a node has a value less than or equal to its parent node's value. 2. The ...

Difficulty: 6/10

Implement a Hash Map

Arrays are amazing for looking up elements at specific indices as all elements in memory are contiguous, allowing for O 1 or constant time lookups. But often we don't, or can't, perform lookups via indices. Hash maps and hash tables are a way around this, enabling us to lookup via keys instead. ...

Difficulty: 3/10

Traverse a Matrix in Spiral Order

Given an m * n matrix array, can you print all its elements in a spiral order as shown in the figure below? Try to use only O 1 space! Constraints Total elements in the matrix 100000 The values in the matrix ranges from 1000000000 and 1000000000 Expected time complexity :...

Difficulty: 7/10

Product Except Self

If we are given an array of integers, can you return an output array such that each corresponding input's elements returns the product of the input array except itself? This can be hard to explain, so let's take an array: 1, 2, 4, 16 What we want to return is 128, 64, 32, 8 . This is...

Difficulty: 4/10

Longest Substring With No Duplicate Characters

Given a string of characters, can you find the longest substring of the string that has no repeating characters? An example is shown below: js lengthOfLongestSubstring "abracadabar" 4 because it is 'brac' Constraints Length of the string 100000 The string ...

Difficulty: 5/10

Delete Nodes From A Linked List

Now that we've implemented a linked list challenges implement a linked list , can you write a method that will delete all nodes of a given value? You're given the following standard structure as the definition of a linked list node: js class LinkedListNode constructor val ...

Difficulty: 4/10

Levenshtein Edit Distance

An edit distance is a way to quantify how different two strings are. This is calculated using **the minimum number of transformations to turn one string to another**. The transformations include insertion , deletion , and substitution . So when comparing two identical strings, say cat and ca...

Difficulty: 7/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

Array Intersection

As we ease our way into the course, we'll want to start with the basic data structures and their operations. However, don't be fooled how fundamental these things are! Interviewers will often test you on things that are deceptively easy. We saw this in Reverse a String challenges reverse a stri...

Difficulty: 2/10

Introduction to Data Cleaning and Wrangling

The Importance of High Quality Data In the modern business landscape, data is often considered the lifeblood of an organization. Industries like banking, insurance, retail, and telecommunications heavily rely on data to drive performance and gain a competitive edge. The Cost of Poor Data ...

Difficulty: 5/10

IT and Cybersecurity Interview Questions

IT and Cybersecurity Interview Questions As we navigate the complexities of the digital revolution, the realms of Information Technology IT and cybersecurity have emerged as pivotal foundations across diverse sectors. The ongoing digital metamorphosis of businesses, paired with the dynamic lif...

Difficulty: 5/10

Understanding the CAP Theorem

**Objective**: In this lesson, we'll cover this concept, and focus on these outcomes: You'll learn what the CAP theorem is. We'll show you how it applies to programming interviews. In the realm of distributed database systems, there are several principles and theories that dictate their d...

Difficulty: 5/10

Interview Reports

What's the interview process like for a software engineer at Pivotal Cloud ...

Access Denied...

People at Pivotal Say

This information was sourced from reviews originally posted on Glassdoor.

Surrounded by a ton of very smart people

Highly collaborative work environment at its core

Pivotal opened doors for me I never knew were there. It was a family environment, full of encouragement, quality feedback, empathy, hard work and play. I miss it every day!