The problem was about finding the minimum amount of water fountains required to fully cover all of the positions of land, given an array with fountain coverages. For every test case, the input said it had N values, but when logging the input, there were always N - 1. After noticing this, I didn't even bother to finish it.
Implement a binary tree and write functions to insert values into it and print the nodes.
Simple questions.why are you searching for a job? What are the projects are proud of in the past?
Me conte um desafio que você recentemente venceu em seu trabalho atual.
Tell us about yourself and your experience
Asked mostly behavioral questions, how I would prioritize tasks, managing conflict situations, and describe the project I'm proud of.
Just search P2P distributed exchange using Grenache framework, bitfinex grenache task, bitfinex p2p exchange, you will find plenty of implementations of their task assignment.
Create a simplified P2P distributed exchange using Grenache framework .
Describe the concurrency model in Go Lang
Describe the difference between PostgreSQL and MySQL
Viewing 451 - 460 interview questions