Karza Tech|Software Engineer | Mumbai | Declined

karza tech logo
karza tech
Software EngineerMumbaiRejected
October 16, 202115 reads

Summary

I recently interviewed for a Software Engineer role at Karza Tech in Mumbai. Unfortunately, my application was declined after completing four rounds.

Full Experience

My interview process at Karza Tech consisted of four distinct rounds:

1. Introduction Round (30 mins)

This round began with questions about my background and past projects. We then moved on to discussions about Python basics and AWS. I was also asked a few coding questions, including 'Kth Largest Element' and 'Tree Top View'.

2. Coding Round (1 hour)

This round was entirely focused on coding. I was given two problems to solve: 'Kth Largest Element' (which also came up in the intro round) and 'Mirror Tree'.

3. Technical Round (30 mins)

The third round involved a deep dive into my projects. The interviewer asked several counter-questions to test my understanding. I also had to answer a few SQL queries and Python-related questions.

4. Technical Round (30 mins)

This final technical round was conducted by a tech lead. The discussion focused on scenario-based questions, framework-related questions, and concepts related to Docker.

Interview Questions (3)

Q1
Kth Largest Element in an Array
Data Structures & AlgorithmsMedium

Find the k-th largest element in an unsorted array. Note that it is the k-th largest element in the sorted order, not the k-th distinct element.

Q2
Top View of Binary Tree
Data Structures & AlgorithmsMedium

Given a binary tree, print the top view of it. The top view of a binary tree is the set of nodes visible when the tree is viewed from the top. The nodes are printed from left to right.

Q3
Mirror a Binary Tree
Data Structures & AlgorithmsEasy

Given the root of a binary tree, invert the tree, and return its root. Inverting a tree means swapping the left and right children of every node.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

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