Harita Nti Interview Questions and Answers

Find the smallest and greatest numbers from an array of strings.

• Convert the array of strings to an array of numbers using parseInt() or Number()

• Use Math.min() and Math.max() to find the smallest and greatest numbers

• Handle edge cases like empty array or non-numeric values

Use a Set data structure to remove duplicates from the array of strings.

• Create a Set to store unique strings.

• Iterate through the array and add each string to the Set.

• Convert the Set back to an array to get the final result.

Memory internally works by storing data in binary format using cells called memory cells.

• Memory is made up of memory cells that store data in binary format (0s and 1s)

• Memory cells are organized in a hierarchical structure with different levels of access speed (registers, cache, RAM, disk)

• Data is retrieved from memory by specifying the memory address where the data is stored

• Memory operates based on the principle of read and write operations to access and modify data

• Examples of...read more

Hooks in Cucumber are blocks of code that run before or after each scenario in a feature file.

• Hooks can be used to set up preconditions before a scenario runs or clean up after a scenario completes.

• Common hooks include @Before and @After which run before and after each scenario respectively.

• Hooks can also be tagged to run only for specific scenarios using tags like @Before('@tagname').

Heap mechanism is a data structure that stores elements in a specific order to allow efficient retrieval of the maximum or minimum element.

• Heap is a complete binary tree where each node has a value greater than or equal to its children (max heap) or less than or equal to its children (min heap).

• Common operations on a heap include insertion, deletion, and heapify.

• Heapify is the process of converting a binary tree into a heap by maintaining the heap property.

A palindrome is a word, phrase, number, or other sequence of characters that reads the same forward and backward.

• Check if the given string is equal to its reverse

• Ignore spaces and punctuation when checking for palindrome

• Convert the string to lowercase for case-insensitive comparison