HackerRank Problem Solving(Basic) Solutions [4 Questions Solved] With Certificate | #Hackerrank

preview_player
Показать описание


Join Our Telegram group TechNinjas2.0 Code Help-
Рекомендации по теме
Комментарии
Автор

What is the value of this problem solving Basic skill ceetificate

SurinderSingh-tuoy
Автор

i want problem solving intermediate soulution largest area hackerrank solution

usakoilamounika
Автор

Brother please upload vowel substring and string anagram solutions

anshushukla
Автор

I got a tree balanced data structure question in this test 😭 which is a dynamic programming topic ! Fuq unlucky shit,

rajjaiswal
Автор

Bro make a video on solution of javascript angular react and rest API of hacker rank platform

adarshkotagi
Автор

When will you put out IBM Cybersecurity Analyst Specialization's 8th(final) course?

Madzhkar
Автор

Hi brother, kya ye Java aur Python me code same rahega ya fir different?

vishalgauswami
Автор

Broo it's showing no test case passed, even The code is same, it's showing nothing in output

jainilshah
Автор

can u share the unexpected demand code once

tejeswarasaia
Автор

What about Vowel substring solution ??

rajanverma
Автор

Bro active traders showing error
Indentation error

DIVYANSHSAHURA
Автор

can you make a vidio on introducation to programming with matlab answer key

iamsusovan
Автор

String anagram ka solution ha up k pass

IT_FoodLover
Автор

JAVA SOLUTION FOR SECOND QUESTION (Please edit according to the function):
import java.util.*;

public class MyClass {
public static void main(String args[]) {
String[] arr = {"Bigcorp", "Bigcorp", "Acme", "Bigcorp", "Zork", "Zork", "Abc", "Bigcorp", "Acme", "Bigcorp", "Bigcorp", "Zork", "Bigcorp", "Zork", "Zork", "Bigcorp", "Acme", "Bigcorp", "Acme", "Bigcorp", "Acme", "Littlecorp", "Nadircorp"};
HashMap<String, Integer> map = new HashMap<>();
ArrayList<String> list = new ArrayList<>();
for(int i=0;i<arr.length;i++){
if(map.containsKey(arr[i])){
map.put(arr[i], map.getOrDefault(arr[i], 0)+1);
}else{
map.put(arr[i], 1);
}
}
float m = (float)arr.length;
for(Map.Entry<String, Integer> ch: map.entrySet()){
int n = ch.getValue();
String str = ch.getKey();
if((n/m)*100>5){
list.add(str);
}
}
Collections.sort(list);
System.out.println(list);
}
}

parthsachan