https://whop.com/f-7b34/techsprint-interview-collective?a=boudhmani

TechSprint Interview Collective is an async peer-practice hub. No hire-rate claims yet. These rules apply to founding members.

1. Be specific. Share role, target company type (FAANG vs startup vs remote-first), and language (Python/JS/Java/Go).

2. No leaks of live interview questions from companies you just interviewed with.

3. Critique the work, not the person. Resume reviews stay in-thread.

4. Use the weekly puzzle thread for solutions. Hide brute-force spoilers behind a first-attempt note.

5. Mock-interview reviews: use the rubric (problem framing, complexity, tests, communication, tradeoffs). Score 1-5 with one example.

6. No recruiting spam. Affiliate or job posts go only in a weekly jobs thread.

7. Timezone respect: replies within 48 hours is the founding-member bar.

Moderation: founder reviews flagged posts daily. Repeat leaks or harassment = removal.

Use this checklist in async mock design reviews. Score 1-5 on each. No customer results claimed.

Clarify

• Users, QPS, read/write ratio, consistency vs availability, latency SLO, data size, mobile vs web.

Sketch

• Clients, API gateway, services, data stores, cache, queue, CDN. Name 1 bottleneck.

Data

• Entities, keys, indexes, sharding key, retention.

Scale

• Hot keys, cache invalidation, idempotency, retries, backpressure.

Reliability

• Failure of one AZ, leader election, poison messages, observability (metrics, traces, alerts).

Tradeoffs

• SQL vs NoSQL, sync vs async, push vs pull. Write why, not just what.

Post a 1-page design for: URL shortener, news feed, or rate limiter. Peers reply with the rubric, not a rewrite.

Week 1: arrays, hashing, two pointers. Practice async. Post your approach, then complexity, then code.

1. Pair sum under SLA. Given integers and target T, return any pair that sums to T. Follow-up: stream of numbers, memory cap.

2. Anagram groups for tickets. Group strings that are anagrams. Follow-up: Unicode and case.

3. Container with most water. Heights array, max area. Follow-up: why two pointers beats nested loops.

4. Longest substring without repeat. Follow-up: k distinct characters.

5. Product of array except self. No division. Follow-up: O(1) extra space.

Template for replies: brute idea, optimized idea, time/space, edge cases (empty, negatives, duplicates), test cases.

This is founding-member curriculum, not a guarantee of interview outcomes.