Today ❤️

HI Good Morning,

*Pune* base one of the leading *IT Healthcare company* is Hiring for below profiles for *Singhgad road, Pune* Location, *Work from Office only*, *Experience min 1 - 4 Years* on similar technologies,

Profile 1 – Laravel (Vacancy 1)
Profile 2 – Node Js, React Js, Angular, Kotlin (Vacancy 2)
Profile 3 – Flutter (Vacancy 1)
Profile 4 – Graphic (Vacancy 1)
Profile 5 – PHP (Vacancy 2)

Interested Please DM resumes (NO CALLS PLZ)

Freshers can also apply

Need 2-4 yrs exp for react
And it’s 100% WFO

One project = 100s of files and increasing

this is what happens to a mnc when a non-professional gets hired

Almost everything about java is covered

Array Addition
Have the function ArrayAddition(arr) take the array of numbers stored in arr and return the string true if any combination of numbers in the array (excluding the largest number) can be added up to equal the largest number in the array, otherwise return the string false. For example: if arr contains [4, 6, 23, 10, 1, 3] the output should return true because 4 + 6 + 10 + 3 = 23. The array will not be empty, will not contain all the same elements, and may contain negative numbers.
Examples
Input: new int[] {5,7,16,1,2}
Output: false
Input: new int[] {3,5,-1,8,12}
Output: true

LRU Cache
Have the function LRUCache(strArr) take the array of characters stored in strArr, which will contain characters ranging from A to Z in some arbitrary order, and determine what elements still remain in a virtual cache that can hold up to 5 elements with an LRU cache algorithm implemented. For example: if strArr is ["A", "B", "C", "D", "A", "E", "D", "Z"], then the following steps are taken:

(1) A does not exist in the cache, so access it and store it in the cache.
(2) B does not exist in the cache, so access it and store it in the cache as well. So far the cache contains: ["A", "B"].
(3) Same goes for C, so the cache is now: ["A", "B", "C"].
(4) Same goes for D, so the cache is now: ["A", "B", "C", "D"].
(5) Now A is accessed again, but it exists in the cache already so it is brought to the front: ["B", "C", "D", "A"].
(6) E does not exist in the cache, so access it and store it in the cache: ["B", "C", "D", "A", "E"].
(7) D is accessed again so it is brought to the front: ["B", "C", "A", "E", "D"].
(8) Z does not exist in the cache so add it to the front and remove the least recently used element: ["C", "A", "E", "D", "Z"].

Now the caching steps have been completed and your program should return the order of the cache with the elements joined into a string, separated by a hyphen. Therefore, for the example above your program should return C-A-E-D-Z.
Examples
Input: new String[] {"A", "B", "A", "C", "A", "B"}
Output: C-A-B
Input: new String[] {"A", "B", "C", "D", "E", "D", "Q", "Z", "C"}
Output: E-D-Q-Z-C

Today's interview questions

Package 18L