Energy Aspects Software Engineer Interview Guide

The 60-second brief

A Software Engineer at Energy Aspects plays a pivotal role in maintaining the technical infrastructure that supports the company’s specialized energy intelligence products. You are responsible for building, automating, and refining systems that process complex data, ensuring that the firm’s analysts and clients receive accurate, timely insights. This role is inherently cross-functional, requiring you to bridge the gap between raw technical requirements and the high-stakes world of energy market analysis. You will contribute to a fast-paced environment where precision and efficiency are paramount. Whether you are working on automation tasks or managing database architecture, your work directly impacts the reliability of the tools used to navigate global energy markets.

This guide is scoped to a Software Engineer candidate at Energy Aspects.

Focus areas

• Python
• Python Debugging
• SQL

The Energy Aspects interview process

Energy Aspects candidates report 4 rounds over 3-5 weeks. The stages below are what candidates describe, not a published process.

HR Screening Call

Initial call to assess candidate's background and fit for the role.

What to demonstrate

• Initial call to assess candidate's background and fit for the role
• Depth in Python

How to prepare

• Be able to walk your CV end to end in two minutes, and say why this company specifically.
• Have your salary expectations, notice period and location constraints ready, and ask for the rest of the loop in writing.

Technical Rounds

One or more rounds focusing on technical skills and real-world engineering scenarios.

What to demonstrate

• One or more rounds focusing on technical skills and real-world engineering scenarios
• Depth in Python

How to prepare

• Answer aloud and timed: How do you effectively implement and use the @staticmethod decorator?
• Answer aloud and timed: Can you walk me through your process for debugging a complex Python script?

Coding Assignment

Potential coding task to evaluate practical coding abilities.

What to demonstrate

• Potential coding task to evaluate practical coding abilities
• Depth in Python

How to prepare

• Answer aloud and timed: How would you perform a simple SQL JOIN across two distinct tables?
• Answer aloud and timed: Describe the most complex logic you have solved regarding RDBMS architecture.

Technical Session

Session involving multiple engineers to assess technical capabilities in depth.

What to demonstrate

• Session involving multiple engineers to assess technical capabilities in depth
• Depth in Python

How to prepare

• Answer aloud and timed: Can you write a SQL query to solve a medium-level data aggregation problem?
• Answer aloud and timed: How do you determine the Big O complexity of a given algorithm?

Where candidates lose points

Be direct

When asked a question, get to the core of the answer immediately. Energy Aspects interviewers appreciate brevity and clarity.

Own your CV

Be prepared to discuss any project or technology you have listed in your resume in extreme detail. If you list it, be ready to defend it.

Ask meaningful questions

Use the time at the end of the interview to ask about the team's current technical challenges. It shows you are interested in the actual work, not just the job title.

If you are asked a question about a technology you are less familiar with, be honest about your experience level

Interviewers respect integrity and a willingness to learn over feigned expertise.

Questions & practice

How do you determine the Big O complexity of a given algorithm?

Medium · Algorithms & System Design

Approach

1. Restate the input: its shape, its size, and what is guaranteed about it.
2. Name the brute-force solution and its complexity before improving on it.
3. Choose the data structure from the access pattern, not from familiarity.
4. State the target complexity and say which constraint rules the naive version out.

Follow-up

• How does this change if the input no longer fits in memory?
• What is the worst case, and how likely is it on real data?

Can you solve a graph-based problem, such as a social media connection challenge?

Medium · Algorithms & System Design

Approach

1. Restate the input: its shape, its size, and what is guaranteed about it.
2. Name the brute-force solution and its complexity before improving on it.
3. Choose the data structure from the access pattern, not from familiarity.
4. State the target complexity and say which constraint rules the naive version out.

Follow-up

• How does this change if the input no longer fits in memory?
• What is the worst case, and how likely is it on real data?

Diff a projection against the primary without per-row point reads

Hard · reconciliation · range hashing · throttling

The listing projection has drifted and some rows show a stale version. The primary holds 40,000,000 resource rows across 12,000 tenants while serving 1,200 writes and 14,000 reads per second. The obvious repair, reading each resource row and comparing its version against the projection, is correct and would eventually finish. Explain precisely why it is unacceptable here, then give a diff that finds the differing rows, state its complexity, and make it safe to run against a live primary. Replication lag is usually under 100 ms and is not bounded.

Approach

1. Quantify the naive cost rather than calling it slow: 40,000,000 point reads at even 0.5 ms each is over five hours serialised, and the only lever is concurrency, which is exactly what you cannot spend. The primary's pool is sized for the write path, and 40,000,000 random reads evict the buffer cache that sustains the 85 percent cache hit rate, so the audit degrades the system it is auditing.
2. Replace random access with one ordered pass per side. Both sides can be read in (tenant_id, resource_id) order, which is a sequential scan on each and a merge join in O(n) time and O(1) memory. For a dense diff that is the whole answer, and it reads the primary once instead of 40,000,000 times.
3. For the expected sparse case, compare range hashes instead of rows: partition the key space, compute per range an order-independent aggregate over hash(resource_id, version), compare aggregates, and descend only into ranges that differ. With d differing rows and branching factor B, at most d ranges mismatch per level, so the drill-down examines O(d log_B(n/d)) ranges and reads full rows only in mismatching leaves.
4. Aggregate with a sum modulo 2^64 or a multiset hash, never XOR. XOR is order-independent but self-cancelling, so two rows wrong in the same way, or a row duplicated on one side, leave the range aggregate matching and the range is declared clean.

