issues Search Results · repo:prabaprakash/Hackerrank-JavaScript-Solutions language:JavaScript
Filter by
10 results
(71 ms)10 results
inprabaprakash/Hackerrank-JavaScript-Solutions (press backspace or delete to remove)1. this
2. immutable data objects using a linter
3. immutable objects and collections
4. data transformations using core operations like filter, map, sort, or reduce
5. use statements like if and ...
algorithm
fp
prabaprakash
- 1
- Opened on Nov 25, 2020
- #10
let node = (data) = ({
left: null,
right: null,
data: data
})
let bst = {
root: null,
insert: (root = bst.root, data) = {
if (root === null) {
bst.root = node(data);
} else { ...
bst
graph
tree
prabaprakash
- 1
- Opened on Aug 26, 2020
- #8
https://www.hackerrank.com/challenges/construct-the-array/problem
algorithm
conditional
dynamic
prabaprakash
- 1
- Opened on Aug 4, 2020
- #7
Algorithms to solve it,
1. Modular multiplicative inverse
2. Combinatorics and Permutation
exponent
fermat
memoziation
modular
prime
prabaprakash
- 1
- Opened on Jul 30, 2020
- #6
Algo
#include bits/stdc++.h
using namespace std;
string richieRich(string s, int n, int k){
int lives=k;
vector bool mod(n,false);
string temp(s);
for (int i=0;i n/2;i++)
...
greedy
lives
prabaprakash
- 1
- Opened on Jul 30, 2020
- #5
big add
const add = (a, b) = {
let carry = 0;
let i = 0;
for (i = 0; i b.length; i++) {
let n = a[i] + b[i] + carry;
a[i] = n % 10;
carry = Math.floor(n / 10);
...
big integer
dynamic
recursion
prabaprakash
- 2
- Opened on Jul 30, 2020
- #4
Algorithm Explained: https://medium.com/@leejh3224/hackerrank-solution-almost-sorted-4331bd58275
1_7WwKAq9CeuMTf8Rrc-Yu8g Case 1: Valley === 1 No Case 2: Valley === Peak === 1 swap, then the array is ...
algorithm
case
conditional
prabaprakash
- Opened on Jul 29, 2020
- #3
Need more focus on Dynamic Programming
hashing
memoziation
recursion
prabaprakash
- Opened on Jul 28, 2020
- #2
Please list possible algo for solving these problems
algorithm
problem
understanding
prabaprakash
- 3
- Opened on Jul 27, 2020
- #1

Learn how you can use GitHub Issues to plan and track your work.
Save views for sprints, backlogs, teams, or releases. Rank, sort, and filter issues to suit the occasion. The possibilities are endless.Learn more about GitHub IssuesProTip!
Restrict your search to the title by using the in:title qualifier.
Learn how you can use GitHub Issues to plan and track your work.
Save views for sprints, backlogs, teams, or releases. Rank, sort, and filter issues to suit the occasion. The possibilities are endless.Learn more about GitHub IssuesProTip!
Restrict your search to the title by using the in:title qualifier.