Valtech DOT NET Developer Interview Questions and Answers

Q1. Design pattern, write code to check lower case upper case, write singleton with lock, oops questions, what is cte, difference between sp and view, find highest salary in sql, Azure concepts for service bus...read more
Add your answer

Coding round is related to DSA

Q1. Java related questions
Add your answer
Q2. Explain about your project
Add your answer

Q1. Salary negotiation
Add your answer
Q2. Why you want to join us?
Add your answer

Q1. General HR questions also a little bit about my experience
Add your answer

Q1. .net general questions like ref vs out, interface vs abstract class
Add your answer

Asked some basic level questions

Asked little bit hard questions

Asked depth questions and wrote some sample programs

Q1. Wrote some sample program
Add your answer

Q1. Salary discussion
Add your answer

Q1. Question are about interview
Add your answer
Q2. Answers about interview
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Mcq + Data structures questions

Q1. 
Maximum Sum Subarray Problem Statement
Given an array of integers, find the maximum sum of any contiguous subarray within the array.
Example:
Input:
array = [34, -50, 42, 14, -5, 86]
Output:
137
Exp...read more
Ans. Brute Force Approach
1. Create a nested loop. The outer loop will go from i = 0 to i = n - k. This will cover the starting indices of all k-subarrays
2. The inner loop will go from j = i to j = i + k - 1. This will cover all the elements of the k-subarray starting from index i
3. Keep track of the maximum element in the inner loop and print it.
Space Complexity: O(1)Explanation:
O(1) because the extra space being used (looping vari...read more
Answered Anonymously
View 1 more answer

Round duration - 70 minutes
Round difficulty - Medium

Standard System Design round

Q1. Design a Doctor Appointment System and provide some test cases.
Ans. 
Tip 1 : Implement using OOPs 
Tip 2 : Try to tell your approach to the interviewer as much as you can side by side
Answered Anonymously
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Interview of DSA + OOPS + Databse(SQL query) + Operating System

Q1. 
Left View of a Binary Tree
Given a binary tree, your task is to print the left view of the tree. The left view of a binary tree contains the nodes visible when the tree is viewed from the left side.
Inpu...read more
Ans. Recursive Approach
This problem can be solved through recursion.We will maintain max_level variable which will keep track of maxLevel and will pass current level in recursion as argument. Whenever we see a node whose current level is more than maxLevel then we will print that node as that will be first node for that current level. Also update maxLevel with current level.
Space Complexity: O(n)Explanation:
O(N), where ‘N’...read more
Answered Anonymously
Add your answer
Q2. What is the difference between CHAR and VARCHAR2 data types in SQL?
View 1 more answer
Q3. What are the various types of constructors in C++?
Add your answer
Q4. What is the difference between overloading and overriding?
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Hr round - normal hr questions + situational 

Thoughtworks community discussion

Q1. Why should we hire you?
Ans. 
Tip 1 : Read all Thoughtworks community page and be honest

Tip 2 : Be open-minded and answer whatever you are thinking, in these rounds I feel it is important to have opinion.

Tip 3 : The cross-questioning can go intense sometimes, think before you speak.
Answered Anonymously
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Q1. 
Cycle Detection in a Singly Linked List
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next points back to a previous node in the ...read more
Ans. 
The task is to determine if a given singly linked list forms a cycle or not.
• A cycle occurs when a node's next points back to a previous node in the list.

• To solve this problem, we can use the Floyd's Cycle-Finding Algorithm.

• The algorithm uses two pointers, one moving at a normal pace and the other moving twice as fast.

• If there is a cycle, the fast pointer will eventually catch up to the slow pointer.

• If the fast pointer ...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Q1. 
Minimum Depth of a Binary Tree
Determine the minimum depth of an integer-based binary tree. The minimum depth is defined as the number of nodes present along the shortest path from the root node down to t...read more
Ans. 
The minimum depth of a binary tree is the number of nodes along the shortest path from the root node down to the nearest leaf node.
• The minimum depth can be found by performing a breadth-first search (BFS) traversal of the binary tree

• During the BFS traversal, keep track of the current level and increment the depth by 1 for each level

• Stop the BFS traversal when a leaf node is encountered and return the depth as the minim
Answered by AI
Add your answer
Q2. 
Intersection of Two Arrays Problem Statement
Given two arrays A and B with sizes N and M respectively, both sorted in non-decreasing order, determine their intersection.
The intersection of two arrays in...read more
Ans. 
The problem is to find the intersection of two sorted arrays.
• Use two pointers to iterate through the arrays.

• Compare the elements at the current pointers and move the pointers accordingly.

• If the elements are equal, add it to the intersection array and move both pointers.

• If the element in the first array is smaller, move the first pointer.

• If the element in the second array is smaller, move the second pointer.

• Repeat until...read more
Answered by AI
Add your answer
Q3. What is the difference between a mutex and a semaphore?
Ans. 
A mutex is a binary semaphore used for mutual exclusion, while a semaphore is a generalized synchronization primitive.
• Mutex is used to protect a critical section of code, allowing only one thread to access it at a time.

• Semaphore is used to control access to a shared resource, allowing multiple threads to access it simultaneously.

• Mutex has ownership, meaning the thread that locks it must unlock it.

• Semaphore does not hav...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Round duration - 25 minutes
Round difficulty - Easy