Knapsack problem with a twist that you can take any number of sacks of a given weight.
Desarrollador Python Junior Interview Questions
716,730 desarrollador python junior interview questions shared by candidates
Second interview: 1) A shuffled set contains unique numbers except one of the numbers appears twice. Find the number that appears twice. (Funny enough the interviewer had a custom random shuffler function to shuffle the set. But his shuffler function was not truly random as he would randomly pick indexes from 0--length of set and swap but this could pick the same indexes twice. Its technically buggy code, but I didn't dare mention something like that in an interview. Goes to show how "strong" the developers working in Tinder are. It also explains the numerous buggy user experience on the app) 2) Merge part in merge sort
Create a cache with fast look up that only stores the N most recently accessed items.
Given a matrix of 0s and 1s, write code to get all the different ways of getting from a given cell to another, such that you can't walk through any of the cells with 0s in them.
Give a string of words. Find anagram words and put them into the same list, then output the list of anagram words lists. input: [add, dad, care, race] output: [[add, dad], [care, race]]
The one that tripped me up asked me to write code to return all words in a dictionary that can be formed from a string of numbers (e.g. 34556), where the numbers map the same why they do on a phone (e.g. 1->A, B, or C).
Given an array of numbers e.g. [1,3,7,7,8,8,9], create a function that returns the indeces of a target number. For example, target is 8, return [4,5] for the array mentioned before.
Given 2 eggs, how would you find the exact floor at which the egg breaks when thrown from a building comprising 100 floors
Given an array of integers, delete the max and min numbers (both could appear more than once) in place. Do it in O(n) without shifting.
1. Given a lot of transactions, one transaction contain company name and the number of money in this transaction. Design a data structure, find the transaction with most money in it. follow up, find the company who owns transactions with most money (add-up). 2. Find the max number in an integer array. follow up, find the second number in this array.
Viewing 1221 - 1230 interview questions
See Interview Questions for Similar Jobs
Desarrollador C .net JuniorDesarrollador PythonDesarrollador De Python SeniorDesarrollador Net JuniorDesarrollador C JuniorDesarrollador De Software PythonDesarrollador Java JuniorDesarrollador Web JuniorDesarrollador De Software JuniorDesarrollador De DjangopythonProgramador PythonDesarrollador Php JuniorDesarrollador JuniorIngeniero De Software JuniorDesarrollador Android JuniorDesarrollador De Aplicaciones JuniorDesarrollador Ruby juniorDesarrollador Web Jr