Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by ValGenesis Team. If you also belong to the team, you can get access from here

ValGenesis Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

ValGenesis Dot Net Fullstack Developer Interview Questions and Answers

Updated 28 Sep 2023

ValGenesis Dot Net Fullstack Developer Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
No response

I applied via Naukri.com and was interviewed in Aug 2023. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Technical 

(1 Question)

  • Q1. Initially asked about React js. How to create a componet. How do you Authorize,SOLID principles, Dependency injection
Round 3 - One-on-one 

(1 Question)

  • Q1. I was not informed yet about the round one

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare well on the overall basic concepts

Interview questions from similar companies

I applied via Company Website and was interviewed before May 2018. There were 3 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. Questions about Oops, data structures based on the projects I had done, and my resume
  • Q2. Questions about classes and abstraction

Interview Preparation Tips

Interview preparation tips for other job seekers - 2 parts; part 1 is a coding test and part 2 is discussion.

Interview Questionnaire 

9 Questions

  • Q1. Questions related to the work done at my previous company
  • Q2. Find if a given directed graph is cyclic or not
  • Ans. 

    To check if a directed graph is cyclic or not

    • Use Depth First Search (DFS) algorithm to traverse the graph

    • Maintain a visited set to keep track of visited nodes

    • Maintain a recursion stack to keep track of nodes in the current DFS traversal

    • If a node is visited and is already in the recursion stack, then the graph is cyclic

    • If DFS traversal completes without finding a cycle, then the graph is acyclic

  • Answered by AI
  • Q3. You have a stream of bytes from which you can read one byte at a time. You only have enough space to store one byte. After processing those bytes, you have to return a random byte. Note: The probability of...
  • Ans. 

    Return a random byte from a stream of bytes with equal probability.

    • Create a variable to store the count of bytes read

    • Create a variable to store the current random byte

    • For each byte read, generate a random number between 0 and the count of bytes read

    • If the random number is 0, store the current byte as the random byte

    • Return the random byte

  • Answered by AI
  • Q4. Find if a given Binary Tree is BST or not
  • Ans. 

    Check if a binary tree is a binary search tree or not.

    • Traverse the tree in-order and check if the values are in ascending order.

    • For each node, check if its value is greater than the maximum value of its left subtree and less than the minimum value of its right subtree.

    • Use recursion to check if all nodes in the tree satisfy the above condition.

  • Answered by AI
  • Q5. Devise an algorithm to determine the Nth-to-Last element in a singly linked list of unknown length. If N = 0, then your algorithm must return the last element. You should parse the list only once
  • Ans. 

    Algorithm to find Nth-to-Last element in a singly linked list of unknown length

    • Traverse the list and maintain two pointers, one at the beginning and one at Nth node from beginning

    • Move both pointers simultaneously until the second pointer reaches the end of the list

    • The first pointer will be pointing to the Nth-to-Last element

    • If N=0, return the last element

    • Parse the list only once

  • Answered by AI
  • Q6. Given an array of integers, print all possible permutations. Also explain your approach
  • Ans. 

    Print all possible permutations of an array of integers

    • Use recursion to swap elements and generate permutations

    • Start with the first element and swap it with each subsequent element

    • Repeat the process for the remaining elements

    • Stop when all elements have been swapped with the first element

    • Print each permutation as it is generated

  • Answered by AI
  • Q7. Design a Stack DS that also prints in O(1) the minimum element you pushed in the stack
  • Ans. 

    Design a stack that prints the minimum element pushed in O(1)

    • Use two stacks, one for storing elements and another for storing minimums

    • When pushing an element, compare it with the top of minimum stack and push the smaller one

    • When popping an element, pop from both stacks

    • To get the minimum element, just return the top of minimum stack

  • Answered by AI
  • Q8. Given a linked list with loop, how would you find the starting point of the loop ?
  • Ans. 

    To find the starting point of a loop in a linked list, use Floyd's cycle-finding algorithm.

    • Use two pointers, one moving at twice the speed of the other.

    • When they meet, move one pointer to the head of the list and keep the other at the meeting point.

    • Move both pointers one step at a time until they meet again, which is the starting point of the loop.

  • Answered by AI
  • Q9. Find a number a matrix mat[m][n] where all the rows and columns are sorted non-decreasingly. What will be the complexity of the solution
  • Ans. 

    To find a number in a matrix where all rows and columns are sorted non-decreasingly. Complexity of the solution.

    • Use binary search to find the number in each row and column

    • Start from the top-right corner or bottom-left corner to optimize search

    • Time complexity: O(m log n) or O(n log m) depending on the starting corner

  • Answered by AI

