Am looking for Java spring boots - 5 positions for remote work.
0 - 2yrs experience required.
Budget : upto 30k/month
Freshers - will be paid basis assessments on the task assigned. First month no salary (further induction will be purely on adoption and dedication to the learning)
Send profiles to hr@hireright.work
Job location : Remote
Assets: BYOD (self sponsored laptop)
0 - 2yrs experience required.
Budget : upto 30k/month
Freshers - will be paid basis assessments on the task assigned. First month no salary (further induction will be purely on adoption and dedication to the learning)
Send profiles to hr@hireright.work
Job location : Remote
Assets: BYOD (self sponsored laptop)
I want few developers who are very good at JAVA, ANGULAR, FLUTTER for my own project can pay them around 10k per month
Forwarded from Aman Raj
1. Process Allocation
There are n processes to be executed, and the ith process has a size of processSize[i], where 1 ≤ i ≤ n. Also, there are m processors of different size capacity. The capacity of the ith processor is capacity[i] (1 ≤ i ≤ m). A processor can process a task of size less than or equal to its capacity in 1 second, but it cannot execute processes whose size is greater than its capacity.
A processor can execute multiple processes one after the other, but needs to pause for 1 second after completing its current one. Multiple processors can work on different processes simultaneously.
Find the minimum time to execute all the processes or return -1 if there is no way to execute all the processes.
Example
It is given that n = 3, processSize = [2, 5, 3], m = 3 and capacity = [6, 2, 4].
The optimal way to assign processes is to give the first processor the second process, the second processor the first process, and the third processor the third process. All of them complete their processes in 1 second.
Therefore, the minimum time required is 1 second.
Function Description
Complete the function getMinimumTime in the editor below.
getMinimumTime has the following parameters:
int processSize[n]: the size of each process
int capacity[m]: the capacity of each processor
Returns
int: the minimum time required to execute all the processes, or -1 if there is no way to execute all processes.
Constraints
1 ≤ n, m ≤ 2 * 105
1 ≤ processSize[i], capacity[i] ≤ 109
Input Format For Custom Testing
The first line contains an integer n, the number of processes.
The next n lines contain processSize[i] (1 ≤ i ≤ n).
The following line contains an integer m, the number of processors.
The next m lines contain capacity[i] (1 ≤ i ≤ m).
Sample Case 0
Sample Input For Custom Testing
STDIN FUNCTION
----- --------
3 → processSize[] size n = 3
2 → processSize = [2, 5, 8]
5
8
3 → capacity[] size m = 3
6 → capacity = [6, 7, 4]
7
4
Sample Output
-1
Explanation
No processor has the required capacity to process the third process, so there is no way to process them all.
Sample Case 1
Sample Input For Custom Testing
STDIN FUNCTION
----- --------
5 → processSize[] size n = 5
1 → processSize = [1, 2, 3, 4, 6]
2
3
4
6
3 → capacity[] size n = 3
4 → capacity = [4, 7, 4]
7
4
Sample Output
3
Explanation
Assign the second and third process to the first processor. It completes the first process in 1 second, then pauses for another second, before completing the third process. Therefore, it takes 3 seconds to complete all of its work.
Similarly, assign the first and fifth process to the second processor. It also completes its processes in 3 seconds. The fourth process is completed by the third processor in 1 second.
Hence, all of the processes are completed in 3 seconds.
There are n processes to be executed, and the ith process has a size of processSize[i], where 1 ≤ i ≤ n. Also, there are m processors of different size capacity. The capacity of the ith processor is capacity[i] (1 ≤ i ≤ m). A processor can process a task of size less than or equal to its capacity in 1 second, but it cannot execute processes whose size is greater than its capacity.
A processor can execute multiple processes one after the other, but needs to pause for 1 second after completing its current one. Multiple processors can work on different processes simultaneously.
Find the minimum time to execute all the processes or return -1 if there is no way to execute all the processes.
Example
It is given that n = 3, processSize = [2, 5, 3], m = 3 and capacity = [6, 2, 4].
The optimal way to assign processes is to give the first processor the second process, the second processor the first process, and the third processor the third process. All of them complete their processes in 1 second.
Therefore, the minimum time required is 1 second.
Function Description
Complete the function getMinimumTime in the editor below.
getMinimumTime has the following parameters:
int processSize[n]: the size of each process
int capacity[m]: the capacity of each processor
Returns
int: the minimum time required to execute all the processes, or -1 if there is no way to execute all processes.
Constraints
1 ≤ n, m ≤ 2 * 105
1 ≤ processSize[i], capacity[i] ≤ 109
Input Format For Custom Testing
The first line contains an integer n, the number of processes.
The next n lines contain processSize[i] (1 ≤ i ≤ n).
The following line contains an integer m, the number of processors.
The next m lines contain capacity[i] (1 ≤ i ≤ m).
Sample Case 0
Sample Input For Custom Testing
STDIN FUNCTION
----- --------
3 → processSize[] size n = 3
2 → processSize = [2, 5, 8]
5
8
3 → capacity[] size m = 3
6 → capacity = [6, 7, 4]
7
4
Sample Output
-1
Explanation
No processor has the required capacity to process the third process, so there is no way to process them all.
Sample Case 1
Sample Input For Custom Testing
STDIN FUNCTION
----- --------
5 → processSize[] size n = 5
1 → processSize = [1, 2, 3, 4, 6]
2
3
4
6
3 → capacity[] size n = 3
4 → capacity = [4, 7, 4]
7
4
Sample Output
3
Explanation
Assign the second and third process to the first processor. It completes the first process in 1 second, then pauses for another second, before completing the third process. Therefore, it takes 3 seconds to complete all of its work.
Similarly, assign the first and fifth process to the second processor. It also completes its processes in 3 seconds. The fourth process is completed by the third processor in 1 second.
Hence, all of the processes are completed in 3 seconds.
Forwarded from Aman Raj
2. Subsequence Sort
Given a binary string binary consisting of characters '0' and '1' only, perform the following 0 or more times.
Choose any subsequence, sort the subsequence, and replace the original subsequence with the sorted sequence.
Next, there is an array of strings, arr, of length n, where each string has length |binary| and consists of characters '0', '1' and '?'. Each '?' character can be replaced with either '0' or '1' arbitrarily. For each string in arr, after replacing each '?' character with either '0' or '1', determine if it is possible to rearrange binary using the operation described any number of times. If it is possible, store "YES" as the corresponding answer, otherwise store "NO", both without quotes.
Note:
A string a is a subsequence of a string b obtained by deletion of some number (possibly, zero or all) of characters without changing the order of the remaining characters.
Each computation is independent of the others. That is, the string binary is in its original state at the beginning of each array element.
Example
Consider binary = "110100", and arr = ["?110?1","111???"].
arr[0] = "?110?1" can be converted to "011001" by appropriate replacement of '?' characters. This string can be obtained from binary as follows:
Choose the subsequence of indices {0, 2}, and sort this subsequence, binary becomes "011100".
Choose the subsequence of indices {3, 4, 5} and sort this subsequence, binary becomes "011001", which equals arr[0].
The answer for this element is "YES".
It is not possible to convert string binary to arr[1] so the answer for this element is "NO".
Return ["YES", "NO"], without quotes.
Function Description
Complete the function checkStrings in the editor below.
checkStrings has the following parameters:
string binary: the string to alter
string arr[n]: the strings to match
Returns
string[n]: each ith string is "YES" or "NO" and relates to the ith element of arr
Constraints
1 ≤ |binary| ≤ 3000
1 ≤ n ≤ 3000
|arr[i] | = |binary|
String binary contains characters '0' and '1' only.
Each string arr[i] contains characters '0', '1' and '?' only.
Input Format For Custom Testing
The first line contains a string, binary.
The second line contains an integer, n, the number of elements in arr.
Each line i of the n subsequent lines (where 0 ≤ i < n) contains a string, arr[i].
Sample Case 0
Sample Input For Custom Testing
STDIN FUNCTION
----- --------
101011 → binary = "101011"
2 → arr[] size n = 2
???111 → arr = ["???111", "001101"]
001101
Sample Output
YES
NO
Explanation
arr[0] can be converted to "100111" then binary can be made to match using these operations.
Choose the subsequence of indices {2, 3} and sort, binary becomes "100111". This equals the chosen arr[0].
Note that if the string arr[0] is converted to "001111", then also the string binary can be made to match.
It is not possible to convert string binary to arr[1] using any sequence of operations.
Sample Case 1
Sample Input For Custom Testing
STDIN FUNCTION
----- --------
0011 → binary = "0011"
3 → arr[] size n = 3
0?10 → arr = ["0?10", "0011", "????"]
0011
????
Sample Output
NO
YES
YES
Explanation
There are two possible choices for arr[0], either "0010" or "0110", neither of which can be derived from binary.
arr[1] is already equal to binary.
arr[2] can be "0011" which equals binary.
Given a binary string binary consisting of characters '0' and '1' only, perform the following 0 or more times.
Choose any subsequence, sort the subsequence, and replace the original subsequence with the sorted sequence.
Next, there is an array of strings, arr, of length n, where each string has length |binary| and consists of characters '0', '1' and '?'. Each '?' character can be replaced with either '0' or '1' arbitrarily. For each string in arr, after replacing each '?' character with either '0' or '1', determine if it is possible to rearrange binary using the operation described any number of times. If it is possible, store "YES" as the corresponding answer, otherwise store "NO", both without quotes.
Note:
A string a is a subsequence of a string b obtained by deletion of some number (possibly, zero or all) of characters without changing the order of the remaining characters.
Each computation is independent of the others. That is, the string binary is in its original state at the beginning of each array element.
Example
Consider binary = "110100", and arr = ["?110?1","111???"].
arr[0] = "?110?1" can be converted to "011001" by appropriate replacement of '?' characters. This string can be obtained from binary as follows:
Choose the subsequence of indices {0, 2}, and sort this subsequence, binary becomes "011100".
Choose the subsequence of indices {3, 4, 5} and sort this subsequence, binary becomes "011001", which equals arr[0].
The answer for this element is "YES".
It is not possible to convert string binary to arr[1] so the answer for this element is "NO".
Return ["YES", "NO"], without quotes.
Function Description
Complete the function checkStrings in the editor below.
checkStrings has the following parameters:
string binary: the string to alter
string arr[n]: the strings to match
Returns
string[n]: each ith string is "YES" or "NO" and relates to the ith element of arr
Constraints
1 ≤ |binary| ≤ 3000
1 ≤ n ≤ 3000
|arr[i] | = |binary|
String binary contains characters '0' and '1' only.
Each string arr[i] contains characters '0', '1' and '?' only.
Input Format For Custom Testing
The first line contains a string, binary.
The second line contains an integer, n, the number of elements in arr.
Each line i of the n subsequent lines (where 0 ≤ i < n) contains a string, arr[i].
Sample Case 0
Sample Input For Custom Testing
STDIN FUNCTION
----- --------
101011 → binary = "101011"
2 → arr[] size n = 2
???111 → arr = ["???111", "001101"]
001101
Sample Output
YES
NO
Explanation
arr[0] can be converted to "100111" then binary can be made to match using these operations.
Choose the subsequence of indices {2, 3} and sort, binary becomes "100111". This equals the chosen arr[0].
Note that if the string arr[0] is converted to "001111", then also the string binary can be made to match.
It is not possible to convert string binary to arr[1] using any sequence of operations.
Sample Case 1
Sample Input For Custom Testing
STDIN FUNCTION
----- --------
0011 → binary = "0011"
3 → arr[] size n = 3
0?10 → arr = ["0?10", "0011", "????"]
0011
????
Sample Output
NO
YES
YES
Explanation
There are two possible choices for arr[0], either "0010" or "0110", neither of which can be derived from binary.
arr[1] is already equal to binary.
arr[2] can be "0011" which equals binary.
👍1
Forwarded from Aman Raj
3. REST API: TV Shows Produced During a Period
Use the HTTP GET method to retrieve information about recent television shows. Query https://jsonmock.hackerrank.com/api/tvseries to find all the records. The query result is paginated and can be further accessed by appending to the query string ?page=num where num is the page number.
The response is a JSON object with the following 5 fields:
page: the current page of the results (Number)
per_page: the maximum number of results returned per page (Number)
total: the total number of results (Number)
total_pages: the total number of pages with results (Number)
data: an array of tv series records
Example of a data array object:
"name": "Game of Thrones",
"runtime_of_series": "(2011–2019)",
"certificate": "A",
"runtime_of_episodes": "57 min",
"genre": "Action, Adventure, Drama",
"imdb_rating": 9.3,
"overview": "Nine noble families fight for control over the lands of Westeros, while an ancient enemy returns after being dormant for millennia.",
"no_of_votes": 1773458,
"id": 1
In data, each tv series has the following schema:
name: (String)
runtime_of_series: years the show is in production (String)
certificate: rating (String)
runtime_of_episodes: average length per episode in minutes (String).
genre: genre (String)
imdb_rating: average viewer rating (Number)
overview: short description (String)
no_of_votes: how many votes were cast in imdb (Number)
id: unique id (Number)
There are 4 possible forms of runtime_of_series.
(2020-2021) - The first and last years of production are shown.
(2020- ) - The show is still in production.
(2020) - The show was only produced for one year.
A few entries have (I) or(II) followed by data in form 1, 2, or 3, e.g. '(II) (2006-2010)'. Ignore (I), or(II).
Given a start year and an end year, return a list of the names of all tv series that started production in startYear or later and ended production in endYear or earlier. If the endYear is -1, the shows should still be in production. Sort the list in alphabetically ascending order.
Function Description
Complete the function showsInProduction in the editor below.
showsInProduction has the following parameter(s):
int startYear: the earliest year of production
int endYear: the latest year of production or -1
Return
string[]: the sorted list of names of shows in production during the time period
Note: Please review the header in the code stub to see available libraries for API requests in the selected language. Required libraries can be imported in order to solve the question. Check our full list of supported libraries at https://www.hackerrank.com/environment.
Input Format For Custom Testing
The first line contains an integer, start_year.
The second line contains an integer, end_year.
Sample Case 0
Sample Input For Custom Testing
2006
2011
Sample Output
Death Note: Desu nôto
Heroes
Terra Nova
The Inbetweeners
The Tudors
Explanation
Return a list of shows that started production in 2006 or later and ended production in 2011 or earlier.
The name runtime_of_series pairs that match the query are shown.
(2006-2007) - Death Note: Desu nôto
(II) (2006-2010) - Heroes
(2008-2010) - The Inbetweeners
(2011) - Terra Nova
(2007-2010) - The Tudors
Sample Case 1
Sample Input For Custom Testing
2019
-1
Sample Output
After Life
Love, Death & Robots
Paranormal
Russian Doll
Sex Education
The Boys
The Mandalorian
The Umbrella Academy
Explanation
Show all the series that began production in 2019 or later and are still in production.
These series meet the criteria.
(2019- ) - After Life
(2019- ) - Love, Death & Robots
(2020- ) - Paranormal
(2019- ) - Russian Doll
(2019- ) - Sex Education
(2019- ) - The Boys
(2019- ) - The Mandalorian
(2019- ) - The Umbrella Academy
Use the HTTP GET method to retrieve information about recent television shows. Query https://jsonmock.hackerrank.com/api/tvseries to find all the records. The query result is paginated and can be further accessed by appending to the query string ?page=num where num is the page number.
The response is a JSON object with the following 5 fields:
page: the current page of the results (Number)
per_page: the maximum number of results returned per page (Number)
total: the total number of results (Number)
total_pages: the total number of pages with results (Number)
data: an array of tv series records
Example of a data array object:
"name": "Game of Thrones",
"runtime_of_series": "(2011–2019)",
"certificate": "A",
"runtime_of_episodes": "57 min",
"genre": "Action, Adventure, Drama",
"imdb_rating": 9.3,
"overview": "Nine noble families fight for control over the lands of Westeros, while an ancient enemy returns after being dormant for millennia.",
"no_of_votes": 1773458,
"id": 1
In data, each tv series has the following schema:
name: (String)
runtime_of_series: years the show is in production (String)
certificate: rating (String)
runtime_of_episodes: average length per episode in minutes (String).
genre: genre (String)
imdb_rating: average viewer rating (Number)
overview: short description (String)
no_of_votes: how many votes were cast in imdb (Number)
id: unique id (Number)
There are 4 possible forms of runtime_of_series.
(2020-2021) - The first and last years of production are shown.
(2020- ) - The show is still in production.
(2020) - The show was only produced for one year.
A few entries have (I) or(II) followed by data in form 1, 2, or 3, e.g. '(II) (2006-2010)'. Ignore (I), or(II).
Given a start year and an end year, return a list of the names of all tv series that started production in startYear or later and ended production in endYear or earlier. If the endYear is -1, the shows should still be in production. Sort the list in alphabetically ascending order.
Function Description
Complete the function showsInProduction in the editor below.
showsInProduction has the following parameter(s):
int startYear: the earliest year of production
int endYear: the latest year of production or -1
Return
string[]: the sorted list of names of shows in production during the time period
Note: Please review the header in the code stub to see available libraries for API requests in the selected language. Required libraries can be imported in order to solve the question. Check our full list of supported libraries at https://www.hackerrank.com/environment.
Input Format For Custom Testing
The first line contains an integer, start_year.
The second line contains an integer, end_year.
Sample Case 0
Sample Input For Custom Testing
2006
2011
Sample Output
Death Note: Desu nôto
Heroes
Terra Nova
The Inbetweeners
The Tudors
Explanation
Return a list of shows that started production in 2006 or later and ended production in 2011 or earlier.
The name runtime_of_series pairs that match the query are shown.
(2006-2007) - Death Note: Desu nôto
(II) (2006-2010) - Heroes
(2008-2010) - The Inbetweeners
(2011) - Terra Nova
(2007-2010) - The Tudors
Sample Case 1
Sample Input For Custom Testing
2019
-1
Sample Output
After Life
Love, Death & Robots
Paranormal
Russian Doll
Sex Education
The Boys
The Mandalorian
The Umbrella Academy
Explanation
Show all the series that began production in 2019 or later and are still in production.
These series meet the criteria.
(2019- ) - After Life
(2019- ) - Love, Death & Robots
(2020- ) - Paranormal
(2019- ) - Russian Doll
(2019- ) - Sex Education
(2019- ) - The Boys
(2019- ) - The Mandalorian
(2019- ) - The Umbrella Academy
👍1
Keep tracking INVESTCLOUD most probably they will release some job offers next month!!
Check LinkedIn for opportunities!! Might've opportunity for 2-5 years expected CTC range 6-12LPA
As I think now most of you have got the questions let me know in comments if you want me to explain each day 2 questions
Java Hyd Team
https://docs.google.com/spreadsheets/d/1fEe0qthQPg3G5_M6jfw_nGdC0jxVBwKhCQj7mmw4s0g/edit?usp=sharing
You can join session by paying javahydteam@ybl
Once payment is done send screenshot of payment to @LearningMarke
Once payment is done send screenshot of payment to @LearningMarke
Hi everyone this is veni I'm from prachodayath we have openings,if anyone is interested please pin me on whatsapp number 8187098221 or mail me on Neelaveni.c@prachodayathglobal.com
Position: process specialist
Experience: 2 to 5 years
Permanent
Location: banglore
Immediate joiner
Face to face interview on 6 th & 7th Bangalore
Perform complex transaction processing across various processes like Withdrawals / Terminations / Forfeitures / Plan to Plan transfers/ Contributions / Adjustment (corrections) processing
Educational Qualification
Graduate/Post Graduate for India Location
Certification : ASPPA - RPF
Minimum Experience
* 4+yrs in 401K DC/DB recordkeeping operations
* Extensive operations and financial services knowledge
Areas of Responsibility
1. Complex transaction processing
2. Review of work done by the team
3. Training of resources
4. SLA & Process Compliance
5. Interaction with Client SMEs
6. Process improvement
Other Skills
1. Proficiency in Oral & written communication,
2 . Financial Acumen
3 Eye for Detail
4. Analytical Skills
5.People Management Skills
Mandatory requirement:
1. Proficient in Adjustment (correction processing)
Thanks & Regards
Neelaveni
Position: process specialist
Experience: 2 to 5 years
Permanent
Location: banglore
Immediate joiner
Face to face interview on 6 th & 7th Bangalore
Perform complex transaction processing across various processes like Withdrawals / Terminations / Forfeitures / Plan to Plan transfers/ Contributions / Adjustment (corrections) processing
Educational Qualification
Graduate/Post Graduate for India Location
Certification : ASPPA - RPF
Minimum Experience
* 4+yrs in 401K DC/DB recordkeeping operations
* Extensive operations and financial services knowledge
Areas of Responsibility
1. Complex transaction processing
2. Review of work done by the team
3. Training of resources
4. SLA & Process Compliance
5. Interaction with Client SMEs
6. Process improvement
Other Skills
1. Proficiency in Oral & written communication,
2 . Financial Acumen
3 Eye for Detail
4. Analytical Skills
5.People Management Skills
Mandatory requirement:
1. Proficient in Adjustment (correction processing)
Thanks & Regards
Neelaveni
👍1