Crafto - Kutumb | Tech Lead | Bangalore

Experience: 7+ Years

Round 1: HLD + DSA

• Scalability related questions
• Given two integer arrays prices and strategy,
  • prices[i] - the price of a given stock on the ith day.
  • strategy[i] - a trading action on the ith day, where:
    • -1 indicates buying one unit of the stock.
    • 0 indicates holding the stock.
    • 1 indicates selling one unit of the stock.

  You are also given an even integer k, and may perform at most one modification to strategy. A modification consists of:
  

  Selecting exactly k consecutive elements in strategy. Set the first k / 2 elements to 0 (hold). Set the last k / 2 elements to 1 (sell). The profit is defined as the sum of strategy[i] * prices[i] across all days. Return the maximum possible profit you can achieve. Note: There are no constraints on budget or stock ownership, so all buy and sell operations are feasible regardless of past actions.

Round 2: Work experience + HLD

• Complex project
• Design feature flag service