Upload Button Icon Add office photos

Filter interviews by

Valtech DOT NET Developer Interview Questions and Answers

Updated 13 Mar 2024

Valtech DOT NET Developer Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - HR 

(1 Question)

  • Q1. About previous experience
Round 2 - Technical 

(1 Question)

  • Q1. About c# basic concepts like polymorphism
Round 3 - HR 

(1 Question)

  • Q1. Team introduction, personality questions

Interview questions from similar companies

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(3 Questions)

  • Q1. Oop questions they will ask
  • Q2. C# basic string var dymaic out ref
  • Q3. Sql , dot net
Round 2 - Managment Round 

(2 Questions)

  • Q1. This round they will ask strategic question
  • Q2. How you will handle the team , deadlines
  • Ans. 

    I will handle the team by setting clear expectations, delegating tasks effectively, monitoring progress, and providing support as needed.

    • Set clear goals and deadlines for the team to ensure everyone is on the same page

    • Delegate tasks based on team members' strengths and workload

    • Regularly check in with team members to monitor progress and offer assistance if needed

    • Adjust deadlines or redistribute tasks as necessary to me...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - I was rejected in the second round, check what domain the company is working.
Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • 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...

Interview Questionnaire 

1 Question

  • Q1. Abstract claas

Interview Preparation Tips

Interview preparation tips for other job seekers - Oops, encapsulation, interface, private constructors
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Naukri.com and was interviewed in Nov 2024. There were 3 interview rounds.

Round 1 - Coding Test 

Coding round is related to DSA

Round 2 - Technical 

(2 Questions)

  • Q1. Java related questions
  • Q2. Explain about your project
Round 3 - HR 

(2 Questions)

  • Q1. Salary negotiation
  • Q2. Why you want to join us?
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - HR 

(1 Question)

  • Q1. General HR questions also a little bit about my experience
Round 2 - Technical 

(1 Question)

  • Q1. .net general questions like ref vs out, interface vs abstract class
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Approached by Company and was interviewed in Jul 2024. There were 5 interview rounds.

Round 1 - Coding Test 

Asked some basic level questions

Round 2 - Coding Test 

Asked little bit hard questions

Round 3 - Coding Test 

Asked depth questions and wrote some sample programs

Round 4 - Technical 

(1 Question)

  • Q1. Wrote some sample program
Round 5 - HR 

(1 Question)

  • Q1. Salary discussion
Interview experience
1
Bad
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
No response

I applied via Referral and was interviewed in Dec 2023. There was 1 interview round.

Round 1 - Technical 

(2 Questions)

  • Q1. Question are about interview
  • Q2. Answers about interview

I was interviewed in Mar 2022.

Round 1 - Coding Test 

(1 Question)

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...
  • 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...

  • Answered Anonymously
Round 2 - Video Call 

(1 Question)

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
Round 3 - Video Call 

(4 Questions)

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...

  • 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’...

  • Answered Anonymously
  • Q2. What is the difference between CHAR and VARCHAR2 data types in SQL?
  • Q3. What are the various types of constructors in C++?
  • Q4. What is the difference between overloading and overriding?
Round 4 - HR 

(1 Question)

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

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in GurgaonEligibility criteriaAbove 7 CGPAThought Works interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.

Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.

Tip 3 : Do at-least 2 good projects and you must know every bit of them.


 

Application resume tips for other job seekers

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.


 

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Jan 2022.

Round 1 - Coding Test 

(1 Question)

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 ...

  • 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 ...

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

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...

  • 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
  • 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...

  • 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...

  • Answered by AI
  • 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...

  • Answered by AI
Round 3 - HR 

Round duration - 60 minutes
Round difficulty - Easy

Round 4 - HR 

Round duration - 25 minutes
Round difficulty - Easy

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in HyderabadEligibility criteriaMinimum CGPA Required: 7.0F5 Networks interview preparation:Topics to prepare for the interview - Data Structure and Algorithms, Operating Systems, Object-Oriented Programming, Computer Networks, System DesignTime required to prepare for the interview - 12 monthsInterview preparation tips for other job seekers

Tip 1 : Practice a lot of DSA questions on various online platforms. 
Tip 2 : Regularly go back to some of the typical DSA questions.
Tip 3 : Give equal importance to OS, OOPS, and CN subjects.

Application resume tips for other job seekers

Tip 1 : Be thorough with your resume to answer anything and everything from your resume.
Tip 2 : Do not put false information on your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

Valtech Interview FAQs

How many rounds are there in Valtech DOT NET Developer interview?
Valtech interview process usually has 3 rounds. The most common rounds in the Valtech interview process are HR and Technical.
How to prepare for Valtech DOT NET Developer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Valtech. The most common topics and skills that interviewers at Valtech expect are .Net, .Net Core, ASP, C# and MVC.

Tell us how to improve this page.

Valtech DOT NET Developer Interview Process

based on 1 interview

Interview experience

4
  
Good
View more
Software Engineer
48 salaries
unlock blur

₹2.8 L/yr - ₹8.2 L/yr

Senior Software Engineer
34 salaries
unlock blur

₹6.7 L/yr - ₹27 L/yr

Lead Engineer
29 salaries
unlock blur

₹9.2 L/yr - ₹21 L/yr

Software Developer
20 salaries
unlock blur

₹4.5 L/yr - ₹15 L/yr

Technical Lead
18 salaries
unlock blur

₹15.8 L/yr - ₹36 L/yr

Explore more salaries
Compare Valtech with

TCS

3.7
Compare

Infosys

3.6
Compare

Wipro

3.7
Compare

HCLTech

3.5
Compare
Did you find this page helpful?
Yes No
write
Share an Interview