PinnedBest solutions for Amazon interview tasks.Amazon as all other companies doesn’t share information about the tasks they use during their interviewing process. But internet is full of lists of the tasks which collecting the people who participating in the interview. IMHO the most comprehensive and the most actual list is collected here. So I decided…Programming3 min read
PinnedBest solutions for Codility Lessons.Some time ago I found on Codility website a wonderful set of training tasks which covers many subjects of questions using by big companies on interview. Codility calls this set of tasks the “Lessons”. Each lesson has a link to a PDF file with theoretical description subject of the lesson…Programming5 min read
PinnedBest solutions for Microsoft interview tasks.Microsoft, as all other companies, doesn’t share information about the tasks they use during their interviewing process. But internet is full of lists of the tasks which collecting the people who participating in the interview. IMHO the most comprehensive and the most actual list is collected here. So I decided…Programming2 min read
Published in Dev Genius·Nov 15, 2020Best solutions for Microsoft interview tasks. Pattern Recognition.Description: Microsoft | OA 2020 | Pattern Recognition - LeetCode Discuss 697 VIEWS Programming challenge description: Given a pattern as the first argument and a string of blobs split by |…leetcode.com Solution: It looks like this task is not about algorithms, this is just about writing a simple parser which breaking the given string to parts and writing a function which finds and counts all substrings in the given string.Programming4 min read
Nov 12, 2020Best solutions for Microsoft interview tasks. Partition array into N subsets with balanced sum.Description: Give you one sorted array, please put them into n buckets, we need to ensure we get n sub array with approximately equal weights. Example: input {1, 2, 3, 4, 5} n = 3 output [[5],[1,4],[2,3]]; Solution: Generally this task look like a typical partition problem https://en.wikipedia.org/wiki/Partition_problem Unfortunately this description looks…Programming3 min read
Oct 27, 2020Best solutions for Microsoft interview tasks. Particle Velocity.Description: Microsoft | OA 2019 | Particle Velocity - LeetCode Discuss Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared…leetcode.com Related problems: https://leetcode.com/problems/arithmetic-slices/ Solution: This task is very simple. We just need go through the given array and check that the difference between three simultaneous items is equal. For example in array 1, 2, 3 the difference between 1 and 2 and between 2 and 3 is 1. That is…Programming2 min read
Oct 16, 2020Best solutions for Microsoft interview tasks. Min Deletions To Obtain String in Right Format.Description: We are given a string S of length N consisting only of letters ‘A’ and/or ‘B’. Our goal is to obtain a string in the format “A…AB…B” (all letters A’ occur before all letters ‘B’) by deleting some letters from S. In particular, strings consisting only of letters A’ or…Programming3 min read
Oct 11, 2020Best solutions for Microsoft interview tasks. Unique Integers That Sum Up To 0Description: Given an integer n, return any array containing n unique integers such that they add up to 0. Example 1: Input: n = 5 Output: [-7,-1,1,3,4] Explanation: These arrays also are accepted [-5,-1,1,2,3], [-3,-1,2,-2,4]. Example 2: Input: n = 3 Output: [-1,0,1] Example 3: Input: n = 1 Output: [0] …Programming2 min read
Oct 11, 2020Best solutions for Microsoft interview tasks. Min Swaps to Group Red Balls.Description: There are N balls positioned in a row. Each of them is either red or white. In one move we can swap two adjacent balls. We want to arrange all the red balls into a consistent segment. What is the minimum number of swaps needed? Write a function: int solution(string…Programming3 min read
Published in Dev Genius·Jul 5, 2020Best solutions for Microsoft interview tasks. Largest K such that both K and -K exist in array.Description: Write a function that, given an array A of N integers, returns the largest integer K > 0 such that both values K and -K exist in array A. If there is no such integer, the function should return 0. Example 1: Input: [3, 2, -2, 5, -3] Output: 3 …Microsoft2 min read
