Checkout.com Interview Questions

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

Linked List to Binary Search Tree

We're given a sorted singly linked list that is, a linked list made of nodes with no pointers to the previous node where the elements are already arranged in ascending order. js 9 2 3 5 9 Linked List Node Definition: function Node val this.val val this...

Difficulty: 7/10

K Largest Elements From List

We're given a list or array of numbers, like the following: const nums 5, 16, 7, 9, 1, 4, 3, 11, 2 Can you write an algorithm to find the k largest values in a list of n elements? If k were 3 , we'd want the three largest numbers returned. The correct logic would return 16, 11, 9 ....

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

Binary Tree Inorder Traversal

Can you write a function to traverse a binary tree **in order**, and print out the value of each node as it passes? 4 5 6 The example would output 4, 6, 5 since there is no left child for 4 , and 6 is visited in order before 5 . The definition of a tree node i...

Difficulty: 3/10

Implement a Graph

Since a graph lessons simple reference to graphs is one of the more difficult data structures to conceptualize in a programmatic 2D manner, let's go ahead and implement it! We'll go with an adjacency list version. Note that there's also the adjacency matrix method which we will cover later....

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

Identical Trees

Can you write a function to see if two binary trees are identical? 1 1 2 3 2 3 The above two trees share the same structure in terms of shape and location of each parent nodes' children. Additionally, each corresponding nodes at every posit...

Difficulty: 4/10

Creating a Text Editor

**Unlock Your Full Potential with AlgoDaily!** We hope you're enjoying this course. At AlgoDaily, our aim is to transform complex coding challenges into engaging, bite sized lessons. And while our free lessons give you a glimpse of this transformative experience, there's so much more in store. ...

Difficulty: 5/10

Dynamic Programming

...

Difficulty: 5/10

Fenwick Tree Query Operations

What is a Fenwick Tree? A Fenwick Tree, also known as a Binary Indexed Tree BIT , is a data structure that allows efficient querying and updating of cumulative sums of elements in an array. It was invented by Peter Fenwick in 1994 and is commonly used in computational geometry, graph algorith...

Difficulty: 5/10

Object-Oriented Programming in C#

Introduction to Object Oriented Programming Welcome to the world of Object Oriented Programming OOP ! In this lesson, we will provide an overview of OOP concepts and explain why they are important in C . What is Object Oriented Programming? Object Oriented Programming is a programming pa...

Difficulty: 5/10

Docker

Introduction to Docker Docker is an open source platform for containerization that allows developers to package their applications and dependencies into portable containers. These containers are lightweight, isolated, and can run on any system that has Docker installed. Docker provides a clien...

Difficulty: 5/10

Interview Reports

32 Checkout.com Interview Questions (with Answers)...

Practice 32 Checkout.com Interview Questions with professional interview answer examples with advice on how to answer each question. With an additional 64 professionally written interview answer examp...

Checkout.com Software Engineer Interview Questions | Glassdoor...

15 Checkout.com Software Engineer interview questions and 15 interview reviews. Free interview details posted anonymously by Checkout.com interview candidates.

People at Checkout.com Say

This information was sourced from reviews originally posted on Glassdoor.

Checkout made me realise what a truly great place to work looks like. One of the key reasons why they are successful is because of its people who are passionate, caring and trustworthy.

The company was good enough to offer me a sabbatical so that I could pursue a passion of mine but I chose to leave the company voluntarily as I wasn't sure how long it would take for me to achieve my goals.

Checkout is the epicenter for me to learn and to grow career wise. There no better place to grow as a software engineer and working in a team where there no discrimination in terms of knowledge and skills.

I started working at Checkout while I was in my last year of study in an Engineering School in France. So far it's been a great experience to work for the company and I am now a full-time employee.