Junglee Games Interview Questions, Process, and Tips

It was ok. I was not able to solve all the questions.

Q1. Remove the last element from a linkedlist
Ans. 
To remove the last element from a linked list, iterate to the second last node and update its next pointer to null.
• Iterate through the linked list to find the second last node

• Update the next pointer of the second last node to null
Answered by AI
Add your answer
Q2. Some basic questions on oops dbms and os
Add your answer

Q1. Find wheteher the given number is fibonacci or not
Ans. 
To determine if a number is a Fibonacci number or not.
• Check if 5*n^2 + 4 or 5*n^2 - 4 is a perfect square

• If either of the above conditions is true, the number is a Fibonacci number

• Example: 5 is a Fibonacci number as 5*5 - 4 = 21 which is a perfect square
Answered by AI
View 1 more answer
Q2. How will you add caching to improve fast response
Ans. 
Implement caching by storing frequently accessed data in memory to improve response time.
• Identify frequently accessed data that can be cached

• Choose an appropriate caching strategy (e.g. in-memory caching, distributed caching)

• Implement caching mechanisms such as Redis or Memcached

• Set expiration policies for cached data to ensure freshness

• Monitor cache performance and adjust as needed
Answered by AI
Add your answer

Python and SQL questions were asked

Q1. I was asked about the project
Add your answer

Q1. ACID properties of DBMS
Ans. 
ACID properties ensure data integrity in DBMS: Atomicity, Consistency, Isolation, Durability.
• Atomicity ensures that all operations in a transaction are completed successfully or none at all.

• Consistency ensures that the database remains in a consistent state before and after the transaction.

• Isolation ensures that multiple transactions can be executed concurrently without affecting each other.

• Durability ensures that once...read more
Answered by AI
Add your answer

Q1. HR question and family background
Add your answer

Medium level coding questions on hackerrank ,1:30hr, topic- Array , DP , Matrix , Binary Search

Q1. Was Asked to Implement Hashmap and Question on OOPS and Dbms , SQL and Indexing
Add your answer

Q1. Brief Introduction
Add your answer
Q2. Rotten Oranges and basics of bfs and DFS
Add your answer

Q1. The interviewer asked all the concepts of pyspark, ETL and a code on dsa
Add your answer

This was my first campus drive,& it was one of the hardest one too.We had 3 coding problems for 60 mins.It was held on HackerRank & it was not so hard but not so easy for the beginners.
1)Lambda Sort
2) and 3) ques on SQL
It was different ques for each one.

Graph, DP, array, Stack

Q1. Implementation of OOPS, Project, C++, To write the SQL query, Puzzle, real life questions, string question
Add your answer