Skip to content
dronacharya.ai

Tower Research Capital

InternshipSoftwareQuant and finance

Built from 3 candidate reports with 7 first-hand accounts, covering 2026-27, 2025-26, 2024-25.

Hiring process

Roles: Core Intern, Core Engineering Intern
  1. 1

    Online test

    Online assessment: MCQs plus two coding questions
    HackerRank60 min12 questions
    SectionQsTopics
    MCQ10OOP, OS, CN, DBMS, output prediction
    Coding2trees, binary search, dynamic programming, sliding window

    OOP · OS scheduling · computer networks · trees · binary search · dynamic programming

    Question count differs slightly (9+2, 10+2); most common is 12. MCQs reported to repeat across other companies' HackerRank tests.

  2. 2

    Technical interview

    Technical interview round 1
    offline

    trees · DP · tries · hashing · system design · OS · DBMS · semaphores · ACID · STL internals

    Length reported from 30 to 90 min; classroom setting. Heavy resume and project drilling; one account got no DSA at all.

  3. 3

    Technical interview

    Technical interview round 2
    offline

    system design · OOP abstraction · project deep dive · streaming data · database concurrency · ACID · vptr · overriding

    One account had four rounds in total (round 2 repeated, final round turned out technical) and 3 interview rounds were reported by that candidate. Another received an offer right after round 2 with no HR round.

  4. 4

    HR interview

    Behavioural questions

    Role preference, why this firm, willingness to work outside past tech stack. Not a separate round for most.

Advice from candidates

36 pieces of advice, in their own words. Names removed.

  • I suggest that you try to pass as many test cases as possible. There are partial marks for every testcase that you pass, hence, code smartly.

    online_test · 2024-25

  • Some parts of the code were minimized, and hence hidden. One of these had a bug. HENCE, ALWAYS MAXIMIZE ALL SECTIONS.

    online_test · 2024-25

  • You might know the definition, but you must know the technical term.

    interview · 2024-25

  • This was totally unexpected and hence, speak your thoughts loudly.

    interview · 2024-25

Loading the other 32…

Question patterns reported

The kind of problem, not the problem itself. Our practice questions are written to match these patterns.

  • Codingunion-find with number theory
  • Codingpriority queue greedy
  • Coding2D DP
  • Codingfix hidden bug in partially collapsed C++ code
  • Technicalwhere to insert next node in a complete binary tree, with changing constraints
  • Technicalfind first time a price crosses a threshold within a range
  • Technicaldesign a binary tree class with access control
  • Technicaldescribe what happens when a post is sent on a social network
  • Technicaldesign a vending-style machine with classes
  • Codingsimulate operations on a tree efficiently using sets
  • Codingmaximise grid path under constraints, DP
  • Codingcount distinct left/right step sequences reaching a target position
  • Technicalcycle finding in functional graph with follow-ups
  • Technicalfind node reachable from all others in adjacency matrix by elimination, linear time
  • Onlinebinary search on answer, minimise tree height with limited subtree reattachments
  • OnlineDP choosing row-end elements across rows with a total pick budget
  • Technicalcount partitions of n items into k non-empty groups
  • Technicalgrid spread BFS pseudocode
  • Technicalcount prefix-matching numbers using trie
  • Technicaltree cut count for even-sized components
  • Technicalsubtree-size based max cost on tree
  • Technicalexchange design: order book with order types
  • Technicaltoy shell and file system design
  • TechnicalB-tree versus B+ tree for a course database