Trading Technologies SDE-2 Interview Questions and Answers

Round duration - 45 Minutes
Round difficulty - Easy

Q1. 
Balanced Parentheses Combinations
Given an integer N representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.
Explanati...read more
Ans. 
Generate all possible combinations of balanced parentheses for a given number of pairs.
• Use recursion to generate all possible combinations of balanced parentheses.

• Keep track of the number of open and close parentheses used in each combination.

• Terminate recursion when the number of open and close parentheses used equals the given number of pairs.
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Easy

Q1. 
Boundary Traversal of Binary Tree Problem Statement
You are given a binary tree of integers. Your task is to print the boundary nodes of this binary tree in an anti-clockwise direction starting from the ro...read more
Ans. 
Print the boundary nodes of a binary tree in an anti-clockwise direction starting from the root node.
• Traverse the left boundary nodes from top to bottom

• Traverse the leaf nodes from left to right

• Traverse the right boundary nodes from bottom to top

• Handle cases where nodes are null (-1)

• Print the boundary nodes in the specified order
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Easy

Q1. 
Bottom View of Binary Tree Problem Statement
Given a binary tree, the task is to print its bottom view from left to right. Assume the left and the right child nodes make a 45-degree angle with their paren...read more
Ans. 
The task is to print the bottom view of a binary tree from left to right.
• Traverse the binary tree in level order and keep track of the horizontal distance of each node from the root.

• For each horizontal distance, update the node value in a map to get the bottom view nodes.

• Print the values of the map in sorted order of horizontal distance to get the bottom view sequence.
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

Bar raiser

Q1. Can you design a parking lot using low-level design (LLD) and a tiny URL service using high-level design (HLD)?
Ans. 
Yes, I can design a parking lot using LLD and a tiny URL service using HLD.
• For designing a parking lot using LLD, we can create classes like ParkingLot, ParkingSpot, Vehicle, etc. with their respective attributes and methods.

• For designing a tiny URL service using HLD, we can focus on scalability, fault tolerance, and performance. We can use techniques like sharding, caching, load balancing, etc.

• In the parking lot LLD, ...read more
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Technical Interview round that lasted for about 45 minutes. Questions were based on Java, Java design Patterns and OOPS Concepts.

Q1. What are static methods in interfaces?
Ans. 
Static methods in interfaces are methods that can be called without creating an instance of the interface implementation.
• Static methods in interfaces were introduced in Java 8.

• They are used for providing utility methods that are related to the interface but do not require an instance of the implementing class.

• Static methods in interfaces cannot be overridden by implementing classes.