Interview Preparation Tips

Skills: Algorithm, Data structure
College Name: Na

Skills evaluated in this interview

I applied via Naukri.com and was interviewed before Jul 2019. There were 4 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. Questions about the projects you worked with. About how specific coding challenges were solved. How it could have been done other ways. etc.
  • Q2. About Python versions and differences. Impact on frameworks.
  • Q3. About module design, apis.

Interview Preparation Tips

Interview preparation tips for other job seekers - It is a relaxed interview, like a discussion. The questions are tough in that they make you think. Review your previous projects and be honest.
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I was interviewed before Feb 2022.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Technical 

(1 Question)

  • Q1. Linked list (detect loop, reverse, delte a node) tree (height, DFS) graph theory concept C++ basic questions
Round 3 - One-on-one 

(1 Question)

  • Q1. Total 3 round of Technical interviews.

Interview Preparation Tips

Interview preparation tips for other job seekers - C++ basics, Algo and Data structure and some basic concept of graph theory.
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. String palindrome
  • Q2. Find all anagrams in a string
  • Ans. 

    Find all anagrams in a string

    • Create a hashmap to store the frequency of characters in the input string

    • Iterate through the input string and check if the frequency of characters matches the hashmap for each substring of the same length

    • Store the substrings that are anagrams in an array and return it

  • Answered by AI

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Naukri.com and was interviewed before Jul 2023. There were 3 interview rounds.

Round 1 - Aptitude Test 

Aptitude test was of moderate level.

Round 2 - Coding Test 

One coding question was given.

Round 3 - One-on-one 

(2 Questions)

  • Q1. DSA questions were asked
  • Q2. Javascript questions

I applied via Naukri.com and was interviewed in Jan 2021. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Selected for developer role in MDM project ..concepts of match and merge In Reltio MDM,Reltio APi details and basic SQL

Interview Preparation Tips

Interview preparation tips for other job seekers - Do not stress out ,answer interview questions calmly .Try to make them understand your answers.
Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - One-on-one 

(1 Question)

  • Q1. Altered the skills and question's from Resume
Round 2 - Technical 

(1 Question)

  • Q1. Multithreading and Method Overriding
Round 3 - Technical 

(1 Question)

  • Q1. Asynchronous JavaScript
Round 4 - HR 

(1 Question)

  • Q1. It's all about figures

I applied via Approached by Company and was interviewed in Feb 2022. There were 2 interview rounds.

Round 1 - Technical 

(1 Question)

  • Q1. All questions related to my skill
Round 2 - One-on-one 

(1 Question)

  • Q1. Manager asked everything from my resume

Interview Preparation Tips

Interview preparation tips for other job seekers - Be prepared with your skill set. That is what all required

ValGenesis Interview FAQs

How many rounds are there in ValGenesis Dot Net Fullstack Developer interview?
ValGenesis interview process usually has 3 rounds. The most common rounds in the ValGenesis interview process are Resume Shortlist, Technical and One-on-one Round.
What are the top questions asked in ValGenesis Dot Net Fullstack Developer interview?

Some of the top questions asked at the ValGenesis Dot Net Fullstack Developer interview -

  1. Initially asked about React js. How to create a componet. How do you Authorize,...read more
  2. I was not informed yet about the round ...read more

Tell us how to improve this page.

ValGenesis Dot Net Fullstack Developer Interview Process

based on 1 interview

Interview experience

4
  
Good
View more

Interview Questions from Similar Companies

IQVIA Interview Questions
3.9
 • 464 Interviews
Fingent Interview Questions
4.4
 • 22 Interviews
Backbase Interview Questions
3.9
 • 22 Interviews
Khoros Interview Questions
3.7
 • 19 Interviews
3Pillar Global Interview Questions
3.3
 • 19 Interviews
Mentor Graphics Interview Questions
4.0
 • 18 Interviews
Yodlee Interview Questions
3.8
 • 17 Interviews
Workday Interview Questions
4.1
 • 17 Interviews
Bottomline Interview Questions
3.3
 • 17 Interviews
View all
Software Engineer
88 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
57 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Test Engineer
53 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Business Analyst
32 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Test Engineer
28 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare ValGenesis with

Cunesoft GmbH

3.5
Compare

MasterControl

3.9
Compare

Sparta Systems Inc.

4.1
Compare

Aras Corp

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