Tip 1 : Participate regularly in coding contests on various platforms such as Leetcode , Codeforces , Codechef.
Tip 2 : Go through many different approaches to solve a problem and also visit Leetcode discuss section it is very helpful.
Tip 3 : Do atleast 2 projects.
Tip 1 : Don't make resume more than one page.
Tip 2 : Put only those things in resume which you are confident don't try to bluff in resume.
it was afternoon.
interviewer was supportive.



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.
it can be solved by two pointer approach at each stage we can calculate what is the maximum water that can be trapped. and we will increment left pointer or decrement right pointer accordingly whichever side is smaller we will leave it until left pointer moves beyond right pointer or they are at same place.
it was in evening. Interviewer was good.



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.
firstly sort all the strings ( as we know that all the anagrams after sorting become the same string) and then we can easily solve it by using hashmap and recording indices.
HR was very supportive. he asked about my family background and some easy aptitude related problems.
how much maximum score a batsman can score in ODI of 50 overs
Tip 1 : I he hits 5 sixes on first 5 balls of every over and on the last ball he can take3 runs by running and by this he can again come on strike in a cricket match.
Tip 2 : You can also ask whether i have to consider the cases of throwby , legby or not.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
How do you remove whitespace from the start of a string?