Hudson River Trading Interview Guide

Showing 3 of 9 questions

Ranking

A question's ranking corresponds to how commonly it's asked by Hudson River Trading. The higher the ranking, the more likely you'll encounter it in a Hudson River Trading interview.

Question

Frequency

Difficulty

Add Edges to Make Degrees of All Nodes Even

You're given a graph; your goal is to add edges to it so that every node has an even degree. Find the minimum number of edges to add to achieve this.

Graphs

Very likely

If you have a Hudson River Trading interview, it's very likely that you will get this question

Hard

#1. Add Edges to Make Degrees of All Nodes Even

Hard

You're given a graph; your goal is to add edges to it so that every node has an even degree. Find the minimum number of edges to add to achieve this.

Graphs

This question is very likely to be asked in your Hudson River Trading interview

Longest Path With Different Adjacent Characters

Find the longest path in a tree where no two adjacent nodes on the path have the same character. The tree is defined by parent-child relationships and each node has an associated character.

TreesDepth-First Search

Somewhat likely

If you have a Hudson River Trading interview, you might get this question

Hard

#2. Longest Path With Different Adjacent Characters

Hard

Find the longest path in a tree where no two adjacent nodes on the path have the same character. The tree is defined by parent-child relationships and each node has an associated character.

TreesDepth-First Search

This question is somewhat likely to be asked in your Hudson River Trading interview

Maximum Score From Grid Operations

You are given a grid of numbers. Find the maximum possible score by traversing the grid, starting from the top-left cell and ending at the bottom-right cell, following specific movement rules.

ArraysDynamic Programming

Somewhat likely

If you have a Hudson River Trading interview, you might get this question

Hard

#3. Maximum Score From Grid Operations

Hard

You are given a grid of numbers. Find the maximum possible score by traversing the grid, starting from the top-left cell and ending at the bottom-right cell, following specific movement rules.

ArraysDynamic Programming

This question is somewhat likely to be asked in your Hudson River Trading interview

Explore Interview QuestionsTaro 75 Google Interview Questions Meta Interview Questions Amazon Interview Questions Apple Interview Questions Netflix Interview Questions

Explore Interview ExperiencesOpenAI Interview Experiences Anthropic Interview Experiences Perplexity Interview Experiences Windsurf Interview Experiences Mistral AI Interview Experiences

ProductBecome An Affiliate Great Discussions Perks Topics

CompanyBlog Privacy Policy Terms & Conditions Support