Home » Company Wise Interview Questions » Akuna Capital Interview Questions

Akuna Capital Interview Questions

Detect Squares

Minimum Interval To Include Each Query

Merge Triplets To Form Target Triplet

Hand Of Straights

Distinct Subsequences

Min Cost Climbing Stairs

Swim In Rising Water

Network Delay Time

Min Cost To Connect All Points

Redundant Connection

Walls And Gates

K Closest Points To Origin

Kth Largest Element In A Stream

Count Good Nodes In Binary Tree

Binary Tree Right Side View

Number Of Connected Components In An Undirected Graph

Non Overlapping Intervals

Lowest Common Ancestor Of A Binary Search Tree

Graph Valid Tree

Find Minimum In Rotated Sorted Array

Encode And Decode Strings

House Robber Ii

Subtree Of Another Tree

Counting Bits

Reverse Bits

3Sum

Meeting Rooms

Word Ladder Ii

Wiggle Sort Ii

Valid Phone Numbers

Valid Perfect Square

Top K Frequent Words

Three Equal Parts

The Number Of Seniors And Juniors To Join The Company

The Number Of Passengers In Each Bus Ii

Task Scheduler Ii

Swapping Nodes In A Linked List

Surrounded Regions

Sum Root To Leaf Numbers

Strings Differ By One Character

Shuffle An Array

Shortest Path In Binary Matrix

Sequential Digits

Self Crossing

Search In Rotated Sorted Array Ii

Robot Room Cleaner

Reverse String Ii

Restore The Array

Repeated String Match

Remove Invalid Parentheses

Remove All Occurrences Of A Substring

Reduce Array Size To The Half

Rectangle Overlap

Recover Binary Search Tree

Rank Scores

Range Addition

Print Words Vertically

Path Sum Iii

Parallel Courses Ii

Parallel Courses

Palindrome Partitioning Ii

Paint House Iii

Operations On Tree

Number Of Ways To Split A String

Number Of Ways To Build Sturdy Brick Wall

Number Of Ways To Arrive At Destination

Number Of Steps To Reduce A Number To Zero

Number Of Pairs Of Strings With Concatenation Equal To Target

Nth Magical Number

Next Palindrome Using Same Digits

Moving Average From Data Stream

Minimum Sum Of Four Digit Number After Splitting Digits

Minimum Path Cost In A Grid

Minimum One Bit Operations To Make Integers Zero

Minimum Number Of Moves To Make Palindrome

Minimum Height Trees

Minimum Cost To Split An Array

Minimum Cost To Connect Two Groups Of Points

Minimum Adjacent Swaps For K Consecutive Ones

Merge Bsts To Create Single Bst

Max Value Of Equation

Maximum Trailing Zeros In A Cornered Path

Maximum Sum Of Two Non Overlapping Subarrays

Maximum Students Taking Exam

Maximum Profit From Trading Stocks

Maximum Points You Can Obtain From Cards

Maximum Length Of Subarray With Positive Product

Maximize The Minimum Powered City

Matrix Block Sum

Longest Subsequence Repeated K Times

Longest Palindrome

Length Of Longest Fibonacci Subsequence

Length Of Last Word

Kth Smallest Subarray Sum

Kids With The Greatest Number Of Candies

Jump Game Vi

Ip To Cidr

Insert Into A Sorted Circular Linked List

Insert Delete Getrandom O1 Duplicates Allowed

Hexspeak