AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Questionpro Senior .NET Developer Interview Questions and Answers
Questionpro Senior .NET Developer Interview Experiences
1 interview found
Anonymous
I applied via LinkedIn and was interviewed in Jan 2021. There were 3 interview rounds.
Interview Questionnaire
4 Questions
- Q1. Basic OOP
- Q2. DB schema creation for cinducting an online test
- Ans.
DB schema for online test
Create tables for questions, answers, users, and results
Use foreign keys to link tables together
Include fields for question type, difficulty level, and time limit
Store user responses and calculate scores
Consider security measures to prevent cheating
- Q3. Explain yourself in detail
- Q4. Architecture for your project and if required what changes you need to do
Interview Preparation Tips
Skills evaluated in this interview
Top trending discussions
Interview questions from similar companies
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 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
- 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
- Q4. Find if a given Binary Tree is BST or not
- 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
- 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
- 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
- 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.
- 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
Interview Preparation Tips
College Name: Na
Skills evaluated in this interview
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
I applied via Campus Placement and was interviewed in Sep 2021. There was 1 interview round.
Interview Preparation Tips
Selected
I appeared for an interview before Feb 2022.
(1 Question)
- Q1. Linked list (detect loop, reverse, delte a node) tree (height, DFS) graph theory concept C++ basic questions
(1 Question)
- Q1. Total 3 round of Technical interviews.
Interview Preparation Tips
(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
Skills evaluated in this interview
I applied via Campus Placement
Aptitude questions with 2-3 coding questions
(2 Questions)
- Q1. Input-wwwrrrrttttuu Output - w3r4t4u2
- Q2. Interpreter vs compiler
- Ans.
Interpreter executes code line by line, compiler translates code into machine code before execution.
Interpreter translates code into machine code line by line during runtime
Compiler translates code into machine code before execution
Interpreted languages include Python, JavaScript
Compiled languages include C, C++
I applied via Referral and was interviewed in Feb 2024. There were 3 interview rounds.
Implement tail -f command
(2 Questions)
- Q1. Kafka partitions
- Q2. Elasticsearch queries
(2 Questions)
- Q1. Why Browserstack?
- Ans.
Browserstack is a popular cloud-based cross-browser testing tool used by developers worldwide.
Provides access to a wide range of browsers and devices for testing
Allows for parallel testing to save time and increase efficiency
Integrates with popular testing frameworks like Selenium and Appium
Offers features like screenshots, video recordings, and debugging tools
Used by companies like Microsoft, Twitter, and Airbnb for t...
- Q2. Any challenge you faced at current company?
- Ans.
Yes, I faced a challenge in integrating a new third-party API with our existing system.
Had to understand the documentation of the API thoroughly
Encountered compatibility issues with our system
Worked closely with the API provider to troubleshoot and resolve issues
(1 Question)
- Q1. Implement tail f
- Ans.
Implementing 'tail -f' allows real-time monitoring of file changes, displaying new lines as they are added.
Use file handling in Python to open a file in read mode.
Utilize a loop to continuously read new lines from the file.
Implement a sleep function to avoid busy waiting and reduce CPU usage.
Example: Use 'with open(filename) as f:' to manage file context.
Use 'f.seek(0, 2)' to move to the end of the file before reading ...
Interview Preparation Tips
Tell us how to improve this page.
Questionpro Interviews By Designations
- Questionpro Senior Java Developer Interview Questions
- Questionpro Softwaretest Engineer Interview Questions
- Questionpro Devops Engineer Interview Questions
- Questionpro Associate Software Developer Interview Questions
- Questionpro Site Reliability Engineer Interview Questions
- Questionpro Senior .NET Developer Interview Questions
- Questionpro Senior Quality Analyst Interview Questions
- Questionpro Accounts Manager Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Developer Interview Questions
- Java Developer Interview Questions
- Senior Engineer Interview Questions
- Senior Consultant Interview Questions
- Web Developer Interview Questions
- Senior Software Developer Interview Questions
- Application Developer Interview Questions
- Salesforce Developer Interview Questions
- Show more
Interview Questions from Similar Companies
|
Technical Support Engineer
37
salaries
|  ₹3.2 L/yr - ₹7.5 L/yr |
|
Customer Success Manager
23
salaries
| ₹6.6 L/yr - ₹13 L/yr |
|
Senior Java Developer
21
salaries
| ₹7.4 L/yr - ₹31.4 L/yr |
|
Software Engineer
21
salaries
| ₹7.9 L/yr - ₹15.6 L/yr |
|
Product Manager
20
salaries
| ₹12.6 L/yr - ₹22.7 L/yr |
Yodlee
Fingent
Bravura Solutions
CloudMoyo
- Home >
- Interviews >
- Questionpro Interview Questions
