Katkat

Company

Bnsf interview questions

4 practice questions in the style of Bnsf's interviews, covering Software Engineering Fundamentals, Coding & Algorithms.

Questions4

0 easy3 medium1 hard

Your progress0/4

Bnsf interview questions by the numbers

Last updated

Katkat has 4 Bnsf interview questions. The largest topics are Coding & Algorithms (50%) and Software Engineering Fundamentals (50%). By difficulty: 75% medium and 25% hard. The most common round is Online Assessment (50%). Frequent concepts include Backtracking, Binary Indexed Tree, Binary Search and Bitmask DP.

Topics

Difficulty

  • Medium75% · 3
  • Hard25% · 1

Interview rounds

  • Online Assessment50% · 2
  • Onsite25% · 1
  • Technical Screen25% · 1

Roles

  • Software Engineer100% · 4

Frequent concepts

  • Backtracking25% · 1
  • Binary Indexed Tree25% · 1
  • Binary Search25% · 1
  • Bitmask DP25% · 1
  • Branch and Bound25% · 1
  • Dynamic Programming25% · 1

Showing 1–4 of 4 results

  • Implement CRUD API and testsMedium

    This question evaluates proficiency in implementing RESTful CRUD APIs, correct HTTP semantics and content negotiation (text/plain request bodies with JSON responses), robust error handling, and the ability to design unit tests from a function specification to cover edge cases and failure modes.

    BnsfSoftware EngineerSoftware Engineering FundamentalsOnline Assessment
  • Implement a rail freight quote API service layer and scale it for slow dependenciesMedium

    Given a REST API requirements document for a rail freight quote endpoint that depends on other services and a database, write the service-layer logic. Then design an architecture that keeps the endpoint fast and reliable under heavy traffic when its dependencies are slow, covering caching, timeouts, fallbacks and asynchronous quotes.

    BnsfSoftware EngineerSoftware Engineering FundamentalsTechnical Screen
  • Maximize Valid Trains from Shared EquipmentHard

    Form the maximum number of valid trains from a shared pool of locomotives and railcars, breaking ties by maximizing total railcar length.

    BnsfSoftware EngineerCoding & AlgorithmsOnsite
  • Minimize Car Removals for a Two-Car BridgeMedium

    Determine the minimum number of cars to remove from a queue so that no single retained car nor any adjacent retained pair exceeds a bridge's weight limit.

    BnsfSoftware EngineerCoding & AlgorithmsOnline Assessment

Bnsf interview experiences

All 1 →
  • One-Hour Technical Screen, Coding Then DesignBNSF · Software Engineer · Technical Screen · Sep 2026

    The technical interview was one hour, split into two parts: the first half was writing a program, the second half was design. The problem was provided through a markdown file. It was a requirements doc for a REST API, roughly a price quote (rate inquiry) endpoint for some kind of railway freight, with other dependent services and database access operations involved. I was asked to write a sample…

More companies