Tip 1 : Be clear about the basics and DSA algorithms
Tip 2 : Have a good knowledge about anything you mentioning in your resume
Tip 1 : Mention the project you have worked and have good knowledge on
Tip 2 : Have a development skill



We cannot use the element at a given index twice.
Try to do this problem in O(N) time complexity.



In order to traverse through the lists to find the point at which they merge, we need to set two different pointers. One for the first singly linked list, another for the second. Remember that we are given the heads of both as parameters, so we will set our pointers to them in order to start from the beginning of each.
Theory + coding question based on problem and array



Given 'S' : abcdg
Then output will be : 1 1 1 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
Tip 1 : Create an empty array with size of 26(total alphabets)
Tip 2 : Run a loop through the sentence
Tip 3 : Use ascii value to count the occurrence of the alphabet
HR questions
Questions were based on situations like what you are going to do or what should be your approach in a certain situation?
Asked about my project.

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?