SDE - Intern

You are given three integers: d, e, and f. Your task is to count the number of special d-digit numbers that satisfy a specific condition.

A d-digit number is considered special based on the digits allowed at each position (1-indexed, from left to right):

  If a digit's position k is a prime number (2, 3, 5, 7, ...), the digit at that position must be one of {2, 3, 5, 7}.

  If a digit's position k is not a prime number (1, 4, 6, 8, ...), the digit at that position must be one of {0, 1, 4, 6, 8, 9}.

Additionally, a valid d-digit number cannot have a leading zero.

The condition to satisfy is that when the special d-digit number is taken modulo e, the remainder must be exactly f.

You need to return the total count of such numbers, with the final answer taken modulo 10^9 + 7.

You are given n servers, indexed from 0 to n-1. Each server i has a specific sendTime[i], which dictates how it can transmit information. In a single step, a server at index i can send information to:

The server at index i + sendTime[i], if this index is within the bounds [0, n-1].

The server at index i - sendTime[i], if this index is within the bounds [0, n-1].

Initially, only the last server (at index n-1) possesses a piece of information. This information then spreads through the network in steps.

Your task is to determine the minimum number of steps required for each server to receive the information. If a server is unreachable from the starting server, its minimum number of steps is considered -1.

You are given the positions of N cubes on a 1D line, represented by an array X. You are allowed to remove at most K cubes from this line.

Your goal is to find a configuration of remaining cubes that minimizes the maximum distance between any two adjacent cubes.

For example, if the remaining cubes are at positions [1, 5, 12], the adjacent distances are (5-1)=4 and (12-5)=7. The maximum adjacent distance is 7.

You need to find the minimum possible value for this maximum adjacent distance.

Ninja is given an array of integers that contain numbers in random order. He needs to write a program to find and return the number which occurs the maximum times in the given input. He needs your help to solve this problem.

If two or more elements contend for the maximum frequency, return the element which occurs in the array first i.e. whose index is lowest.

For example,

For 'arr' = [ 1, 2, 3, 1, 2]. you need to return 1.

You have been given an array/list of strings 'inputStr'. You are supposed to return the strings as groups of anagrams such that strings belonging to a particular group are anagrams of one another.

An anagram is a word or phrase formed by rearranging the letters of a different word or phrase. We can generalize this in string processing by saying that an anagram of a string is another string with the same quantity of each character in it, in any order.

Note:

The order in which the groups and members of the groups are printed does not matter.

For example:

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.

Explain the four primary HTTP methods — GET, POST, PUT, and DELETE — and their purposes in REST APIs. (Learn)

• List and explain the four necessary conditions for deadlock — Mutual Exclusion, Hold and Wait, No Preemption, and Circular Wait. (Learn)
• Explain what virtual memory is and how it helps manage limited physical memory efficiently. (Learn)
• Differentiate between paging and segmentation. (Learn)

Explain what indexing is, its types (primary, secondary, clustered, non-clustered), and how it improves query performance. (Learn)