Interview guides · GVEC

GVEC Software Engineer Interview Guide

GVEC Software Engineer interview guide: reported rounds, questions and how candidates describe the process.

The 60-second brief

At GVEC, a Software Engineer—often operating within specialized domains such as Network Engineering, IT Infrastructure, or Application Administration—is a vital architect of the technological backbone that powers our diverse service offerings. From electric and internet services to solar and HVAC solutions, your work directly enables the operational excellence and customer-centric innovation that defines our presence in South-Central Texas. You will not just be writing code or managing systems; you will be solving complex business challenges that require a blend of deep technical expertise and a strong business-oriented mindset. Whether you are optimizing ISP network hierarchies or managing mission-critical applications, your contributions ensure that our infrastructure remains scalable, reliable, and efficient.

This guide is scoped to a Software Engineer candidate at GVEC.

Focus areas

Network Engineering
MPLS (Multiprotocol Label Switching)
ISP Network Operations

The GVEC interview process

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

Technical Qualifications Assessment

Initial evaluation of your technical skills and qualifications relevant to the role.

What to demonstrate

Initial evaluation of your technical skills and qualifications relevant to the role
Depth in Network Engineering

How to prepare

Answer aloud and timed: Explain your experience with BGP, OSPF, and MPLS in a production environment.
Answer aloud and timed: How do you approach fault isolation when troubleshooting complex network latency or outages?

Problem-Solving Discussion

In-depth discussions regarding your methodologies for solving technical problems.

What to demonstrate

In-depth discussions regarding your methodologies for solving technical problems
Depth in Network Engineering

How to prepare

Answer aloud and timed: What are the key differences between Layer 2 protocols like rSTP and VLANs in a Metro Ring architecture?
Answer aloud and timed: How have you utilized Python, PERL, or Shell scripting to automate repetitive infrastructure tasks?

Cultural Alignment Evaluation

Assessment of your fit within the company's culture and values.

What to demonstrate

Assessment of your fit within the company's culture and values
Depth in Network Engineering

How to prepare

Answer aloud and timed: Describe your process for designing redundancy into a scalable network hierarchy.
Answer aloud and timed: Describe a time you had to manage conflicting priorities while working on multiple high-stakes projects.

Scenario-Based Technical Questions

Final stage involving specific, scenario-based questions to test your technical expertise.

What to demonstrate

Final stage involving specific, scenario-based questions to test your technical expertise
Depth in Network Engineering

How to prepare

Answer aloud and timed: How do you handle after-hours on-call responsibilities while ensuring long-term system stability?
Answer aloud and timed: Give an example of a complex technical issue you resolved independently; what was your logic process?

Where candidates lose points

Structure your answers

Use the STAR method (Situation, Task, Action, Result) to keep your behavioral answers concise and impactful.

Emphasize the 'why'

When discussing technical designs, explain your reasoning process; we are as interested in your thinking as we are in the solution.

Prepare for cross-functional scenarios

Be ready to explain how you handle technical disagreements or priority conflicts with team members.

Showcase your curiosity

We appreciate candidates who ask insightful questions about our growth plans and how the engineering team contributes to GVEC's broader mission.

Questions & practice

Identify the heaviest tenants in a five-minute window under memory pressure

Medium · top-k · heavy hitters · streaming

The edge service handles about 3,000 requests per second across roughly 50,000 tenants, peaking near 9,000. Expose the 50 heaviest tenants by request count over the trailing five minutes so limits can be tightened before one tenant's backfill starves the fleet. You may not retain five minutes of raw records. Give the exact solution and its memory, then the bounded-memory approximation with its error stated as a formula, and say which you would ship and at what tenant cardinality that choice changes.

Approach

Do the exact version first, because it is affordable at this cardinality: a ring of 300 one-second counters per tenant, advanced lazily, is 1,200 bytes of counters per tenant and roughly 60 to 90 MB for 50,000 tenants with overhead. Carry a running total and subtract the bucket you overwrite so a window read is O(1) rather than 300 adds.
Extract the top 50 with a size-k min-heap over the tenant sums: O(d log k) for d tenants, against O(d log d) to sort them all. Maintaining the heap continuously instead of on query requires a tenant-to-heap-index map, because incrementing a count already inside the heap means sifting from a known position, and without that map you rebuild the heap on every request.
State the approximation precisely rather than gesturing at sketches. Misra-Gries with m counters retains every item whose true count exceeds N/(m+1), and each retained count underestimates the truth by at most N/(m+1). With m = 1,000 and N = 900,000 requests in the window the error is roughly 900 requests, which is fine for spotting a tenant sending 50,000 and useless for ranking two tenants 200 apart.
Say what breaks when the window slides: Misra-Gries and Space-Saving are insert-only and cannot be decremented as records age out. The workable construction is one summary per sub-window, say ten seconds, with 30 summaries merged at query time, and the merged error is the sum of the per-summary errors, so the bound degrades linearly in the number of sub-windows.

