← Back to Directory

Block

Large Enterprises

Screna has 9 Block interview write-ups. The most reported round is the technical phone screen (6).

9 interview notes · updated Jul 2026

Block·Data Scientist·Technical Phone Screen

Jun 2026
Block (Square) data scientist technical screen, basically one long coding problem about graph traversal on a referral dataset. The question had a lot of moving parts and I'm still not sure I nailed the complexity justification.
  • Given a directed referral graph loaded from a CSV (up to 1 million users, nullable referred_by, possible duplicates and cycles), implement a function that returns the referral chain from the earliest ancestor down to a given user. If a cycle is detected on the path, return both the cycle nodes in encounter order and the acyclic prefix leading into it.
  • Compute root_ancestor and chain_depth for every user in O(n) time and O(n) space without recomputing paths from scratch for each user. Justify your complexity.
  • Return the top 3 longest valid acyclic chains, with ties broken first by smaller root ancestor ID and then lexicographically by the full chain list.
  • Describe and implement preprocessing for the CSV input: deduplicate rows keeping the earliest seen parent when conflicts exist, normalize null or empty referred_by values, handle referred_by values not present in the user list by treating them as external roots, and flag self-referrals.
  • Write minimal unit tests covering an acyclic chain, a self-cycle, and a two-node cycle using the provided example rows.

“This was the core of the whole interview.”

View Post

Block·Software Engineer·Technical Phone Screen

Jun 2026
Square SWE interview that was basically one long graph problem broken into three escalating parts. The setup was clean but by part three I was definitely scrambling to keep the BFS logic straight while also talking through it out loud.
  • Design a class to record transactions between pairs of customers and answer whether two customers have ever been part of the same connected component in the transaction graph.
  • Extend your solution to return everyone reachable from a given customer through any chain of transactions, excluding the customer themselves.
  • Further extend the network query to accept a degree limit, returning only customers within at most N hops from the given person.

“The union-find angle came to me pretty fast, which was good.”

View Post

Block·Software Engineer·Technical Phone Screen

Jun 2026
Square coding interview, one question about transaction graph lookups. Pretty focused and not too long, but the problem had some interesting design decisions hiding under the surface.
  • Design a class that processes a stream of transactions between customers and supports a query to check whether two specific customers have ever directly transacted with each other.

“My first instinct was a hashmap where each customer maps to a set of everyone they've transacted with.”

View Post

Block·Software Engineer·Onsite - Product Sense / Strategy

Jun 2026
PMM interview at Square, one question about launching a new feature for their salon product. Pretty open-ended and I wasn't totally sure how deep they wanted me to go on execution vs. strategy.
  • You're a product marketing manager. Walk me through how you'd launch a new waitlist appointment feature for a salon business.

“I started with audience segmentation and kind of rambled for a bit before pulling it together around positioning and channel strategy.”

View Post

Block·Software Engineer·Onsite - Behavioral / Leadership

Jun 2026
Behavioral round at Block for an EM role, just the one question but they really sat with it.
  • Tell me about the most effective team you've led. What made them effective, and what did you do to help get them there?

“I went straight into a story about a team I was proud of, but I spent too long on the 'what made them great' part and barely got to my actual role in it.”

View Post

Block·Software Engineer·Technical Phone Screen

Jun 2026
Square coding interview, one question about extending a graph traversal method. Pretty focused session, no fluff.
  • You have a method that finds all customers connected in a network. Modify it to accept a depth parameter n, and return only customers within n degrees of separation from a given starting customer using BFS.

“BFS with a depth limit is something I'd done before but I fumbled the layer-tracking part initially.”

View Post

Block·Product Manager·Onsite - Product Sense / Strategy

May 2026
PM interview at Square with a strategy question about a staff training product they'd recently shipped. One question, pretty open-ended, felt like they wanted to see how you think about growth levers rather than hear a perfect answer.
  • Square recently launched a product that helps sellers train their staff. How would you grow its revenue 5x over the next year?

“I went straight to acquisition and kind of ignored monetization depth, which in hindsight was a mistake.”

View Post

Block·Software Engineer·Technical Phone Screen

May 2026
Square coding interview, graph traversal problem built on top of a transaction tracking system they had you extend. Pretty clean problem once you saw it for what it was.
  • Given an existing customer transaction tracker, implement a method that takes a customer and returns all customers reachable through any chain of transactions, essentially finding the connected component for that customer in the transaction graph.

“Took me a second to see it as a graph problem.”

View Post

Block·Data Scientist·Technical Phone Screen

Apr 2026
SQL-heavy technical screen for a DS role at Block. Five questions, all written SQL, centered on a referral/orders schema. No behavioral stuff at all, just pure query writing under pressure.
  • Given a referrals and orders table, write a query that returns, for each referrer, the count of distinct referred users, the count of those who placed an order in the last 7 days, and total revenue in that window. Referrers with zero buyers should still appear.
  • Find all users who appear as referred_user_id in the referrals table but have placed zero orders on or before today. Use a LEFT JOIN to orders and HAVING to enforce the zero-order condition.
  • For each country, among users who were referred, compute the number of referred users, the number who bought something on or before today, and the conversion rate rounded to two decimals. Countries with zero referred users should be excluded, but countries with zero buyers should be included.
  • The business asks you to filter metrics to country='UK', but the data uses 'GB'. Show how you would first surface the actual values in the country column before writing the real query, and explain in a comment why a naive WHERE country='UK' is dangerous.
  • You're in an interview where only the interviewer can run queries. What are the first two exploratory SELECTs you'd ask them to execute before attempting the main questions?

“The LEFT JOIN part is what trips people up.”

View Post