Questions d'entretien pour front end developer à Canada

7 k

Questions d'entretien pour front end developer partagées par les candidats

Principales questions d'entretien

Trier: Pertinence|Populaires|Date
Accenture
On a demandé à Senior Front End Developer...14 juillet 2017

What are your greatest technical strengths?

8 réponses

Management

Social media experience

I am technically sound in using R script for R programming language, base SAS, SAS analytics and Advanced SAS. Moins

Afficher Plus de réponses
Booking.com

In your opinion, what is our company's single most important metric?

7 réponses

Reservations per day I guess

It's always revenue my man/woman

"It's always revenue my man/woman." I hope you understand how irrelevant you observation is in the context of this position. So no, it's not "always revenue." Moins

Afficher Plus de réponses
PE International

"If you were stranded on a desert island, what three development tools would you bring with you?"

5 réponses

This ridiculous, senseless question was the first one asked. It set the tone for what was to follow. Moins

IDE, Build Tools, Version Control!

Git, Codio, and Netflix

Afficher Plus de réponses
Bloomberg L.P.

What is a JavaScript callback function?

5 réponses

A callback function is a piece of JavaScript code that executes after the main function that the callback is attached to executes successfully. Moins

udaykanth, I would say that a .forEach() would be the most common and most basic use of a callback function. I'm just writing this to help anyone that might have a hard time thinking up a quick example if the come across this question themselves. Example: var numArray = [ 1, 2, 3 ] ; numArray.forEach( function( i ) { console.log( arr[ i - 1 ] ) } ) ; // logs out // 1 // 2 // 3 Moins

Is there a front end role at bloomberg. I guess your position must have been labelled software dev right? altho ur a dront end dev Moins

Afficher Plus de réponses
IBM

1. To add an HTTP request to the search engine, then log a result depending on the# of pages and requirements. 2. Use DP to implement a Knapsack-like problem. Restrictions on time complexity. 3. Implement a to-do list's delete method on website.

5 réponses

To X: Get rejected

Did they request to do a background screening on you before rejecting?

No

Afficher Plus de réponses
Meta

Given an array where each entry can be another array, and so forth, flatten the array. [4, [3, 6, [9, 1, 9, [5, 1]]], 8] -> [4, 3, 6, 9, 1, 9, 5, 1, 8]

5 réponses

Assuming that we are solving this in Java, I am treating an array as an array list // Use Hash Set to prevent infinite loops HashSet hs = new HashSet(); ArrayList flatten_list(ArrayList arr, HashSet hs) { ArrayList result = new ArrayList; int len = arr.size(); if(len < 1) return result; // Empty List. for(int i = 0 ; i Moins

function serialize(a, start){ if(start >= a.length) return a; if(Array.isArray(a[start])) return serialize([...a.slice(0,start),...a[start], ...a.slice(start+1,a.length)], start+1); return serialize(a, start+1); } Moins

const flatten = array = > { return array.reduce((elem, acc) = > { return elem.concat(Array.isArray(acc) ? flatten(acc) : acc) }, []) } Moins

Afficher Plus de réponses
Yahoo

Design a data structure to store sparse 2D matrix which contains only 0 or 1. then write function to add 2 such matrix.

4 réponses

use run-length encoding.

store each row as a decimal for ex: if the row is 1011 -> store it as 13!

Since all values are mod 2 you can pack 64 entries together into on int64_t. You can then add two matrices by XORing each entry. Moins

Afficher Plus de réponses
Pinterest

How many characters in the front of a string would need to be added in order to make it a palindrome.

4 réponses

Here's a python solution: def min_add_for_pal(word): drow = word[::-1] # Reverse string if drow == word: return 0 for shift in range(len(word)): if word[:-shift] == drow[shift:]: return shift return None # Shouldn't reach here Moins

A better asnwer is to do it in-place with pointers. O(N) speed and O(N) space. function checkPalindrome(i, input){ var leftPointer = 0; var rightPointer = 0; if(i===0){ //base case of single char return true; } var odd = (i+1)%2; //we know it's not 0 if(odd){ leftPointer = i/2; //not 0 rightPointer = i/2; //not 0 while(input[leftPointer] === input[rightPointer] && leftPointer > 0 && rightPointer 0 && rightPointer < input.length){ leftPointer = leftPointer - 1; rightPointer = rightPointer + 1; } } if(input[leftPointer] === input[rightPointer] && leftPointer === 0){ return true; }else{ return false; } } var improvedMinPalindromeAddition = function(input){ var inputArray = input.split(""); //max string size is greater then max array size(4.29 billion elements)..we could also do it inline w/string manipulation var largestPalindrome = 0; for(var i=0;i Moins

function isPallindrom(str) { if (!str) return; let start = 0; let end = str.length -1; while (start start) { console.info(str.substring(0, end)) if (isPallindrom(str.substring(0, end))) { return count; } else { count++; } end--; } return count; } Moins

Afficher Plus de réponses
SteadyRain

Describe some of the differences between HTML5 and HTML4.

4 réponses

HTML5 has newer elements such as section, article, aside etc... which cause validation errors and are unsupported in legacy browsers. There are other things like deprecated tags etc. No, they are not the same. Moins

I am new to developing, so html5 is all I know.

Question? If you interviewed in January of 2015; why did you wait a year and 8 months to post negative feedback about interviewing with SteadyRain? Moins

Afficher Plus de réponses
eBay

How would you pick the middle element of a list

4 réponses

its a list (assuming not an array).... Take two pointer....increment 1st pointer by 2 everytime & second by 1 [Rabbit & tortoise problem] if 1st pointer(rabbit) reaches the end of the list.... the position of the tortoise is the location of the middle element of the list. Moins

You guys are overthinking this var arr = [1,2,3,4,5,6,7]; console.log(arr[Math.floor((arr.length - 1) / 2)]); Moins

int[] intArray = {12,34,56,78,98,31,47}; int startIndex=0; int endIndex=intArray.length -1 ; while(startIndex Moins

Afficher Plus de réponses
1 - 10 sur 6 977 Questions d'entretien