i
Juego Studio
Filter interviews by
I applied via Walk-in and was interviewed before Aug 2020. There were 3 interview rounds.
Top trending discussions
I was interviewed before Feb 2024.
There were two coding questions; one was related to linked lists, and the other was linked to binary trees.
Developed a web application for tracking inventory and sales data
Used React for front-end development
Implemented RESTful APIs using Node.js and Express for back-end
Utilized MongoDB for database management
Integrated authentication and authorization features for secure access
Implemented data visualization using Chart.js
Reversing a linked list involves changing the direction of pointers to go from the end to the beginning.
Start by initializing three pointers: current, previous, and next.
Iterate through the linked list, updating the pointers to reverse the direction of the links.
Update the head of the linked list to point to the new first node, which was the original last node.
Program to find perfect squares between two numbers
Iterate through numbers between the given range
Check if the square root of the number is an integer
If yes, then it is a perfect square
Smart pointers in C++ are objects that act like pointers but provide automatic memory management.
Smart pointers help prevent memory leaks by automatically managing memory allocation and deallocation.
Examples include unique_ptr, shared_ptr, and weak_ptr.
unique_ptr is used for exclusive ownership, shared_ptr for shared ownership, and weak_ptr to prevent circular references.
Mutual exclusion is a concept in concurrent programming where only one thread can access a shared resource at a time.
Ensures that only one thread can access a critical section of code at a time
Prevents race conditions and data corruption
Commonly implemented using locks, semaphores, or mutexes
Example: Using a mutex to protect a shared variable in a multi-threaded application
Implementing multithreading involves creating and managing multiple threads to execute tasks concurrently.
Identify the tasks that can be executed concurrently
Create and manage multiple threads to execute these tasks simultaneously
Use synchronization techniques like locks and semaphores to prevent race conditions
Handle communication and coordination between threads
Consider thread safety and resource sharing issues
1 hour, 22 questions related to Java Spring Boot, SQL, and Hibernate, also one DSA Question, implementation of a card board game.
I applied via Company Website and was interviewed before Dec 2020. There was 1 interview round.
I applied via LinkedIn and was interviewed in Nov 2021. There were 3 interview rounds.
posted on 29 Aug 2024
I applied via Campus Placement
Question on various topics
More questions on oops, coding
posted on 28 Jul 2021
I applied via Campus Placement and was interviewed before Jul 2020. There was 1 interview round.
Check if binary tree is balanced or not.
A balanced binary tree has the height of left and right subtrees differ by at most 1.
Recursively check the height of left and right subtrees and compare.
Use a helper function to calculate the height of a subtree.
Time complexity: O(nlogn) for a balanced tree, O(n^2) for a skewed tree.
Detect loops in a linked list.
Use two pointers, one moving at a faster pace than the other.
If there is a loop, the faster pointer will eventually catch up to the slower one.
To detect the start of the loop, reset one pointer to the head and move both pointers at the same pace.
posted on 5 Oct 2022
I applied via Campus Placement and was interviewed in Apr 2022. There were 5 interview rounds.
Basic aptitude questions. Just keep a track of time
2nd round is coding round. You can expect Leetcode medium questions. The topics asked are Linked list, Trees and arrays.
3rd round is again the Coding Test. Level of questions is Leetcode Medium to Leetcode Hard. Topics covered are Trees, Doubly Linked List, Dp etc.
posted on 16 Sep 2021
I was interviewed before Sep 2020.
Round duration - 60 mins
Round difficulty - Medium
Given a railway seat number represented as an integer, determine if it is a valid seat number and identify its berth type. Possible berth types include lower berth, middle...
Given a railway seat number, determine if it is valid and identify its berth type.
Parse input integer 't' for number of test cases
For each test case, check if seat number is valid (1 <= N <= 100)
Identify berth type based on seat number and output the result
Possible berth types are Lower, Middle, Upper, Side Lower, and Side Upper
Round duration - 90 mins
Round difficulty - Hard
First they asked me to introduce myself then they started questioning on oops concept from basic to advance level such as inheritance, polymorphism, abstraction, exception handling , STL etc. Next they started questioning on data structures. They asked me the logic of “how to find the middle of a linked list”.
You are provided with a square matrix. Your task is to return true
if the matrix is symmetric; otherwise, return false
.
A symmetric matrix is characterized by its transpose being eq...
Check if a square matrix is symmetric by comparing it with its transpose.
Iterate through the matrix and compare each element with its corresponding element in the transpose
If any pair of elements do not match, return false immediately
If all pairs match, return true at the end
Tip 1 : Clear the basic concepts of data structure and OOPs.
Tip 2 : Use coding ninja platform and Hackerearth for practice on coding skills.
Tip 3 : Use Geeks For Geeks for interview preparation.
Tip 1: Make your resume short and try to make it of one page only.
Tip 2: Add relevant keywords
based on 2 reviews
Rating in categories
Software Engineer
44
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer Level 1
18
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
16
salaries
| ₹0 L/yr - ₹0 L/yr |
Project Analyst
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer Trainee
9
salaries
| ₹0 L/yr - ₹0 L/yr |
99games Online
Dhruva Interactive
Moonfrog Labs
Nazara Technologies