SQL (Basic) Certification | Hackerrank Certifications
C #HelloWorld #CS #C++ #Python #Programming #Unix #Linux #Hackerrank #CLanguage #CProgramming #Cbasics #printf ... source
https://quadexcel.com/wp/sql-basic-certification-hackerrank-certifications/
It seems #ChatGPT can not resolve a problem of #hackerRank just with the official description of the problem, pretty interesting
I upload a video in my #peertube channel where I'm resolving a #hackerRank problem. I hope you enjoy it
Solving ratio problem - HackerRank
So I decided to give the HackerRank test a go for Amazon... Yeah... Went as well as I thought it would... Didn't manage to get working code for either question and with 15mins to go just decided I'd had enough and closed the test :neofox_cry_loud:
Story: I failed my first tech interview.
Despite having been coding for 10+ years, I froze on the live coding test and couldn't remember basic syntax.
Lesson learned: I started practicing daily on #HackerRank to build my confidence.
How do you prepare for coding interviews?
Want to ace your next coding interview?
1. Practice explaining your thought process out loud.
2. Study data structures and algorithms.
3. Practice #LeetCode and #HackerRank challenges.
4. Do mock interviews with friends.
Confidence comes from preparation.
Преобразование Уолша-Адамара
На сайте hackerrank.com есть отличная задача . По заданному массиву short[] A; найти максимальное количество его подмассивов, xor элементов которых будет одинаковым. Сам этот xor тоже нужно найти. Максимальная длина массива равна 10 5 , так что квадратичный алгоритм не укладывается в лимит по времени исполнения. Я в своё время с этой задачей не справился и сдался, решив подсмотреть авторское решение. И в этот момент я понял почему не справился - автор предлагал решать задачу через дискретное преобразование Фурье.
https://habr.com/ru/articles/787890/
#hackerrank #преобразование_уолшаадамара #свертка #дискретное_преобразование_фурье
Discovered a couple of lightweight AI related exercises in #Hackerrank
Do you think being able to solve HackerRank/LeetCode style questions helps you become a better software engineer, or better in solving these types of questions?
#softwareengineer #leetcode #hackerrank #programming #SoftwareEngineering
Is it just me, or does Hacker Rank sometimes return the wrong output when running R functions on certain test cases? I'm getting different results than what I get in a local R environment for the exact same function and test case. 🤔 #rstats #hackerrank
wtf #rust and #hackerrank
How and why can you give me different outputs for this? 😠
![Code:
use std::io;
use std::num::ParseIntError;
#[derive(Debug)]
#[derive(PartialEq)]
enum Case {
Negative, Zero, Positive
}
fn case(num: i8) -> Case {
if num > 0 { Case::Positive }
else if num < 0 { Case::Negative }
else { Case::Zero}
}
fn count_case(cases: &Vec<Result<Case, ParseIntError>>, case: Case) -> usize {
cases
.iter()
// Rust 1.70+:
// .filter(|c| c.as_ref().is_ok_and(|c| *c == case))
.filter(|c| c.as_ref().map(|c| *c == case).eq(&Ok(true)))
.collect::<Vec<_>>()
.len()
}
fn main() {
let stdin = io::stdin();
// Ignore the first line
let mut line: String = String::new();
let _ = stdin.read_line(&mut line);
// Realsies
line = String::new();
let _ = stdin.read_line(&mut line);
let nums: Vec<Result<Case, _>> = line[..line.len() - 1]
.split(' ')
.map(|n| n.parse::<i8>())
.map(|n| n.map(|n| case(n)))
.collect();
let total = nums.len();
let positives = count_case(&nums, Case::Positive);
let negatives = count_case(&nums, Case::Negative);
let zeros = count_case(&nums, Case::Zero);
println!("{:.6}", positives as f64 / total as f64);
println!("{:.6}", negatives as f64 / total as f64);
println!("{:.6}", zeros as f64 / total as f64);
}](https://files.mastodon.social/cache/media_attachments/files/110/902/943/380/149/961/original/826b7f626c7c26fb.png)
My rank has improved to top 5000, yeah!
Now (7pm ET Wed) watch https://youtu.be/QS0VmCD9YLU(FEEL FREE TO SUBSCRIBE TO YOUTUBE
@hajiaghayi
FOR FUTURE LESSONS) Lesson 14: Introduction to Algorithms by Mohammad Hajiaghayi: We talk about #Probability (Part 2) useful for designing #randomized #algorithms
#algorithms, #design, #induction, #recursive, #randomizedalgorithms, #probability, #randominput ,
#probabilitytheory, #randomvariables, #expectations, #variance, #Bernoulli, #Binomial, #Poisson, #Normaldistribution, #Gaussian, #Python, #numpy.random, #scipy.stats, #correlation, #Pearson, #spearman, #geeksforgeeks , #hackerrank, #leetcode, #cs, #computerscience
The great thing about platforms like #Codewars and #Hackerrank is that you can see when something like SQL has a built-in function to do what you coded.
The terrible thing about platforms like codewars and hackerrank is that you can see there was a built-in solution for the thing you just manually coded... 🥲
I've been going through the Odin Project, and I'm starting to lose #motivation. I like the idea of project based #learning but can't seem to get into it lately. Are #codewars or #hackerrank good resources to get some practice while changing the style of learning?
Part of the problem is that solving problems is interesting, but the #CSS seems so bland anymore. Should I just use some framework if I feel ok with the basics?
Which do you use?
Codecademy
Sololearn
Hacker rank
freeCodeCamp
Leetcode
#hackerrank #dataanalysis #python #datascience #selflearning #leetcode #sololearn #freecodecamp #codecademy
Anyone else on #hackerrank? I just signed up and love it. I am codeHaiku on hackerrank.com.
🏅 #HackerRank [#CodinGame…] / helpers 🧰
Little scripts (to compile, static analyze, run, and compare results)
to help in solving problems of HackerRank website (or CodinGame…),
in several programming languages
(#Ada, #Bash, #C, C++, #Haskell, #Java, #JavaScript, #PHP, #Python, #Rust and #Scala).
https://bitbucket.org/OPiMedia/hackerrank-codingame-helpers/
You can easily adapt these scripts for other programming languages.