Follow-up

The heaviest tenant is heavy because of one export job rather than user traffic. Should the limiter treat those as the same tenant?
Two tenants sit tied at the boundary of the top 50. Does your answer flap, and does the flapping matter?

Merge partitioned event streams into one ordered feed with bounded lateness

Hard · k-way merge · watermarks · out-of-order streams

The read-model service consumes 64 log partitions carrying about 4,000 events per second in total. Each partition is ordered within itself, but partitions drift by up to 30 seconds, and the activity feed must present a tenant's events in occurred_at order. Produce the merge. State its complexity, the buffer it requires in events and in bytes, what happens when one partition is idle, and what you do with an event that arrives after you have already emitted its position. Payloads average 1 KB.

Approach

Merge with a min-heap over the 64 partition heads keyed on (occurred_at, event_id): O(log P) per event and O(n log P) overall. The tie-break on event_id is what makes the output deterministic when two partitions carry the same millisecond, which matters because the feed is paginated and a non-deterministic order reorders pages under the reader.
Emitting the heap head is only correct once every partition has produced everything up to that timestamp, so the emit condition is a watermark: the minimum across partitions of the highest occurred_at seen, less the allowed lateness. Events are held until the watermark passes them, which is what turns individually ordered streams into a jointly ordered one.
Size the buffer from the lateness rather than guessing: 4,000 events per second times 30 seconds is 120,000 buffered events, and at 1 KB each about 120 MB of heap. That number is the real price of the ordering guarantee and belongs in front of whoever asked for it.
Handle the idle partition explicitly, because it fails the feed rather than corrupting it: a partition with no traffic never advances its own maximum, so the watermark freezes and output stops entirely. Either every partition emits a periodic idle marker carrying the broker's current time, or the watermark falls back to wall clock for a partition silent beyond a threshold.

Follow-up

The lateness budget is raised to five minutes. What is the new buffer, and what besides memory changes?
The consumer restarts. Where does it resume from, and what does the feed look like for the first 30 seconds?

Find overlapping job attempts and peak concurrency from lease records

Medium · sweep line · intervals · leases

A day of job_run history yields about 50,000,000 attempt records: (job_run_id, job_type, attempt, started_at, finished_at which is NULL when the worker died, lease_expires_at). Leases expire on a clock, so a job that outran its lease ran twice. Produce (a) every job_run_id whose attempts overlapped in wall-clock time and (b) the peak number of simultaneously running attempts per job_type with the minute it occurred. Target O(n log n). State how you treat a NULL finished_at and what clock skew does to your answer.

Approach

Define the interval before sorting anything: an attempt occupies [started_at, COALESCE(finished_at, lease_expires_at)). finished_at is observed and lease_expires_at is only a promise, so every attempt without a finish contributes an estimate and the whole result is a lower bound on overlap rather than an exact count.
For peak concurrency, sweep: emit 2n endpoints, sort by (timestamp, kind) with ends ordered before starts at equal timestamps, then walk the sequence maintaining a counter per job_type and record each type's maximum with its timestamp. O(n log n) dominated by the sort, O(n) space, or O(1) extra if the sort is external and the walk streams.
For overlap detection, do not compare attempts pairwise. A single global sort by (job_run_id, started_at) gives both the grouping and the order; within a group, keep the maximum end seen so far and report an overlap exactly when the next start is less than that running maximum, which is one linear pass after the sort.
Half-open intervals matter and are easy to get wrong: with closed intervals an attempt ending at the same millisecond another begins reads as concurrency two, and across 50,000,000 records that artefact swamps the real signal.

Follow-up

A handler is not idempotent and you have found 400 overlapping jobs. Which of them actually caused damage, and what would you query to find out?
Peak concurrency for one job_type is 4 against a configured cap of 4. Is the cap working, or is the data hiding attempts that never started?

Replace offset paging on the resource feed with keyset

Easy · keyset pagination · composite index · sort order

resource holds resource_id, tenant_id, owner_user_id, title, body_ref, version, status ('draft','active','archived','deleted'), created_at, updated_at, deleted_at, with an index on (tenant_id, status, updated_at DESC, resource_id DESC). The listing endpoint returns active resources for one tenant, newest update first, 50 per page, today with LIMIT 50 OFFSET n. Tenants reach page 400 and rows are created while they read. Write the keyset query, define what the cursor carries and how it is encoded, and say which part of the index each predicate uses. Assume PostgreSQL 16.

Approach