Follow-up

• The diff reports 900 stale rows. How do you decide between patching those rows and rebuilding the projection from resource_revision?
• Same job, but the projection lives in a search index that cannot be scanned in key order. What changes?

How would you perform a simple SQL JOIN across two distinct tables?

Medium · Database & SQL

Approach

1. Name the grain you start from and join outward from it.
2. Check whether any join is one-to-many before aggregating, or the sums inflate.
3. Say which index the query would use, and what makes it unusable.
4. Handle the rows that do not match: that is usually the actual question.

Follow-up

• How does the query change if that join becomes one-to-many?
• What happens to this when the table is ten times larger?

Can you write a SQL query to solve a medium-level data aggregation problem?

Medium · Database & SQL

Approach

1. Name the grain you start from and join outward from it.
2. Check whether any join is one-to-many before aggregating, or the sums inflate.
3. Say which index the query would use, and what makes it unusable.
4. Handle the rows that do not match: that is usually the actual question.

Follow-up

• How does the query change if that join becomes one-to-many?
• What happens to this when the table is ten times larger?

Can you explain what a Python module is and how it functions?

Medium · Python Proficiency

Approach

1. Clarify what is being asked and what a complete answer contains.
2. State your assumptions explicitly before working the problem.
3. Say what you would check first and why it is the highest-information step.
4. Work from the requirement backwards to the design.

Follow-up

• What assumption would you test first?
• How would you know your answer was wrong?

What are decorators, and in what scenarios would you utilize them?

Medium · Python Proficiency

Approach

1. Clarify what is being asked and what a complete answer contains.
2. State your assumptions explicitly before working the problem.
3. Say what you would check first and why it is the highest-information step.
4. Work from the requirement backwards to the design.

Follow-up

• What assumption would you test first?
• How would you know your answer was wrong?

How do you effectively implement and use the @staticmethod decorator?

Medium · Python Proficiency

Approach

1. Clarify what is being asked and what a complete answer contains.
2. State your assumptions explicitly before working the problem.
3. Say what you would check first and why it is the highest-information step.
4. Work from the requirement backwards to the design.

Follow-up

• What assumption would you test first?
• How would you know your answer was wrong?

Describe the most complex logic you have solved regarding RDBMS architecture.

Medium · Database & SQL

Approach

1. Fix the scope first: who calls this, how often, and what they do when it fails.
2. Name the read and write paths separately; they rarely have the same bottleneck.
3. Choose a partition key and say what query it makes expensive.
4. State the consistency you need, and where you are willing to be stale.

Follow-up

• What breaks first when traffic grows ten times?
• How does this behave when that dependency is down for an hour?

How do you approach optimizing code to ensure it meets performance requirements?

Medium · Algorithms & System Design

Approach

1. Fix the scope first: who calls this, how often, and what they do when it fails.
2. Name the read and write paths separately; they rarely have the same bottleneck.
3. Choose a partition key and say what query it makes expensive.
4. State the consistency you need, and where you are willing to be stale.

Follow-up

• What breaks first when traffic grows ten times?
• How does this behave when that dependency is down for an hour?

Can you walk me through your process for debugging a complex Python script?

Medium · Python Proficiency

Approach

1. Establish what changed and when, before forming any theory.
2. Pick a bisection that eliminates candidates whichever way it turns out.
3. Check the instrumentation before believing the symptom.
4. Separate the trigger from the cause; the deploy is rarely the bug.

Follow-up

• What would you look at first, and what would it rule out?
• How would you tell a cause from a coincidence here?

Suggested practice checklist

Built from the rounds and topics Energy Aspects candidates report.

Day 1 — Map the Energy Aspects loop

• Write out the reported sequence: HR Screening Call, Technical Rounds, Coding Assignment, Technical Session.
• For each round, write one sentence on what it is judging, from the description above, and mark the one you are least ready for.

Deliverable: A one-page map of the 4 reported rounds, with the weakest marked.

Day 2 — Work Python

• Spend the session on Python, which Energy Aspects candidates report being tested on.
• Write one worked example in Python and time yourself on it.

Deliverable: One timed worked example in Python.

Day 3 — Work Python Debugging

• Spend the session on Python Debugging, which Energy Aspects candidates report being tested on.
• Write one worked example in Python Debugging and time yourself on it.

Deliverable: One timed worked example in Python Debugging.

Day 4 — Work SQL

• Spend the session on SQL, which Energy Aspects candidates report being tested on.
• Write one worked example in SQL and time yourself on it.

Deliverable: One timed worked example in SQL.

Day 5 — Answer out loud: Python Proficiency

