BOLD Technology Systems DOT NET Developer Interview Questions and Answers

The exam duration is one and a half hours.

The total exam time is one and a half hours.

It encompasses all topics related to full stack development.

Q1. Asks questions on SQL
Add your answer
Q2. Asks question in typical topics
Add your answer

Q1. Where do you see yourself in two years?
Ans. 
In two years, I see myself as a senior software developer leading a team on innovative projects.
• Advancing to a senior software developer role

• Leading a team on new and innovative projects

• Continuing to enhance my technical skills through ongoing learning and training
Answered by AI
Add your answer

Q1. LRU Cache - how to tackle
Ans. 
LRU Cache is a data structure that maintains a list of items in order of most recently used to least recently used.
• Implement using a doubly linked list and a hashmap for efficient operations

• When an item is accessed, move it to the front of the list

• When the cache is full, remove the least recently used item from the end of the list
Answered by AI
Add your answer
Q2. LRU Cache implementation based on a real time system. How would the main work which will be called etc etc
Add your answer

Q1. It was lld question to design a cab booking system.
Add your answer
Q2. Tell me about yourself
Add your answer

HAckerrank based test

It was having english and maths questions

Code was easy kindly do pratice

I haven't appeared but this website asking me everytime that's why giving review but I wanted to know what are the ratings for this company

Q1. I haven't appeared but ratings it
Add your answer
Q2. Why you choose uplers
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This was just a screening round to check my intention and communication skills. They just asked me why was I looking for a job change, and told me a little bit about the profile.

Round duration - 45 Minutes
Round difficulty - Easy

Since I had applied for a full stack profile, this round mainly consisted of front-end questions and some basic DSA questions. They had scheduled a call in the afternoon around 14:00 and the call was on Google meet where I had to share my screen and type in some code, once I was happy with my code and it worked fine, I had to paste it into the google doc. Actually, they had outsourced the interview rounds to the Interview Vector.

Q1. 
Flatten 2D Array Problem
Implement an iterator called ‘FLATTEN_2D’ to transform a two-dimensional array ‘ARR_2D’ into a one-dimensional array ‘ARR_1D’. The iterator should support the following operations...read more
Ans. 
Basic DFS.
- Create an empty array and call it the result.
- Loop over the content of the array if it's a number push it into the result array else recursively call the function.
- Return the resultant array.
Answered Anonymously
Add your answer
Q2. Implement a function 'sum' such that the following conditions hold: sum(1)(2)(3)(4)() returns 10, sum(1)() returns 1, and sum() returns 0.
Add your answer

Round duration - 90 Minutes
Round difficulty - Easy

This round consisted of multiple easy DSA questions, some frontend questions, and one thought experiment related to design. Again, this round was conducted around 14:00 in the afternoon.

Q1. 
Anagram Pairs Verification Problem
Your task is to determine if two given strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the...read more
Ans. 
- Compare length of the strings and if they are not equal return false.
- Take a hashmap and store the number of occurrences of each letter in the first string.
- Iterate over the second string and if the ith character is not in the hashmap or the frequency is 0 then return false.
- return true.
Answered Anonymously
Add your answer

Simple DSA ques. and some mcqs. were easy if you are a cp guy

Q1. Given a string of paranthesis tell longest valid parantheisis
Ans. 
Use stack to keep track of indices of opening parentheses, update max length when closing parentheses found
• Use a stack to keep track of indices of opening parentheses

• When a closing parentheses is found, update max length by calculating the difference between current index and top of stack

• Handle edge cases like extra closing parentheses or unmatched opening parentheses

• Example: Input: "(()()", Output: 4 (for "()()")
Answered by AI
Add your answer
Q2. Leetcode 1443. This was exact ques
Add your answer

Q1. Given a string find longest palindromeic substring
Ans. 
Find the longest palindromic substring in a given string.
• Use dynamic programming to check for palindromes within the string.

• Start by checking for palindromes of length 1 and 2, then expand to longer substrings.

• Keep track of the longest palindrome found so far.
Answered by AI
Add your answer
Q2. Simple take not take dp ques But my interviewer was an idiot she didn't understand shit She was reading editorial on the fly. As i told her approch she was like its wrong then read editorial and was fine. ...read more
Add your answer