Name the two failures separately. OFFSET 20000 makes the server produce and discard 20,000 rows, so page cost grows with depth rather than with page size. Independently, any write that changes how many rows sort above the offset moves the window between two fetches, and the direction decides which anomaly you get: an insert lands at the head of updated_at DESC and pushes already-returned rows down past the boundary, so they are returned a second time; a delete above the offset, or a row whose updated_at is bumped above the cursor, pulls rows up and one is never returned at all. Nothing in the response reveals either.
Write the seek: WHERE tenant_id = $1 AND status = 'active' AND (updated_at, resource_id) < ($2, $3) ORDER BY updated_at DESC, resource_id DESC LIMIT 50. The row-value comparison is one index range rather than a disjunction, and both columns are NOT NULL, which is what makes that comparison well defined.
Map each predicate onto the index: tenant_id and status are equality on the leading columns, (updated_at, resource_id) is the range, and the ORDER BY matches the index order so no Sort node appears and the scan stops after 50 rows. The DESC in the definition only matters for mixed directions — a plain ascending btree on the same columns is read backwards for this query.
Put both sort columns in the cursor and nothing the client can tamper with into another tenant: base64 of (updated_at, resource_id), validated server-side, with tenant_id taken from the principal.

Follow-up

The client asks for 'jump to page 400'. What do you offer instead, and what does the honest version cost?
Sort order becomes user-selectable across four columns. How many indexes is that, and which would you refuse to add?

Denormalise tenant onto revisions and backfill it live

Hard · denormalisation · online migration · backfill

resource_revision (revision_id, resource_id, version, actor_user_id, change_kind, patch, request_id, created_at) has 400M rows and no tenant column; tenant_id lives only on resource. Two reads need it: a tenant-scoped audit feed ordered by created_at DESC, and an offboarding purge. Both join back to resource today. Justify adding tenant_id to resource_revision against those two reads, name the anomaly the copy introduces and the constraint that prevents it, then give the ordered migration for a live table taking 1.2k writes/second — the lock each step takes, how the backfill is batched, and where each step stops being reversible. PostgreSQL 16.

Approach

Justify from the access path rather than from taste. Without the column, the audit feed either scans resource_revision by created_at and discards other tenants' rows, or resolves the tenant's resource_ids first and probes with them — both proportional to the tenant's whole history rather than to one page. With (tenant_id, created_at DESC, revision_id DESC) it is a seek that stops at 50 rows, and the purge becomes a ranged delete instead of a join.
Name the cost exactly: a second copy of a fact can disagree with the first. Make the disagreement unwritable rather than documented — add UNIQUE (resource_id, tenant_id) on resource so it can serve as a foreign-key target, then FOREIGN KEY (resource_id, tenant_id) REFERENCES resource (resource_id, tenant_id) on the revision table. A revision can then only ever carry its parent's tenant.
Step one, expand: ALTER TABLE resource_revision ADD COLUMN tenant_id BIGINT NULL, with no default, so it is a catalogue change and no rewrite. It still needs ACCESS EXCLUSIVE for an instant, and that instant queues behind the longest open transaction on the table while every later query queues behind it — set lock_timeout to 2s and retry rather than wait.
Step two, dual-write: deploy the writer that populates tenant_id on every new revision while reads still use the join. Reversible by redeploying the previous build, because nothing reads the column yet.

Follow-up

The backfill is half finished and a rollback is required. What state is the table in, and what does the previous build do with a half-populated column?
How do you verify the backfill actually finished, given rows are still being inserted while it runs?

What are the key differences between Layer 2 protocols like rSTP and VLANs in a Metro Ring architecture?

Medium · Technical Competency and Domain Knowledg

Approach

Fix the scope first: who calls this, how often, and what they do when it fails.
Name the read and write paths separately; they rarely have the same bottleneck.
Choose a partition key and say what query it makes expensive.
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 have you utilized Python, PERL, or Shell scripting to automate repetitive infrastructure tasks?

Medium · Technical Competency and Domain Knowledg

Approach

Clarify what is being asked and what a complete answer contains.
State your assumptions explicitly before working the problem.
Say what you would check first and why it is the highest-information step.
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 your process for designing redundancy into a scalable network hierarchy.

Medium · Technical Competency and Domain Knowledg

Approach

Fix the scope first: who calls this, how often, and what they do when it fails.
Name the read and write paths separately; they rarely have the same bottleneck.
Choose a partition key and say what query it makes expensive.
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?

Give an example of a complex technical issue you resolved independently; what was your logic process?

Medium · Problem-Solving and Operational Excellen

Approach

Clarify what is being asked and what a complete answer contains.
State your assumptions explicitly before working the problem.
Say what you would check first and why it is the highest-information step.
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 balance the need for immediate fixes with the necessity of maintaining long-term network standards?

