Posting the solution here as I couldn't find one for this problem
public static Integer findLast(List<Integer> nums, Integer target) {
Integer index;
if(!nums.contains(target))
{
return -1;
}
for(Integer i = nums.size()-1; i >= 0; i--)
{
if(nums[i] == target)
{
index = i;
break;
}
}
return index;
//alternate solution
for(Integer i = nums.size() - 1; i >= 0; i--)
if(nums[i] == target) return i;
return -1;
#80 - Duplicate Integers
public Boolean containsDuplicates(List<Integer> nums) {
Set<Integer> seen = new Set<Integer>();
for (Integer i=0; i<nums.size(); i++) {
if (seen.contains(nums[i])) return true;
seen.add(nums[i]);
}
return false;
}
Abdul Basith - Acknowledging and thanks for brief code.
I want to shorten it further:
#92 - Sorting a List
public List<String> getNamesInAscOrder(List<String> accountNames)
{
accountNames?.sort();
return accountNames ?? accountNames;
}
Desenvolvedor Júnior (exclusiva para pessoas autistas)
A Specialisterne, em parceria com uma multinacional de referência em soluções digitais, está com inscrições abertas para pessoas autistas que queiram ingressar no mercado de trabalho.
As vagas são direcionadas para:
Atividades:
Local de Trabalho: Zona Sul - São Paulo
Requisitos básicos:
Diferenciais (Desejáveis):
A contratação será diretamente pela empresa parceira Salesforce.
Se você tem mais de 18 anos, atende aos requisitos informados e quer participar desse processo, preencha o formulário de candidatura a seguir:
Formulário de Inscrição
Reverse Words In String
public static String reverseWords(String str){
// solution here
List<String> revStr = new List<String>();
for(String sp : str.split(' ')){
revStr.add(sp.reverse());
}
return String.join(revStr,' ');
}
Binary Search Opportunites
public static Integer search(List<Opportunity> opportunities, Integer target){
// solution here
Integer left = 0;
Integer right = opportunities.size();
while(left < right){
Integer middle = Math.abs((left + right) / 2);
if(opportunities[middle]. Amount == target)
return middle;
if(opportunities[middle].Amount < target){
left = middle + 1;
}else{
right = middle - 1;
}
}
return - 1;
}
#120 Merge Two Sorted Lists
public static List<Integer> mergeLists(List<Integer> list1, List<Integer> list2){
// solution
List<Integer> finalLst = new List<Integer>();
Integer maxLen = list1.size() + list2.size();
Integer i = 0;
Integer j = 0;
Integer x = 0;
while(x < maxLen){
if(i > list1.size() - 1){
finalLst.add(list2[j]);
j++;
}else if(j > list2.size() - 1){
finalLst.add(list1[i]);
i++;
}else if(list1[i] < list2[j]){
finalLst.add(list1[i]);
i++;
}else{
finalLst.add(list2[j]);
j++;
}
x++;
}
return finalLst;
}
One of my favorite algorithms.
public static Integer search(List<Opportunity> opportunities, Integer target){
Integer first = 0;
Integer last = opportunities.size()-1;
while (first <= last) {
Integer middle = first + (last - first) / 2;
if (target == opportunities[middle].Amount)
return middle;
else if (target < opportunities[middle].Amount)
last = middle - 1;
else
first = middle + 1;
}
return -1;
}
Have a question, what if multiple opportunities have similar amount?
How does the code modification look for this case?
#17 - Age Group
public String ageGroup(Integer n) {
return n < 2 ? 'Infant' : n < 15 ? 'Child' : n < 22 ? 'Youth' : 'Adult';
}
Hey,
Check out how I implemented problem 55 - Companion plants 2:
public Boolean companionPlants(List<String> plants) {
//code here
if(plants.size()==1){
return false;
}
Map<String, List<String>> companionMap = new Map<String, List<String>>();
companionMap.put('lettuce', new List<String>{'cucumbers', 'onions'});
companionMap.put('onions', new List<String>{'lettuce', 'carrots', 'tomatoes'});
companionMap.put('cucumbers', new List<String>{'lettuce'});
companionMap.put('carrots', new List<String>{'onions'});
companionMap.put('tomatoes', new List<String>{'onions'});
for(Integer i = 0; i < plants.size()-1; i++){
List<String> currentCompanions = companionMap.get(plants[i]);
if(!currentCompanions.contains(plants[i+1])){
return false;
}
}
return true;
}
Now I am in top 4 percent of all ApexSandbox users.
I've just completed Apex 101 and Database 101 challenges :) . This positions me in the top 8 percent of ApexSandbox users.
