Software Engineer

Software EngineerJunior Software EngineerMedium

Akuna Capital is seeking a motivated and talented Junior Software Engineer to join our dynamic team. This role is ideal for individuals passionate about building robust and scalable financial technology solutions. The interview process is designed to assess your foundational knowledge in computer science, problem-solving abilities, and cultural fit within our fast-paced trading environment.

Rounds·3

Timeline·~14d

Experience·0 - 2 yrs

Comp band·US$85000 - US$110000

Interview time·120 min

Evaluation

What they measure.

  • Technical proficiency in chosen programming languages.
  • Problem-solving approach and logical thinking.
  • Code quality, efficiency, and readability.
  • Understanding of data structures and algorithms.
  • Communication skills and clarity of thought.
  • Cultural fit and enthusiasm for the role.

Preparation

How to prepare.

Tips

  1. Review fundamental data structures (arrays, linked lists, trees, graphs, hash maps) and algorithms (sorting, searching, dynamic programming, graph traversal).
  2. Practice coding problems on platforms like LeetCode, HackerRank, or Coderbyte, focusing on easy and medium difficulty.
  3. Brush up on object-oriented programming (OOP) concepts.
  4. Understand basic computer science concepts like operating systems, databases, and networking.
  5. Prepare to discuss your resume and past projects in detail.
  6. Research Akuna Capital's business, values, and technology stack.
  7. Practice explaining your thought process clearly and concisely.
  8. Prepare questions to ask the interviewers about the role, team, and company culture.

Study plan

Fig · Study plan — 04 phases

01 / 04
01

Phase 01 of 04

Data Structures Fundamentals

Weeks 1-2: Data Structures (Arrays, Linked Lists, Stacks, Queues, Hash Maps) & Basic Sorting/Searching Algorithms.

Weeks 1-2: Focus on core data structures like arrays, linked lists, stacks, queues, and hash maps. Practice implementing them and solving problems involving their efficient use. Cover basic sorting algorithms (Bubble Sort, Insertion Sort, Merge Sort, Quick Sort) and searching algorithms (Binary Search).

Questions

Commonly asked.

  • Write a function to reverse a linked list.
  • Given an array of integers, find the two numbers that add up to a specific target.
  • Explain the difference between a process and a thread.
  • What is a hash map and how does it work?
  • Describe a situation where you had to deal with a difficult team member.
  • How would you design a system to track stock prices in real-time?
  • What are the time and space complexities of your solution?
  • Why are you interested in working at Akuna Capital?
  • Tell me about a time you failed and what you learned from it.
  • How do you stay updated with new technologies?

Locations

Regional differences.

Fig · Regions — 02 locations

01 / 02

Location

Chicago

Interview focus

Understanding of core data structures and algorithms.Ability to write clean, efficient, and maintainable code.Problem-solving and analytical thinking.Enthusiasm for learning and adapting to new technologies.

Common questions

  • Describe a challenging project you worked on during your internship or academic career.
  • How do you approach debugging a complex issue?
  • What are your favorite programming languages and why?
  • Tell me about a time you had to learn a new technology quickly.

Tips

  • Be prepared to discuss your academic projects in detail.
  • Emphasize your eagerness to learn and contribute.
  • Showcase your understanding of fundamental programming concepts.
  • Research Akuna Capital's business and technology stack.

Rounds

Round-by-round.

Expand a step for evaluation criteria, sample questions, and prep notes.

Med

Data Structures And Algorithms Interview · 45 min · Software Engineer / Team Lead

This round focuses on your core technical skills. You will be asked to solve 1-2 coding problems, typically involving data structures and algorithms. The interviewer will assess your problem-solving approach, your ability to write efficient and correct code, and your understanding of fundamental computer science concepts. Be prepared to explain your thought process clearly and discuss the time and space complexity of your solutions.

What they look for

Logical thinking.Ability to translate requirements into code.Understanding of time and space complexity.Clean and readable code.

Evaluation

  • Problem-solving approach.
  • Correctness and efficiency of code.
  • Understanding of data structures and algorithms.
  • Clarity of explanation.

Sample questions

  • Given an array of integers, return indices of the two numbers such that they add up to a specific target.

    ArrayHash MapTwo Pointers
  • Implement a function to check if a binary tree is a valid Binary Search Tree (BST).

    TreeRecursionBST
  • Find the kth smallest element in an unsorted array.

    ArraySortingHeap

Prep for this round

  1. 01Practice coding problems on platforms like LeetCode.
  2. 02Focus on explaining your approach before coding.
  3. 03Write clean, well-commented code.
  4. 04Be ready to discuss edge cases and test your solution.

Common rejection reasons

  • ×Inability to articulate thought process.
  • ×Incorrect or inefficient solutions to coding problems.
  • ×Lack of understanding of fundamental data structures and algorithms.
  • ×Poor communication skills.

DSA

Coding questions at Akuna Capital.

Frequently reported on Akuna Capital loops

Other guides

More at Akuna Capital.