Teikametrics Senior Software Engineer Interview Questions and Answers

Array and Java related questions

Q1. Questions on what project you worked on
Add your answer
Q2. Design 2 factor authentication
Ans. 
Implementing 2 factor authentication for enhanced security
• Require users to enter their password as the first factor

• Send a unique code to the user's registered email or phone as the second factor

• Prompt the user to enter the code to complete the authentication process
Answered by AI
Add your answer

Q1. Design Least recently used cache.
Ans. 
Design a Least Recently Used cache system.
• Implement a doubly linked list to keep track of the order of usage of cache items.

• Use a hashmap to store key-value pairs for quick access to cache items.

• When a new item is accessed, move it to the front of the linked list. If the cache is full, remove the least recently used item from the end of the list.
Answered by AI
Add your answer

Q1. System Design question on designing a Tiny URL
Add your answer

Round duration - 75 Minutes
Round difficulty - Medium

Q1. 
Triplets with Given Sum Problem
Given an array or list ARR consisting of N integers, your task is to identify all distinct triplets within the array that sum up to a specified number K.
Explanation:
A t...read more
Ans. 
The task is to identify all distinct triplets within an array that sum up to a specified number.
• Iterate through the array and use nested loops to find all possible triplets.

• Keep track of the sum of each triplet and compare it with the target sum.

• Print the triplet if the sum matches the target sum, else print -1.
Answered by AI
Add your answer
Q2. 
K-th Largest Number in a BST
Given a binary search tree (BST) consisting of integers and containing 'N' nodes, your task is to find and return the K-th largest element in this BST.
If there is no K-th la...read more
Ans. 
Find the K-th largest element in a BST.
• Perform reverse in-order traversal of the BST to find the K-th largest element.

• Keep track of the count of visited nodes to determine the K-th largest element.

• Return -1 if there is no K-th largest element in the BST.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Q1. Can you design a database schema for a support ticketing system, such as Freshdesk?
Ans. 
Designing a database schema for a support ticketing system like Freshdesk.
• Create a 'Tickets' table with fields like ticket ID, subject, description, status, priority, etc.

• Include a 'Users' table for customer and agent information.

• Establish a 'Categories' table for ticket categorization.

• Implement a 'Comments' table to track communication history.

• Utilize foreign keys to establish relationships between tables.
Answered by AI
Add your answer
Q2. 
Count Ways to Reach the N-th Stair Problem Statement
You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or tw...read more
Ans. 
The problem involves counting the number of distinct ways to climb N stairs by taking 1 or 2 steps at a time.
• Use dynamic programming to solve this problem efficiently.

• The number of ways to reach the Nth stair is equal to the sum of ways to reach (N-1)th stair and (N-2)th stair.

• Handle modulo 10^9+7 to avoid overflow issues.

• Consider base cases for 0th and 1st stair.

• Optimize the solution by using constant space instead of
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Q1. Can you design the Low-Level Design (LLD) and High-Level Design (HLD) for a system like BookMyShow?
Ans. 
Designing the Low-Level Design (LLD) and High-Level Design (HLD) for a system like BookMyShow.
• For HLD, identify main components like user interface, booking system, payment gateway, and database.

• For LLD, break down each component into detailed modules and their interactions.

• Consider scalability, security, and performance in both designs.

• Example: HLD - User selects movie -> Booking system checks availability -> Pa...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

This was hiring manager round

Round duration - 20 Minutes
Round difficulty - Easy

This was culture fit round

DSA medium level questions

Q1. JS based questions, event loop
Add your answer
Q2. Tricky questions based on output - JS concepts
Add your answer

Q1. Machine Coding round on JS, Html, Css
Add your answer
Q2. Questions on performance optimization, security
Add your answer

Basic DSA leet code.

Q1. Ds Algo round. Any programming language
Add your answer

Q1. System design: url shortner, moving large file from one location to other location with LLD
Add your answer

Q1. Salary discussion more of a formality if you clear technical rounds
Add your answer