• Example: interface MyInterface { stat...read more
Answered by AI
Add your answer
Q2. Why was a new version of Java (Java 8) needed in the first place?
Ans. 
Java 8 was needed to introduce new features like lambda expressions, streams, and default methods.
• Introduction of lambda expressions for functional programming

• Streams API for processing collections in a functional style

• Default methods in interfaces for backward compatibility

• Improved performance with the introduction of the Nashorn JavaScript engine

• Date and Time API for better handling of date and time operations
Answered by AI
Add your answer
Q3. In how many ways can you create a singleton pattern in Java?
Ans. 
There are multiple ways to create a singleton pattern in Java, including using static initialization, lazy initialization, and enum.
• Using static initialization: Create a private static instance of the class and a public static method to return that instance.

• Lazy initialization: Create a private static instance of the class and a public static method to check if the instance is null before creating it.

• Using enum: Create...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Technical Interview round that lasted for about 45 minutes. Questions were based on Spring boot and Microservices Concepts.

Q1. What is the difference between the Bridge Pattern and the Adapter Pattern in Java?
Ans. 
Bridge Pattern decouples abstraction from implementation, while Adapter Pattern adapts an interface to another.
• Bridge Pattern separates abstraction and implementation using composition, while Adapter Pattern adapts an interface to another without changing its original structure.

• Bridge Pattern allows for changes in both abstraction and implementation independently, while Adapter Pattern allows incompatible interfaces to...read more
Answered by AI
Add your answer
Q2. What is the difference between @RestController and @Controller in Spring Boot?
Ans. 
Difference between @RestController and @Controller in Spring Boot
• 1. @Controller is used to create web MVC controllers while @RestController is used to create RESTful web services.

• 2. @Controller returns the view to be rendered while @RestController returns the object and data is written directly to the HTTP response as JSON or XML.

• 3. @RestController is a specialized version of @Controller that includes @Controller and @...read more
Answered by AI
Add your answer
Q3. What is the difference between Spring and Spring Boot?
Ans. 
Spring is a framework for building Java applications, while Spring Boot is an extension that simplifies the setup and configuration.
• Spring is a comprehensive framework for building Java applications, providing features like dependency injection, aspect-oriented programming, and more.

• Spring Boot is an extension of the Spring framework that aims to simplify the setup and configuration of Spring applications.

• Spring Boot i...read more
Answered by AI
Add your answer
Q4. What is the difference between Monolithic and Microservices Architecture?
Ans. 
Monolithic architecture is a single-tiered software application where all components are tightly coupled, while microservices architecture is a distributed approach where the application is broken down into smaller, loosely coupled services.
• Monolithic architecture has a single codebase and database, while microservices have multiple smaller services with their own codebase and database.

• Monolithic applications are harde...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This was a typical HR round with some standard Behavioral questions

Q1. Why should we hire you?
Add your answer

2 coding questions

Q1. Ds algo round 2 medium questions
Add your answer

Diameter of a binary tree and bfs and dfs questions

Data structure and algorithms

Q1. System design questions
Add your answer

Q1. Behavioural questions related to leadership principle.
Add your answer

Round duration - 60 mins
Round difficulty - Medium

3 Questions were asked : 2- Trees and 1- Stack.
Interviewer was not receptive at all, I think this was a stress interview.

Q1. 
Validate Binary Search Tree Problem Statement
Given a binary tree with 'N' nodes, determine if it is a Binary Search Tree (BST). Return true if the tree is a BST, otherwise return false.
Example:
Input:
...read more
Ans. 
Validate if a given binary tree is a Binary Search Tree (BST) or not.
• Check if the left subtree of a node contains only nodes with values less than the node's value.

• Check if the right subtree of a node contains only nodes with values greater than the node's value.

• Ensure that both the left and right subtrees are also binary search trees.

• Traverse the tree in-order and check if the elements are in sorted order.

• Use a recurs...read more
Answered by AI
Add your answer
Q2. 
Binary Tree Conversion to Greater Tree
Given a binary tree with 'N' nodes, transform it into a Greater Tree. In this transformation, each node's value should be updated to the sum of its original value and...read more
Ans. 
Convert a binary tree into a Greater Tree by updating each node's value to the sum of its original value and the values of all nodes greater than or equal to it.
• Traverse the tree in reverse inorder (right, root, left) to update the nodes' values.

• Keep track of the sum of nodes visited so far to update each node's value.

• Recursively update the node's value by adding the sum of greater nodes to it.
Answered by AI
Add your answer
Q3. 
Check for Valid Parentheses
You are given a string STR containing only the characters "{", "}", "(", ")", "[", and "]". Your task is to determine if the parentheses in the string are balanced.
Input:
Th...read more
Ans. 
Check if the given string containing only parentheses is balanced or not.
• Use a stack to keep track of opening parentheses.

• Iterate through the string and push opening parentheses onto the stack.

• When a closing parenthesis is encountered, pop from the stack and check if it matches the corresponding opening parenthesis.

• If at the end the stack is empty, return 'YES' else return 'NO'.
Answered by AI
Add your answer

Round duration - 60 mins
Round difficulty - Hard

2 Coding Questions were asked, both were of Medium to Hard Difficulty.

Q1. 
Flatten Multi-Level Linked List
You are given a multi-level linked list containing 'N' nodes. Each node has 'next' and 'child' pointers that may or may not point to other nodes. Your task is to flatten th...read more
Ans. 
Flatten a multi-level linked list into a single linked list by rearranging the pointers.
• Traverse the linked list and whenever a node has a child, flatten the child list and append it after the current node.

• Update the 'next' and 'child' pointers accordingly while flattening the list.

• Continue this process until all nodes are rearranged into a single linked list.
Answered by AI
Add your answer
Q2. 
Rain Water Trapping Problem Statement
Given an array/list ARR of size N, representing an elevation map where each element ARR[i] denotes the elevation of the i-th bar. Your task is to calculate and print ...read more
Ans. 
Calculate the total amount of rainwater that can be trapped between given elevations in an elevation map.
• Use two-pointer approach to keep track of left and right boundaries.

• Calculate the trapped water by finding the minimum of left_max and right_max for each bar.

• Subtract the current bar's height from the minimum of left_max and right_max to get the trapped water.

• Keep updating the left_max and right_max as you iterate t...read more
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Timing : It was late night.
How the interviewer was? He was very tired and I had to lead the discussion.
1 System Design Question was asked, had to provide - HLD, LLD, APIs.

Round duration - 60 minutes
Round difficulty - Medium

Timing : Afternoon
How was the environment? Home
Interviewer : Hiring Manager

Q1. Hiring Manager Discussion
Discussed about past Projects, challenges faced, disagreements with manager, why looking for job switch,  leadership principle questions were asked.
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Timing - Afternoon
How was the environment? Home
How the interviewer was? Very Helpful Interviewer
Bar raiser Round - Coding + System Design + Leadership principle

Round duration - 60 Minutes
Round difficulty - Medium

Timing: 10AM-11AM
Interviewer was quite supportive and helpful.
Environment was normal as usual and it was morning time

Round duration - 60 Minutes
Round difficulty - Medium

Timing: 11AM-12PM
The interviewer was SDE2
He was checking the code for edge cases and was hinting if required

Q1. 
Implementing a Priority Queue Using Heap
Ninja has been tasked with implementing a priority queue using a heap data structure. However, he is currently busy preparing for a tournament and has requested yo...read more
Ans. 
Implement a priority queue using a heap data structure with push, pop, getMaxElement, and isEmpty functions.
• Implement a priority queue using a max heap data structure.

• Use the provided class structure and complete the push, pop, getMaxElement, and isEmpty functions.

• For push operation, insert the element into the heap and maintain the heap property.

• For pop operation, remove the largest element from the heap.

• For getMaxEle...read more
Answered by AI
Add your answer
Q2. 
Ninja and the Bulbs Challenge
Ninja owns an electronic shop and possesses 'N' bulbs. To verify the quality of the bulbs, Ninja performs a unique technique. After 'N' rounds of this process, bulbs that rem...read more
Ans. 
Determine the number of good quality bulbs remaining after 'N' rounds of a unique technique.
• Start with all bulbs on in the first round

• Toggle every 'i' bulb in 'i' round

• Count the bulbs that remain on after 'N' rounds
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Timing: 6PM-7PM
The interviewer was not interactive and didn't gave any feedback whatsoever.
It was Hiring Manager Round
Interviewer was Software Development Manager at Amazon

Q1. 
Maximize the Sum Through Two Arrays
You are given two sorted arrays of distinct integers, ARR1 and ARR2. If there is a common element in both arrays, you can switch from one array to the other.
Your task...read more
Ans. 
Find the maximum sum by traversing through common elements in two sorted arrays.
• Start with the array containing the smaller first common element

• Switch arrays at common elements to maximize the sum

• Continue adding elements until the end of the arrays
Answered by AI
Add your answer