Shiprocket Private Limited Softwaretest Engineer Interview Questions and Answers

My name is John Smith.

• Full name is John Smith

• Common name in English-speaking countries

• No middle name or initial

In my free time, I enjoy hiking, playing video games, and learning new programming languages.

• Hiking in local trails and national parks

• Playing video games like Overwatch and Minecraft

• Learning new programming languages like Python and JavaScript

I am a software developer with 5 years of experience in Java and Python.

• Experienced in Java and Python programming languages

• Worked on various projects involving web development and data analysis

• Familiar with Agile methodologies and version control systems like Git

Dynamic Programming problem involving finding the maximum sum of non-adjacent elements in an array.

• Use dynamic programming to keep track of the maximum sum at each index.

• At each index, the maximum sum is either the current element plus the sum two indices back, or the sum at the previous index.

• Example: For array [2, 4, 6, 2, 5], the maximum sum of non-adjacent elements is 13 (2 + 6 + 5).

Find the longest common prefix among an array of strings.

• Iterate through the characters of the first string and compare with other strings

• Return the prefix when characters don't match or reach end of any string

• Example: Input - ['flower', 'flow', 'flight'], Output - 'fl'

LRU cache is a data structure that stores the most recently used items.

• Use a doubly linked list to keep track of the order of items based on their usage.

• Use a hashmap to quickly access items in the cache.

• When a new item is accessed, move it to the front of the linked list.

• If the cache is full, remove the least recently used item from the end of the linked list.