0
This question is a part of my research. I am trying to multiply two N X N matrices which are stored diagonally. I implemented the following algorithm for this purpose which is working correctly but the problem is it is taking way too much time. For example, To multiply 1000 x 1000 matrices, it is...
There are exactly n inputs and in which each entry is getting entered twice
except once but n value may go to 10 000 000 000 spoj ololo
Note-> The xor of two same value is always zero
1^8=9 -> 9^1=8
we can take xor of values while input is getting entered finally we will have a single v...0
I'm facing a wrong answer problem on 5 test cases out of 10 on a Hackerrank question. I've tried every possible test case (generally small so I could later use the debugger to see the how the code is actually working) I could think of but I'm unable to find the bug that's causing the wrong answer...
0
0
0
The 2 ends coin game receive an array. The goal of the game is accumulate the number of points from the coins (values of the elements in the array) the most. you can take points only from the 2 corners of the array.
There are 2 conditions for the game:
1) The first player (Amir) would never los...
I am learning Python for a few weeks. Last time I started object-oriented programming and I feel like it is really hard for me to write relation between methods and attributes different objects.
I tried to write simpler version BlackJack card game only with Hit or Stand option.
Could you hav...
0
0
I am learning excel vba through an online course.
One of the exercises requires that you you find and replace text in a selected cell for all sheets. Here is my attempt at a solution using a For each loop.
Sub Find_Replace_Selected_Value()
' Initialize Variables
Dim inputRange As Range
Dim se...
def initialise_board(): #create a 10x10 board
game_board=([' ',' ',' ',' ',' ',' ',' ',' ',' ',' '],
[' ',' ',' ',' ',' ',' ',' ',' ',' ',' '],
[' ',' ',' ',' ',' ',' ',' ',' ',' ',' '],
[' ',' ',' ',' ',' ',' ',' ',' ',' ',' '],
...
Do you think the below code works in linear time? Below is my analysis :
[Full Question: https://www.geeksforgeeks.org/longest-consecutive-subsequence/ ]
Worst case time complexity analysis (when all the characters are consecutive) :
Total n iterations for the first value = O(n)
After this th...0
import java.util.Scanner;
class ParensMatching
{
static Character Stack[]= new Character[25];
static int ptr = -1;
static void push(char ch)
{
if(ptr+1 < 25)
{
Stack[++ptr]= ch;
}
else
{
System.out.println("Over...
Okay so the problem is I have a file like this :
Case 1 ( 1st file ) :
abcd,1
abcd,21
abcd,122
abce,12
abcf,13
abcf,21
Case 2 ( and another file like this ) :
abcd,1
abcd,21
abcd,122
So, as you can see it's sorted and in increasing order.
What I want to do is convert it to like this :
...0
I am trying to solve some challenges and I noticed that my python code runs too slow.
When I wrote the same code in Java, I didn't have any problem.
Some could tell me how to improve my python code?
Java code:
import java.util.Scanner;
public class PrimeKattisChallenge2 {
public stat...-1
1
This is an implementation of the Sieve of Eratosthenes :
It takes advantages of the fact that all primes from 5 and above can be written as 6X-1 or 6X+1,
For better space complexity, it uses a pretty accurate upperbound. Better estimations of the upper bound can be found here. I've observed a v...0
Code review/feedback is requested and appreciated for the following open-source automatic differentiation C++ header-only library released under the Boost License:
https://github.com/pulver/autodiff
This library facilitates the calculation of nth-order single and multi-variable derivatives of f...
