Please create a new project from scratch and complete the 3 tasks below. 1. “Ace of Shadows” Create 144 sprites (NOT graphic objects) that are stacked on top of each other like cards in a deck. The top card must cover the bottom card, but not completely. Every 1 second the top card should move to a different stack - the animation of the movement should take 2 seconds. 2. “Magic Words” Create a system that allows you to combine text and images like custom emojis. Use it to render a dialogue between characters with the data taken from this endpoint: https://private-624120-softgamesassignment.apiary-mock.com/v2/magicwords 3. “Phoenix Flame” Make a particle-effect demo showing a great fire effect. Keep the number of images at max 10 sprites on the screen at the same time. Technical requirements: Write your code in TypeScript and use pixi.js (v7) for rendering. Each task should be accessed via an in-game menu. Render responsively for both mobile and desktop devices. Display the fps in the top left corner. Run the application in full screen. We evaluate your project structure, architecture, readability and documentation of your code. But as game developers we also deeply care about the creativity, visual aesthetics and playfulness of your solution.
Senior Developer Interview Questions
30,121 senior developer interview questions shared by candidates
How would I address some JS/TS methods that are not supported for older browsers?
Build a minor backend app to extract the data from database using REST APIs
Q: Do you like microservices or monolith?
The usual technical and behavioral type of questions. c#, OOPS, Sql query , SOLID, Design Pattern, some architectural questions.
few technical questions not difficult but i got feeling people asking them do not know the correct answer
Do you know ATDD, DDD, BDD or CD?
Typical problem solving question involving data structure that is probably available on leetcode or similar interview preparation website.
Your last contract was only 3 months, why was it so short?
Given a large file that does not fit in memory (say 10GB), find the top 100000 most frequent phrases. The file has 50 phrases per line separated by a pipe (|). Assume that the phrases do not contain pipe.
Viewing 3141 - 3150 interview questions