Tip 1 : Consistency
Tip 2 : Never Give Up
Tip 3 : Learn from the mistakes
Tip 1 : Simple and short providing the required information
Tip 2 : Single page resume with showing all the multiple projects which have done.
It was conducting in the afternoon, With great environment, and challenging questions
We cannot use the element at a given index twice.
Try to do this problem in O(N) time complexity.
First tried with brute force. It was working.
Then tried to optimised it using the Min-Max Array
1. You can not slant the container i.e. the height of the water is equal to the minimum height of the two lines which define the container.
2. Do not print anything, you just need to return the area of the container with maximum water.
For the above Diagram, the first red marked line is formed between coordinates (2,0) and (2,10), and the second red-marked line is formed between coordinates (5,0) and (5,9). The area of water contained between these two lines is (height* width) = (5-2)* 9 = 27, which is the maximum area contained between any two lines present on the plane. So in this case, we will return 3* 9=27.
Coding + Core CS
The order in which the groups and members of the groups are printed does not matter.
inputStr = {"eat","tea","tan","ate","nat","bat"}
Here {“tea”, “ate”,” eat”} and {“nat”, “tan”} are grouped as anagrams. Since there is no such string in “inputStr” which can be an anagram of “bat”, thus, “bat” will be the only member in its group.
Used Array of vectors and storing the similar anagrams in a list and appending it to the array element.
System Design + Core CS
Bank System Design
Tip 1 : Keep it simple
Tip 2 : Try to normalize
Tip 3 : Should be related without redundancy
Simple Basic HR Fitment
Asked questions like,Hobbies and interests
Family background
Why hashedin?
Your strengths and weaknesses.
Some situation-based questions
Tip 1 : Be clear
Tip 2 : should be smart in answering the questions
Tip 3 : Should not over behave.
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Which collection class forbids duplicates?