Application Engineer
Tower Research Capital
3 rounds | 17 Coding problems
252 views
Interview preparation journey
Preparation
Duration: 5 months
Topics: Data Structures, Algorithms, System Design, Aptitude, OOPS
Tip

Tip 1 : Whatever is written in resume, the interviewer will drill you on that
Tip 2 : Your language concepts should be crystal clear.
Tip 3 : Apart from DSA, Algo their selection criteria also includes Database, Linux, Networking knowledge

Application process
Where: Other
Eligibility: Above 1 years of experience
Resume tip

Tip 1 : Have at least 2 good projects explained in short with all important points covered.

Tip 2 : Every skill must be mentioned.

Tip 3 : Focus on skills, projects and experiences more.

Interview rounds
01
Round
Medium
Online Coding Interview
Duration90 minutes
Interview date7 Jul 2021
Problems5
File Handling Question

String parsing from a file - Given a file has logs details in it which contains colon-separated data. Please find data corresponding to the tag "Buy".

Problem approach

Solved using the below steps :
1. Read the file in python and store data in a dictionary
2. Find the key as buy
3. Return value corresponding to key "buy"

SQL Question

Write a simple join query

Problem approach

Tip 1 : Practice applying each type of joins
Tip 2 : Prepare functions used with the group by clause

Log Parsing Problem

Read a log file and return some response.

Problem approach

Return required value corresponding to asked key

Linux Question

There is a process running with multiple threads, please find a process by its name and kill its pid (Process ID)

Problem approach

Tip : You should be hands-on with Linux commands

Path Reversals

#### You are given a directed graph and two nodes, ‘S’ and ‘D’, denoting the start and end node. Your task is to find the minimum number of edges that you have to reverse to find the path from nodes ...

view more
Problem approach

Solved using Dijkstra’s Algorithm -

In this approach, we make the graph into a weighted graph. We set the edges’ edge-weight as 0 and add all the reverse edges with a weight 1.

We will apply Dijkstra’s algorithm on the start node and get the distance from all the nodes in the graph. Each time a reversed edge is traversed in the path, the path cost will increase by 1. The total...

view more
02
Round
Medium
Video Call
Duration45 minutes
Interview date16 Jul 2021
Problems7
Linux Question

What is swap space?

Linux Question

What do you mean by the Process States in Linux?

Linux Question

What is LVM and why is it required?

Python Question

How is memory managed in Python?

Python Question

What are Python namespaces? Why are they used?

Python Question

What are decorators in Python?

Python Question

What is pickling and unpickling?

03
Round
Medium
Video Call
Duration45 minutes
Interview date31 May 2022
Problems5
Network Security Question

What are the best defences against a brute force login attack?

Network Security Question

Explain the difference between symmetric and asymmetric encryption.

DBMS Question

Explain different types of Normalization forms in a DBMS.

DBMS Question

Network Security Question

Define the salting process and what it’s used for.

Start a Discussion
Similar interview experiences
SDE - 1
3 rounds | 6 problems
Interviewed by Tower Research Capital
657 views
SDE - 2
4 rounds | 4 problems
Interviewed by Tower Research Capital
811 views
SDE - 1
3 rounds | 3 problems
Interviewed by Tower Research Capital
469 views
Software Engineer
4 rounds | 5 problems
Interviewed by Tower Research Capital
408 views
Companies with similar interview experiencs
Application Engineer
5 rounds | 8 problems
Interviewed by Hexaview Tech
3439 views