I can't solve this

I can't solve this.
I don't think you can either

Attached: L371.jpg (1440x2064, 165.13K)

Give me any 2 numbers and I'll solve it for you

solution = lambda a,b: sum([a, b])

=SUM(A1:A2)

Can't you just increment the first number for nth time where n is the second number and it's incremented by a bullshit division that adds up to one?
if you absolutely can't use a + in the loop you can just use a while.

Binary XOR is how your CPU makes addition... EE wins again

unsigned int add(unsigned int a, unsigned int b)
{
unsigned int carry = a & b;
unsigned int result = a ^ b;
while(carry != 0)
{
unsigned int shiftedcarry = carry

t. EE

Attached: 500px-Full_Adder.svg_-2682638930.png (500x225, 9.41K)

import integerSummer from 'integer-sum'
import React from 'react'
import bootstrap from 'bootstrap'
import wrapper from 'timmys-wrapper'

const App = () => {
const number = 1
const number = 2
if (number === 1 && number2 === 2)
{
const sum = integerSummer(1 + 2)
return (
{sum})
}}

>using +
>Calling functions that use +

Attached: 1318999930865.jpg (618x466, 29.22K)

a+b. If you want me to use a certain operator ask a question that I couldn't solve using the operators you don't want me to use. The question also has to have merit in the real world. Otherwise you can go fuck yourself and your mother.

>Calling functions that use +
That's an implementation detail.
Nothing to do with the language itself and therefore solving the problem.

>add ecx, edx
easy

Do some bitshift shit I guess

from operator import add
solution = add(a, b)

2ez
sum(a,b,) = log(exp(a)*exp(b))

in Perl this is just
++$a while ($b--);

Attached: Camel-for-PRESS.jpg (3888x2592, 1.11M)

>unsigned int
>-1000

```
fn get_sum(mut a: u16, mut b: u16) -> u16 {
while b != 0 {
let c = a & b;
a = a ^ b;
b = c

>negative numbers

def sum(a, b):
lst = []
for i in range(a): lst.append(1)
for i in range(b): lst.append(1)
return len(lst)

big brain guy here

Attached: Screenshot 2022-06-14 at 14.18.29.png (1000x288, 54.87K)

Also, negative numbers

You can try it in your Javascript console.
It even works with floating point.
let sum = (a,b) => Math.log(Math.exp(a)*Math.exp(b));
sum(-1, 10); //9
sum(-10, -100); // -110

>++
>---
so in Perl not use one of operators is use them all twice

log(e^a e^b) = log e^a + log e^b = a + b

Honestly if this is what it takes to work at Google we need to stop calling them top tier engineer and just call them autists with a photographic memory because noone is going to know this due to years of coming across it in the real world.

Attached: Capture.jpg (584x243, 12.94K)

god I fucking hate leetcode how is this supposed to be something that people are just supposed to know on the fly in a job interview unless you have a background in EE?

basically the answer is to use bitwise operators with a carry but honestly I would have no idea how to answer this on the fly without googling

>do a+b without using "+" or "-"

Attached: 1630798576080.jpg (1242x1229, 779.49K)

def sum(a, b):
lst = []
for i in range(a): lst.append(1)
for i in range(b): lst.append(1)
for i in range(-1 * a): lst.pop()
for i in range(-1 * b): lst.pop()
return len(lst)

If I'm allowed to consider -1 a constant number instead of operator - applied to 1.

>god I fucking hate leetcode how is this supposed to be something that people are just supposed to know on the fly in a job interview unless you have a background in EE?
I have a background in computer science and I knew this.

>t. ESL