Medium · Problem-Solving and Operational Excellen

Approach

Clarify what is being asked and what a complete answer contains.
State your assumptions explicitly before working the problem.
Say what you would check first and why it is the highest-information step.
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 approach providing and receiving constructive criticism within a technical team?

Medium · Collaboration and Cultural Alignment

Approach

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

Follow-up

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

Can you describe a project where you had to lead a cross-functional group to achieve a specific business goal?

Medium · Collaboration and Cultural Alignment

Approach

Clarify what is being asked and what a complete answer contains.
State your assumptions explicitly before working the problem.
Say what you would check first and why it is the highest-information step.
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 ensure that your technical work directly supports the customer experience?

Medium · Collaboration and Cultural Alignment

Approach

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

Follow-up

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

Why do you want to contribute to the mission of a service-focused organization like GVEC?

Medium · Collaboration and Cultural Alignment

Approach

Clarify what is being asked and what a complete answer contains.
State your assumptions explicitly before working the problem.
Say what you would check first and why it is the highest-information step.
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 approach fault isolation when troubleshooting complex network latency or outages?

Medium · Technical Competency and Domain Knowledg

Approach

Establish what changed and when, before forming any theory.
Pick a bisection that eliminates candidates whichever way it turns out.
Check the instrumentation before believing the symptom.
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 GVEC candidates report.

Day 1 — Map the GVEC loop

Write out the reported sequence: Technical Qualifications Assessment, Problem-Solving Discussion, Cultural Alignment Evaluation, Scenario-Based Technical Questions.
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 Network Engineering

Spend the session on Network Engineering, which GVEC candidates report being tested on.
Write one worked example in Network Engineering and time yourself on it.

Deliverable: One timed worked example in Network Engineering.

Day 3 — Work MPLS (Multiprotocol Label Switching)

Spend the session on MPLS (Multiprotocol Label Switching), which GVEC candidates report being tested on.
Write one worked example in MPLS (Multiprotocol Label Switching) and time yourself on it.

Deliverable: One timed worked example in MPLS (Multiprotocol Label Switching).

Day 4 — Work ISP Network Operations

Spend the session on ISP Network Operations, which GVEC candidates report being tested on.
Write one worked example in ISP Network Operations and time yourself on it.

Deliverable: One timed worked example in ISP Network Operations.

Day 5 — Answer out loud: Technical Competency and Domain Knowledge

Answer aloud, timed: Explain your experience with BGP, OSPF, and MPLS in a production environment.
Answer aloud, timed: How do you approach fault isolation when troubleshooting complex network latency or outages?

Deliverable: Spoken answers to 2 reported Technical Competency and Domain Knowledge question(s), under time.

Day 6 — Answer out loud: Problem-Solving and Operational Excellence

Answer aloud, timed: Describe a time you had to manage conflicting priorities while working on multiple high-stakes projects.
Answer aloud, timed: How do you handle after-hours on-call responsibilities while ensuring long-term system stability?

Deliverable: Spoken answers to 2 reported Problem-Solving and Operational Excellence question(s), under time.

Day 7 — Answer out loud: Collaboration and Cultural Alignment

Answer aloud, timed: How do you approach providing and receiving constructive criticism within a technical team?
Answer aloud, timed: Can you describe a project where you had to lead a cross-functional group to achieve a specific business goal?

Deliverable: Spoken answers to 2 reported Collaboration and Cultural Alignment question(s), under time.

Behavioural preparation

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

Explain your experience with BGP, OSPF, and MPLS in a production environment.

Medium · Technical Competency and Domain Knowledg

Approach

Pick a story where you made the decision, not one where you watched it.
State the situation in two sentences and spend the rest on the reasoning.
Give the blast radius: what could have broken, and what you measured.
Name the disagreement and how you resolved it with evidence.

Follow-up

What would you do differently if you ran that again?
How did you know your change caused the improvement?

Describe a time you had to manage conflicting priorities while working on multiple high-stakes projects.

Medium · Problem-Solving and Operational Excellen

Approach

Pick a story where you made the decision, not one where you watched it.
State the situation in two sentences and spend the rest on the reasoning.
Give the blast radius: what could have broken, and what you measured.
Name the disagreement and how you resolved it with evidence.

Follow-up

What would you do differently if you ran that again?
How did you know your change caused the improvement?

How do you handle after-hours on-call responsibilities while ensuring long-term system stability?

Medium · Problem-Solving and Operational Excellen

Approach

Pick a story where you made the decision, not one where you watched it.
State the situation in two sentences and spend the rest on the reasoning.
Give the blast radius: what could have broken, and what you measured.
Name the disagreement and how you resolved it with evidence.

Follow-up

What would you do differently if you ran that again?
How did you know your change caused the improvement?