Software Engineer

Create a matrix min_cost[n+1][W+1], where n is the number of distinct weighted packets of oranges, and W is the maximum capacity of the bag.

Initialize the 0th row with INF (infinity) and the 0th column with 0.

Now, fill the matrix:

• If wt[i-1] > j, then min_cost[i][j] = min_cost[i-1][j].
• If wt[i-1] ≤ j, then min_cost[i][j] = min(min_cost[i-1][j], val[i-1] + min_cost[i][j - wt[i-1]]).

If min_cost[n][W] == INF, then the output will be -1, because this means that we cannot form weight W using these weights. Otherwise, the output will be min_cost[n][W].

The code implements a solution class that takes a board of characters and a list of words as input. It then performs a depth-first search to find if the words are present on the board. If a word is found, it is added to the output along with its position on the board. The code uses a visited array to keep track of the cells that have been visited during the search. Finally, the function returns a vector of strings, where each string is a word followed by its position on the board.

Tip 1: Practice previously asked puzzles.
Tip 2: Explain your thought process to the interviewer.

Take two nodes, slowPtr and fastPtr, such that next points to the head.
Take one node to store the head; initially, it’s a dummy node (start), and the next of this node will point to the head. The dummy node is used to handle the edge case where B = N (size of the linked list).

Start traversing until the fast pointer reaches the nth node.
Then, traverse both pointers one step at a time until the fast pointer reaches the end.
Once the traversal is complete, delete the node next to slowPtr.
Finally, return the next of start.

Tip 1: Ask your doubts about your role.
Tip 2: Prepare for basic HR questions.
Tip 3: Show willingness to learn.