• Answer aloud, timed: Can you explain what a Python module is and how it functions?
• Answer aloud, timed: What are decorators, and in what scenarios would you utilize them?

Deliverable: Spoken answers to 2 reported Python Proficiency question(s), under time.

Day 6 — Answer out loud: Database & SQL

• Answer aloud, timed: How would you perform a simple SQL JOIN across two distinct tables?
• Answer aloud, timed: Describe the most complex logic you have solved regarding RDBMS architecture.

Deliverable: Spoken answers to 2 reported Database & SQL question(s), under time.

Day 7 — Answer out loud: Algorithms & System Design

• Answer aloud, timed: How do you determine the Big O complexity of a given algorithm?
• Answer aloud, timed: Can you solve a graph-based problem, such as a social media connection challenge?

Deliverable: Spoken answers to 2 reported Algorithms & System Design question(s), under time.

Behavioural preparation

Behavioural rounds judge the decision you made and what it cost.

Argue against a design, lose, and commit anyway

Medium · disagreement · service boundaries · decision records

Describe a design you argued against and lost. State the failure you predicted as a named mechanism, not a feeling about complexity: two services that would need one transaction, a projection with no rebuild path, a write path with no idempotency key. Say what evidence you brought, what the decision maker weighed instead, and what you did after the decision was made: what you instrumented, what you wrote down, and whether the prediction came true. Five minutes.

Approach

1. State the prediction in falsifiable form up front: the mechanism, the condition that triggers it, and the observable outcome. A prediction that cannot be checked also cannot be credited to you later.
2. Show the evidence you had at the time and label each piece honestly as measured, analogous, or intuition. Keeping the intuition is fine; disguising it as data is the thing that erodes your standing in the next argument.
3. Represent the opposing case at full strength, including the constraint you did not control: a fixed date, a team boundary, or the fact that the decision was cheap to reverse and yours was not.
4. Make disagree-and-commit concrete. Name the artefact you left behind so the prediction could be settled without you: the alert and its threshold, the counter on the dashboard, the decision note that recorded the trade-off and the condition that would revisit it.

Follow-up

• What threshold on that alert would have proved you right, and did anyone ever look at it?
• If the same proposal arrived tomorrow with the same deadline, would you argue it the same way?

Tell callers you do not own that their integration breaks

Medium · deprecation · compatibility · stakeholders

A field in a write endpoint's response must change shape. You own the endpoint; you do not own the four internal callers or the outbound webhook consumers who read it. Describe a deprecation you were responsible for: what you shipped first, how you established who was actually reading the field, the window you gave and what set its length, what you did about the consumer who never moved, and how you decided removal was safe. Name the signal you used, not the announcement you sent.

Approach

1. Establish the reader set empirically rather than from a wiki of owners: per-field usage counters keyed by principal, or access logs attributed to a consumer. State the blind spot of whichever you pick, since a consumer that reads the field only on a monthly job will not appear in a week of logs.
2. Ship additive first. Populate the new field alongside the old one so no reader is forced to move, which is also what keeps a rolling deploy safe, because old and new instances answer the same requests at the same time and a rollback must still find the old shape present.
3. Set the window from the slowest legitimate consumer's release cadence, not from your calendar, and decide separately what to do for a consumer with no release process at all, such as an external webhook endpoint you can only email.
4. Convert silence into evidence before you rely on it: a short, low-traffic removal window that makes a still-dependent consumer fail visibly and loudly while you are watching, rather than at three in the morning after you have moved on.

Follow-up

• How would you detect a consumer that reads the field only during a monthly export?
• One caller refuses to move and has a commercial relationship behind it. What changes in your plan and what does not?

Unblock an engineer without taking the keyboard

Easy · mentoring · leases · at-least-once

A teammate has spent two days on a job handler that occasionally writes duplicate rows. They are certain the queue is delivering twice by mistake. You suspect a lease expiring under a slow handler, so the job is running concurrently with itself. Describe how you have unblocked someone in this position: what you asked before offering a hypothesis, what you showed them rather than told them, and what you left them owning. Then say what you would do if their theory turned out to be the right one.

Approach

1. Ask before diagnosing, and ask for things answerable from data they already have: the attempt count on the job rows that produced duplicates, the handler's observed duration against its lease expiry, and whether the duplicate rows share a natural key that a unique constraint could have caught.
2. Teach the shape rather than the answer. A lease cannot distinguish a dead worker from a slow one, so a handler that outruns its lease is running twice by design, and deploys deliver the other half by killing handlers mid-run on every rollout. Both of their candidate theories produce identical duplicate rows, which is why the evidence has to come from timings rather than from argument.
3. Hand over a checklist they execute: a natural key on every write the handler performs so the second copy collides rather than appends, the record of intent written before any external effect, a lease heartbeat while running, and the metric that shows it working.
4. Keep ownership with them deliberately. Pair on the first write, then step back; if you finish it yourself you have closed one ticket and left the same person stuck on the next redelivery.

Follow-up

• How would you distinguish a genuine double-delivery from a lease expiry using only the data already stored?
• Their handler calls an external endpoint before recording that it did. What do you tell them to change first?