2 results • Page 1 of 1
Showing : `coderush`reset
3 Votes | 0 Replies
10 weeks ago
660
2 Votes | 0 Replies
5 months ago
papa
• 150
• updated 4 months ago
660
2 results • Page 1 of 1
Company Tags
Recent Locations • All
Gaya, 23 days ago
India, 6 weeks ago
IIIT Naya Raipur, 3 months ago
Indian Institute of Information Technology, Dharwad, 3 months ago
Muzaffarpur, 4 months ago
Recent Replies
Answer: ByteDance | Singapore | SDE Intern | Freshers | 2nd October 2021 singapore sde1 by garg.6 • 40
def helper(n,dp,kMax): if(dp[n]!=-1): return dp[n] if(n <= 2*kMax): return 1 for i…
Comment: Assessment for Backend Engineer (Growth)-2021 Start - ByteDance Campus Recruitme by garg.6 • 40
Question2 : https://leetcode.com/problems/count-binary-substrings/submissions/
Answer: ByteDance coding round by garg.6 • 40
def josephus(self,n,k): if(n<=1): return 0 return (josephus(n-1,k)+k)%n)
Answer: Question: ByteDance | Set-2 | Singapore | SDE | Freshers | 2nd October 2021 by garg.6 • 40
This question asks us to divide a number into more than 2 integers and the product should be maximum. To do so, the first observation which…
Answer: ByteDance | Singapore | SDE Intern | Freshers | 2nd October 2021 singapore sde1 by garg.6 • 40
#include <bits/stdc++.h> using namespace std; string ltrim(const string &); string rtrim(const string &); /* * Complete the '…
Comment: ByteDance coding round by admin 660
This is josephus problem<br> <a href="https://cp-algorithms.com/others/josephus_problem.html">Link</a>
Answer: ByteDance OA - 2nd Oct by haxor • 0
thanks @Papa!<br> Using this I think we can precompute for all possible card-decks of [1-10],[1-10],[1-10],[1-10].<br> Then it will be ea…
Answer: ByteDance OA - 2nd Oct by papa • 150
<h1>Problem 5</h1> Hint is in this easier subproblem. <h3>Subproblem</h3> Given any four number can we calculate if it sums to 24? …
Answer: ByteDance OA - 2nd Oct by papa • 150
Problem 5 - Hint for an easier problem [Given any four numbers, can we calculate if it sums to 24] Backtracking Solution : class Sol…
Answer: ByteDance OA - 2nd Oct by admin 660
Q2 B - Answer is 30 a - 5 b - 5 h - 5 i - 5 hi - 5 bhihi - 5
Answer: ByteDance OA - 2nd Oct by papa • 150
Q1 B - Common Bitmask Method
Answer: ByteDance OA - 2nd Oct by haxor • 0
<h1>Problem 3</h1> You can use this code to find prefix sum of matrix - <a href = "https://ideone.com/SETqip">Code Link</a>.<br> After th…
Answer: ByteDance OA - 2nd Oct by haxor • 0
Here are my attempts. Anybody who got 5/5 ? Problem 5 -> Bruteforce is sufficient. Problem 3 -> O(N^2) using prefix sum over matrix. Th…
Comment: Codenation - 14 august by megatron123 • 20
Can you post the other questions as well ?