Tip 1 : Focus on data structure and algorithms , logic building and problem solving
Tip 2 : Have some(2 or 3) good projects in order to have some knowledge of development
Tip 3 : Be confident while giving the interviews
Tip 1 : Don't put irrelevent information in your resume for the sake of filling the page
Tip 2 : Have 2 or 3 good projects and put only the technologies and programming languages to which you are really confident
There were three coding questions with easy and medium difficulties and 90 minutres to solve these questions
If the given array is {1,5,2}, the returned array should be {1,5,3}.
Input array can contain leading zeros, but the output array should not contain any leading zeros (even if the input array contains leading zeroes).
For Example:
If the given array is {0,2}, the returned array should be {3}.
For numbers less than or equal to 8 - can directly be incremented by 1
and for number which is equal to 9 - will be replaced with 0 and generate a carry.
That carry will be further added to the beginning.
1. A “fraction” is not a whole number. It is a part of a whole.
2. When the numerator and denominator of a fraction are no longer to be reduced to any smaller number upon division by any common integer, the fraction is known as a “simplified fraction”.
3. For example, 1/2 is a simplified fraction but 2/4 is not a simplified fraction as we can reduce 2/4 to 1/2.
This was basically a technical round and I was given a coding problem and 45 minutes to code it and last 15 minutes we had a discussion on one of my project
The same letter cell should not be used more than once.
For a given word “design” and the given 2D board
[[q’, ‘v’, ‘m’, ‘h’],
[‘d’, ‘e’, ‘s’, ‘i’],
[‘d’, ‘g’, ‘f’, ‘g’],
[‘e’, ‘c’, ‘p’, ‘n’]]
The word design can be formed by sequentially adjacent cells as shown by the highlighted color in the 2nd row and last column.
I used recursive approach to solve this problem and ran DFS (Depth First Search) from each positions of matrix checking if that word is present starting from that position.
This was a HM (Hiring Manager) round and He asked some questions on my project like challenges and sollutions proposed and a coding problem
‘num’ does not have leading zeros except when ‘num’ equals zero.
Input: ‘num’ = ‘141’ , ‘k’ = 1.
Output: ‘11’
Explanation: By removing only 1 digit from ‘num’, 3 numbers can be formed: 14, 11, and 41. Out of which 11 is the smallest number.
You don’t have to print anything. It has already been taken care of. Just implement the given function.
Step-1: I used stack data structure to solve this problem
Step-2: We initially push an element into the stack(non zero).
Step-3: When we encounter the next element we check if it is smaller than the element present in the stack if so pop the element from the stack and push this element. Why? because he current element has the capacity
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Which SQL keyword removes duplicate records from a result set?