tekion logo
Tekion· SDE II

Tekion SDE2 | 2.5 yrs experience | 2022

Experience
2.5 years
Posted
5 Apr 2025
336 reads

Summary

I interviewed for an SDE2 role at Tekion with 2.5 years of experience and was selected after multiple technical rounds.

How it went

Round 1
1. Given a fixed camera in a forest (with predefined trees), give the best angle in which the camera pictures the maximum of trees. Input angle is given in radian, return angle from 0 (say north)

int ForestCover(vector<Pair<int,int>> coordinateList, int angle) 
{
}

2. Given the root of a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus the sum of all keys greater than the original key in BST.
As a reminder, a binary search tree is a tree that satisfies these constraints:
The left subtree of a node contains only nodes with keys less than the node's key.
The right subtree of a node contains only nodes with keys greater than the node's key.
Both the left and right subtrees must also be binary search trees.

Round 2
1. Splitwise LLD

Round 3
1. HLD basics discussions

Verdict: Selected.

Questions asked (2)

  1. 01

    Maximize Trees in Camera View

    Data Structures & Algorithms

    Given a fixed camera in a forest (with predefined trees), give the best angle in which the camera pictures the maximum of trees. Input angle is given in radian, return angle from 0 (say north)

    int ForestCover(vector<Pair<int,int>> coordinateList, int angle) 
    {
    }

  2. 02

    Convert BST to Greater Tree

    Data Structures & Algorithms

    Given the root of a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus the sum of all keys greater than the original key in BST. As a reminder, a binary search tree is a tree that satisfies these constraints: The left subtree of a node contains only nodes with keys less than the node's key. The right subtree of a node contains only nodes with keys greater than the node's key. Both the left and right subtrees must also be binary search trees.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Tekion recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!