Sven

is that question too broad for this exchange?

My employer asked us to add collaboration between a few enterprise applications we've got, and I wanted to ask a question about creating and managing a database that is accessed by multiple applications

Hi there

any idea?

and then this theorem seems to fail

but my triangle looks like imgur.com/S5F5ePA

This site gives a nice visualization and triangles is exactly what I need

anyone heard of Pick's theorem before?

Hi, given the recurrence relation $f(2n) = f(n) + f(n+1) + n$ and $f(2n+1) = f(n-1) + f(n) + 1$, how can I find the largest n for f(n) = x?

oeis.org/A163932

Anyone heard of a "Triangle related to the asymptotic expansion of E(x,m=3,n)" before?

Does anyone know what a "Triangle related to the asymptotic expansion of E(x,m=3,n)" is?

do you have some ideas?

this is correct for 3/5 test cases, it seems that I've forgot some additional cases

(n-(x+y-1))! was my first try, but I forgot that we can have different combinations of putting the (x+y-1) guys either in the front or the back, now I got (n-(x+y-1))! + (x+y)!

let's take the biggest x persons and put them in the front, the y-1 persons and put them in the back, the rest goes between

we need to calculate the number of configurations we can do with those n-persons that satisfy the x,y requirement

suppose we have n number of persons, all with different heights. We need to stack them such that only x are seen from the front and y are seen from the back.

hey guys

sure, just FIY ;)

we simply take the x largest persons to the front, the y-1 largest persons to the back and can calculate (n-(x+y-1))! + (x-y)!, but there appear to be some cases in which this fails

@tohecz I got a solution that fit some test cases if you're interested

is there for example a classification for those kind of problems I can look for?

do you have other approaches in mind?

I'm trying though ;)

no proper cs education, so most of those concepts are new to me

but I'm not sure if that's even a proper generalization or even how I model the constraints in my graph

since i used that for an earlier problem

my first idea was using a graph structure and an adjacency matrix to count the number of paths I can travel

k, thanks will do some research on that

@Raphael thanks, will keep that in mind

@tohecz what is OGF?

first, (I think) we can generalize it by using max(x,y) different kind of persons

yes, but now we need to calculate the number of configurations we can do with those n-persons that satisfy the x,y requirement

suppose we have n number of persons, all with different heights. We need to stack them such that only x are seen from the front and y are seen from the back.

I should probably just begin with asking what the problem is actually called, there should be enough ressources in the internet already

and I have some questions if I generalized a problem correctly or what I'd need to change

not that I have a shot actually being considered by them, but I find these problems interesting

hey guys, are questions about google interview challenges allowed?

@Juho thanks ;)

does this three cluster weighted graph imgur.com/YZS4W5U have a specific name I can google?

@pip lfd.uci.edu/~gohlke/pythonlibs/#pygame

I was wondering, their latest version is 3.2

great

3

@pip thanks, will do some googling

nah, what I need is way more simpler. i.imgur.com/NBUrXG9.jpg

I'm on python btw, no experience with a gui like tkinter or similar..

what do I need for this?

the board is mapped to a graph and I used graphviz to get a map already, but I want to make my own visualizer, just painting the graph and some information on each node