Find out if two strings are anagrams.
Full Stack Engineer Interview Questions
Full Stack Engineer Interview Questions
Un full-stack engineer est un expert technique en développement internet et logiciel. Il peut s’occuper de presque tous les aspects du développement, des serveurs à l’ingénierie des systèmes en passant par les bases de données. Lors d’un entretien d’embauche, il est probable que l’on vous pose des questions techniques et des questions visant à déterminer vos compétences en matière de relations interpersonnelles et de communication.
Questions d'entretien d'embauche fréquentes pour un full stack engineer (H/F) et comment y répondre
Question 1 : Travaillez-vous sur quelque chose en ce moment ?
Question 2 : Comment avez-vous choisi les outils et les technologies pour votre dernier projet ?
Question 3 : Quelles sont les dernières tendances en matière de développement internet full-stack ?
19,456 full stack engineer interview questions shared by candidates
How do you stay updated with tech trends?
If you had to choose, would you rather be a Frontend or a Backend developer?
Write a JavaScript function that takes an array of fruit names as input and returns an object where each key is the uppercase first letter of the fruit names, and the corresponding value is an array of all fruits that begin with that letter. The grouping should be case-insensitive, meaning that fruit names like "Apple" and "apple" should be treated the same, and the output should preserve the original order of the fruits within each group. The keys in the resulting object should be sorted based on the order they appear in the input array, not alphabetically. Input ['apple', 'banana', 'ananas', 'blueberry', 'cherry', 'avocado', 'blackberry'] Output { A: ['apple', 'ananas', 'avocado'], B: ['banana', 'blueberry', 'blackberry'], C: ['cherry'] }
What does the term "clean code" mean to you? 30 minutes of resume questions and past projects. Last 30 minutes of technical/coding part. The question is an easy programming question and they allow you to use pseudo code, but won't tell you if you're doing anything wrong. The problem comes with 3 revisions. // An isogram (also known as a "non-pattern word") is a word or phrase without a repeating letter, however spaces and hyphens are allowed to appear multiple times. // Examples of isograms: // - lumberjacks // - background // - six-year-old // Example of non-isograms: // - food: because o repeats // - snowing: because n repeats // - high-five: because "h" is repeated, and "i" is repeated twice in the hyphenated phrase // Input: // "Lorem ipsum dolor sit a-me-t, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua." // Output: // ["dolor", "consectetur", "adipiscing", "incididunt", "dolore", "magna", "aliqua"]
Prime no, String and Matching parenthesis
What makes you excited about a greenfield project?
Break down an address (e.g. 1234 Main St Suite 9B San Francisco CA 94105) into its subparts (address line 1, address line 2, etc).
Mostly technical questions and previous work with live project
Have you worked with ReactJS?
Viewing 901 - 910 interview questions