Graphs Interview Questions

Just wrapped up my interviews for an early career role at Google. I went in with minimal preparation, having done around 30 problems, mostly on strings and arrays. I didn’t touch graphs, trees, or DP,

I recently appeared for google phone screen after around 2 months of prep. Recently my friend joined Google and he shared phone screen round should be easy, but I really got hard graph (bfs+union find

I recently got an opportunity to give an interview at Crowdstrike for a SDE 2 role. it was a virtual interview process. I had earlier applied to crowdstrike for multiple roles. This time I received a

Position: Senior SDE-Android Location: Bangalore I\'ve giving multiple interviews in past 3-4 months and I must say that interviewers from square were among the best ones and the interview process seems most...

I got somewhat medium but bit harder to come up solutions for my telephone round for square. There were three parts 1. Create 2 d array of the connect four grid. Example...

Initial Tech Screen Question was: https://leetcode.com/problems/rotting-oranges/

The first question involved graph paths, requiring me to determine if a path constituted a Hamiltonian path. This helped me become more familiar with the logic of using a HashMap to build an adjacency

Technical Assessment Date: 10-01-2026 Role: Program Analyst Early Careers 2 DSA questions and 1 SQL query was asked 1 was just a variant of Multisource BFS 2 was damn string manipulation SQL query was

R1 2 hour coding assignment. Question at the end. ### R2 2 hour interview Q1: `You are given a graph of cities with name as integer, and an start city. At minute 0, an infection starts from the ci

Recently went through the interview process for a Senior Software Engineer role. Sharing my experience in case it helps others preparing. TL;DR: 4 rounds – System Design / LLD (60 min), DSA (60 min),

I recently interviewed with **Graviton Research Capital** for the Software Engineer role. The first round consisted of two problem-solving questions focusing on **data structures and graph theory**. T

Hi everyone, I recently went through the interview process for a **Senior Software Engineer - Frontend Developer role at ServiceNow**, and wanted to share my experience. --- ## Round 1 (DSA + Frontend

I interviewed for a senior SDE position. The process was quick, taking about a week. It included a recruiter call, a headhunter interview, and three virtual vos (VA) rounds (DSA, API design, and syste

There are three questions in total, all very simple. Two are BFS questions, and the other is to simulate a character moving on a 2D grid.

Phone Interview: Outputting a matrix diagonally, not difficult. The first question was finding the shortest distance between two points in a graph. I mentioned BFS, but was asked if it could be faster

I had my interview at the beginning of the month. Their HR and the people arranging the interviews were a bit chaotic. Initially, the HR call and the preparation materials stated one coding and one co

The Challenge: Parallel Courses You are given an integer `n`. This number tells you there are `n` courses you need to take, labeled from `1` to `n`. You are also given a list called `relations`. Ins

Reconstruct Itinerary ## Problem Requirements You are given a list of airline `tickets`. Each ticket shows where a flight starts and where it ends, written as `[from, to]`. Your task is to arrange t

**Candidate Profile** * **Experience:** 5 years in the finance and insurance sectors. * **Gap:** One-year career break due to medical reasons. **Interview Breakdown** * **Round 1 (Online Assessment):*

Applied on Nov 2nd week through referral Recruiter reached out to me after couple of days and forwarded my profile to another team Received call after couple of weeks to schedule an Technical intervie

1. OA Round. 2. PS Round: Q1. Minimum length subtring with k distinct characters Q2. Multi source BFS problem. 3. PS Round: Q1. Coin and Energy problem of Hackerrank Q2. Shortest path in an undirected

I have recently given the ZScalar Sr Staff Engineer and it was really bad experience. They asked me DSA Hard leet code problem A transformation sequence from word beginWord to word endWord using a dic

I am a 2024 passout and recently appeared for interviews in Nutanix for their MTS-1 Role. Background - SDE I at US Core Bank (Recently switched from an US Investment Bank) YoE - 1.5 Years I applied vi

Just attempted Navan OA. Read on glassdoor their interview process they asked egregiously difficult question given their pay band. The OA is 2 hours long. 2 leetcode in Java and 1 SQL question. Recrui

LeetCode #207: Course Schedule. Difficulty: Medium. Topics: Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort. Asked at Nvidia in the last 6 months.