i
Mastech InfoTrellis
Filter interviews by
I applied via Campus Placement
Work on the general aptitude questions and answers
Work on Java questions
Gave a topic and asked us to discuss on it
Top trending discussions
I applied via campus placement at Galgotias College of Engineering and Technology, Greater Noida and was interviewed in Aug 2024. There were 2 interview rounds.
Yes, I am willing to take an assessment test to demonstrate my skills and knowledge.
I am open to taking any assessment test required for the position.
I believe that assessment tests are a valuable tool for evaluating candidates.
I am confident in my abilities and knowledge to perform well on the assessment test.
I have been out of college for 3 years.
I graduated in 2018.
I have been working in the industry since then.
I have gained valuable experience in my field during this time.
I applied via Approached by Company
Joining tables with different joins in SQL
Use INNER JOIN to return rows when there is at least one match in both tables
Use LEFT JOIN to return all rows from the left table and the matched rows from the right table
Use RIGHT JOIN to return all rows from the right table and the matched rows from the left table
Use FULL JOIN to return rows when there is a match in one of the tables
I applied via Company Website and was interviewed in Apr 2023. There were 2 interview rounds.
A zero coupon bond is a bond that pays no interest and is sold at a discount to its face value.
Zero coupon bonds are also known as discount bonds.
Investors buy these bonds at a price lower than their face value and receive the full face value at maturity.
The difference between the purchase price and the face value is the investor's return.
Zero coupon bonds are often used for long-term investments, such as retirement sa...
Corporate actions are events initiated by a company that can affect its stock price and shareholders. They are recorded in books through various accounting entries.
Corporate actions include stock splits, dividends, mergers, acquisitions, and spin-offs.
These actions are recorded in books through journal entries and adjustments to accounts such as retained earnings and stockholders' equity.
For example, if a company decla...
posted on 18 Sep 2024
I applied via Referral and was interviewed in Aug 2024. There were 3 interview rounds.
Given a list of integer find the longest increase sequence
Find the first non-repeating integer in a list using Java 8 stream API.
Use Java 8 stream API to group integers by count
Filter out integers with count greater than 1
Return the first non-repeating integer
Using Java 8 Stream API to find the fruit with maximum price in a Map of fruits.
Use entrySet() method to get a stream of key-value pairs from the Map.
Use max() method with Comparator.comparing() to find the entry with maximum price.
Extract the key (fruit) from the entry with maximum price.
Program to check if parenthesis are properly balanced
Use a stack data structure to keep track of opening parenthesis
Iterate through the input string and push opening parenthesis onto the stack
When a closing parenthesis is encountered, pop from the stack and check if it matches the corresponding opening parenthesis
If stack is empty at the end and all parenthesis are matched, then the input has properly balanced parenthe
posted on 9 Oct 2024
Easy applitute question with 1 coding question at the end
String builder is faster but not thread-safe, while string buffer is slower but thread-safe.
String builder is recommended for single-threaded applications for better performance.
String buffer is recommended for multi-threaded applications to ensure thread safety.
Example: StringBuilder sb = new StringBuilder(); StringBuffer sbf = new StringBuffer();
The final keyword in OOP is used to restrict the user from changing the value of a variable, overriding a method, or inheriting from a class.
Final variable: value cannot be changed once assigned
Final method: cannot be overridden in child classes
Final class: cannot be inherited by other classes
BSF graph explanation
BFS (Breadth-First Search) is a graph traversal algorithm that explores all the neighbor nodes at the present depth before moving on to the nodes at the next depth.
It uses a queue data structure to keep track of the nodes to visit next.
BFS is often used to find the shortest path in an unweighted graph.
Example: BFS can be used to find the shortest path in a maze from the starting point to the exit.
I applied via Campus Placement
Its a sectional round. It has 4 sections. Quants, Logical, pseudo code, Reasoning, Gaming
posted on 4 Sep 2024
I applied via Naukri.com and was interviewed in Aug 2024. There were 2 interview rounds.
Basic aptitude question
Based on puzzle comprehension
posted on 25 May 2024
I applied via Naukri.com and was interviewed in Apr 2024. There were 3 interview rounds.
25 MCQ , 2 short essays
Interview experience
based on 4 reviews
Rating in categories
Big Data Specialist
21
salaries
| ₹8.6 L/yr - ₹18 L/yr |
Associate
19
salaries
| ₹4.5 L/yr - ₹14 L/yr |
Quality Analyst
19
salaries
| ₹7.1 L/yr - ₹9 L/yr |
Mdm Specialist
17
salaries
| ₹6.5 L/yr - ₹16 L/yr |
Senior Technical Consultant
12
salaries
| ₹10 L/yr - ₹15 L/yr |
TCS
Infosys
Wipro
HCLTech