AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
Jungleworks
Compare
Filter interviews by
Jungleworks Interview Questions, Process, and Tips for Experienced
Top Jungleworks Interview Questions and Answers for Experienced
- Q1. palindrome string problemasked in Full Stack Developer interview
- Q2. merger two sorted arraysasked in Full Stack Developer interview
- Q3. array leaders, find all the leaders in the arrayasked in Associate Engineer interview
Jungleworks Interview Experiences for Experienced
4 interviews found
Anonymous
I applied via Hirist and was interviewed in Sep 2024. There was 1 interview round.
(2 Questions)
- Q1. Palindrome string problem
- Ans.
Check if a string is a palindrome or not.
Create a function that compares the string with its reverse.
Ignore spaces and punctuation when checking for palindrome.
Examples: 'racecar', 'A man, a plan, a canal, Panama!'
- Q2. Merger two sorted arrays
- Ans.
Merging two sorted arrays into a single sorted array
Create a new array to store the merged result
Use two pointers to iterate through the two input arrays and compare elements
Add the smaller element to the new array and move the pointer for that array forward
Continue this process until all elements are merged
Skills evaluated in this interview
Full Stack Developer Interview Questions asked at other Companies
I was interviewed in May 2024.
(1 Question)
- Q1. Asked a programming question based on string where you have to tell the occurrence of very character in the string.
Full Stack Developer Interview Questions asked at other Companies
Selected
I applied via Approached by Company and was interviewed in Jul 2023. There were 2 interview rounds.
Low aptitude questions, only willing to know if you can work 24 hours, 7 days a week.
(1 Question)
- Q1. Two Questions. What is CAC and Lifecycle
Interview Preparation Tips
Business Development Manager Interview Questions asked at other Companies
Selected
I applied via Campus Placement and was interviewed before Sep 2023. There were 2 interview rounds.
(2 Questions)
- Q1. Array leaders, find all the leaders in the array
- Ans.
Find all the leaders in an array of strings
Iterate through the array and for each element, check if it is greater than all elements to its right
Store the leaders in a separate array
Example: Input array ['5', '10', '3', '8', '2'], leaders are '10' and '8'
- Q2. Reverse a linked list
- Ans.
Reverse a linked list by changing the next pointers of each node
Start with three pointers: prev = null, current = head, next = null
Iterate through the list, updating the next pointer of each node to point to the previous node
Update prev, current, and next pointers for next iteration
Task is to find first equilibrium point in an array
Interview Preparation Tips
Skills evaluated in this interview
Associate Engineer Interview Questions asked at other Companies
Jungleworks interview questions for popular designations
Top trending discussions
Interview questions from similar companies
I was interviewed before Feb 2021.
(1 Question)
Round duration - 65 minutes
Round difficulty - Easy
There were 2 sections –
Aptitude and Logical Reasoning and MCQ based on Java question ,C++, coding for 20 min and 45 min respectively.
Section A- Not very difficult to clear this round although less time was a problem.
Section B- It contains 15 multiple choice question on c/c++,java and 4 simple coding questions
- Q1.
Cycle Detection in a Singly Linked List
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's
nextpoints back to a previous node in the ... - Ans.
Detect if a singly linked list forms a cycle by checking if a node's next pointer points back to a previous node.
Traverse the linked list using two pointers, one moving at double the speed of the other.
If the two pointers meet at any point, there is a cycle in the linked list.
Use Floyd's Cycle Detection Algorithm for O(N) time complexity and O(1) space complexity.
(3 Questions)
Round duration - 75 minutes
Round difficulty - Medium
It was an online coding test in which 3 coding question were given.
- Q1.
Smallest Window Problem Statement
Given two strings,
SandX, your task is to find the smallest substring inSthat contains all the characters present inX.Example:
Input:
S = "abdd", X = "bd"
Outpu...
- Ans.
Find the smallest substring in string S that contains all characters in string X.
Iterate through string S and keep track of characters in X found in a window
Use two pointers to maintain the window and slide it to find the smallest window
Return the smallest window containing all characters in X
- Q2.
Smallest Integer Not Representable as Subset Sum
Given a non-decreasing sorted array
ARRofNpositive numbers, determine the smallest positive integer that cannot be expressed as the sum of elements from... - Ans.
Find the smallest positive integer that cannot be expressed as the sum of elements from any proper subset of a non-decreasing sorted array of positive numbers.
Start with the smallest possible integer that cannot be represented, which is 1.
Iterate through the array and update the smallest integer that cannot be represented.
If the current element is greater than the smallest integer that cannot be represented, return tha...
- Q3.
Minimum Steps for a Knight to Reach Target
Given a square chessboard of size 'N x N', determine the minimum number of moves a Knight requires to reach a specified target position from its initial position...
- Ans.
Calculate the minimum number of moves a Knight needs to reach a target position on a chessboard.
Implement a function that takes knight's starting position, target position, and chessboard size as input
Use breadth-first search algorithm to find the shortest path for the Knight
Consider all possible 8 movements of the Knight on the chessboard
Return the minimum number of moves required for the Knight to reach the target po
(4 Questions)
Round duration - 60 minutes
Round difficulty - Easy
It started with a discussion on the programs given in coding round. They asked me about my interest field after that they directly jumped into Networking, Linux and Ethical Hacking part looking my interest domain. They asked me various question on networking and linux.
Then they asked me to code a simple c program
- Q1.
Reverse Linked List Problem Statement
Given a singly linked list of integers, return the head of the reversed linked list.
Example:
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link... - Ans.
Reverse a singly linked list of integers and return the head of the reversed linked list.
Iterate through the linked list and reverse the pointers to point to the previous node.
Keep track of the current, previous, and next nodes while reversing the linked list.
Update the head of the reversed linked list as the last node encountered during reversal.
- Q2. What are the port numbers of protocols such as FTP and SMTP?
- Ans.
FTP uses port number 21 and SMTP uses port number 25.
FTP uses port 21 for data transfer and port 20 for control information.
SMTP uses port 25 for email communication.
Understanding port numbers is important for network communication.
- Q3. Can you explain the OSI Model?
- Ans.
The OSI Model is a conceptual framework that standardizes the functions of a telecommunication or computing system into seven layers.
The OSI Model stands for Open Systems Interconnection Model.
It consists of seven layers: Physical, Data Link, Network, Transport, Session, Presentation, and Application.
Each layer has specific functions and communicates with the adjacent layers.
Example: Layer 1 (Physical) deals with physi...
- Q4. How do you copy files in Linux?
- Ans.
To copy files in Linux, you can use the 'cp' command.
Use the 'cp' command followed by the source file and destination directory to copy a file.
To copy a directory and its contents, use the '-r' flag with the 'cp' command.
You can also use wildcards like '*' to copy multiple files at once.
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Interview Questionnaire
8 Questions
- Q1. Find out the subset of an array of continuous positive numbers from a larger array whose sum of of the elements is larger in comparision to other subset. eg: {1,2 5 -7, 2 5} .The two subarrays are {1,2,5} ...
- Ans.
Find the subset of an array with the largest sum of continuous positive numbers.
Iterate through the array and keep track of the current sum and the maximum sum seen so far.
If the current element is positive, add it to the current sum. If it is negative, reset the current sum to 0.
Also keep track of the start and end indices of the maximum sum subset.
Return the subset using the start and end indices.
- Q2. Given two classes C1 and C2 which are almost same.(remember not exactly same). You want to choose best among these classes so that it can be use as key in hashmap. What question will you ask regarding two ...
- Q3. You are given two strings s1 and s2.Now, find the smallest substring in s1 containing all characters of s2
- Ans.
Find smallest substring in s1 containing all characters of s2.
Create a hash table of characters in s2
Use sliding window technique to find smallest substring in s1
Check if all characters in s2 are present in the substring
Update the smallest substring if a smaller one is found
- Q4. Questions on OOPS (almost all the concepts were covered like polymorphism, overriding, overloading, inheritance, concept of virtual fxns etc.)
- Q5. Write algo for reversing a linked list
- Ans.
Algorithm to reverse a linked list
Create a new empty linked list
Traverse the original linked list and insert each node at the beginning of the new list
Return the new list
- Q6. What is lazy loading? Advantages and disadvantages of the same?
- Ans.
Lazy loading is a technique used to defer the loading of non-critical resources until they are needed.
Advantages: faster initial page load, reduced bandwidth usage, improved user experience
Disadvantages: increased complexity, potential for slower subsequent page loads, difficulty with SEO
Examples: images, videos, and other media files can be loaded only when they are visible on the screen
- Q7. How ajax works? Difference between angular js and jquery?
- Ans.
Ajax is a technique for creating fast and dynamic web pages. AngularJS is a framework for building dynamic web applications, while jQuery is a library for simplifying HTML DOM traversal and manipulation.
Ajax stands for Asynchronous JavaScript and XML
It allows web pages to be updated asynchronously by exchanging data with a web server behind the scenes
AngularJS is a JavaScript framework that extends HTML with new attrib...
- Q8. Design a traffic light system?
- Ans.
A traffic light system controls the flow of traffic at intersections.
The system consists of three lights: red, yellow, and green.
Each light has a specific duration for which it stays on.
The system also includes sensors to detect the presence of vehicles and pedestrians.
The duration of each light can be adjusted based on traffic patterns.
The system can be connected to a central control system for remote monitoring and m
Interview Preparation Tips
College Name: na
Skills evaluated in this interview
I was interviewed before Feb 2021.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical round with 3 problems based on DSA and Algorithms.
- Q1.
Smallest Integer Not Representable as Subset Sum
Given a non-decreasing sorted array
ARRofNpositive numbers, determine the smallest positive integer that cannot be expressed as the sum of elements from... - Ans.
Find the smallest positive integer that cannot be expressed as the sum of elements from any proper subset of a given array.
Sort the array in non-decreasing order.
Iterate through the array and keep track of the smallest sum that can be formed.
If the next element in the array is greater than the current sum + 1, then the answer is the current sum + 1.
Return the answer as the smallest integer not representable as a subset
- Q2.
Reverse Linked List Problem Statement
Given a singly linked list of integers, return the head of the reversed linked list.
Example:
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link... - Ans.
Reverse a singly linked list of integers and return the head of the reversed linked list.
Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.
Use three pointers to keep track of the current, previous, and next nodes while reversing the linked list.
Update the head of the reversed linked list to be the last node encountered during the reversal process.
- Q3.
Smallest Window Problem Statement
Given two strings
SandXcontaining random characters, the task is to find the smallest substring inSwhich contains all the characters present inX.Input:
The first... - Ans.
The task is to find the smallest substring in string S which contains all the characters present in string X.
Iterate through string S and keep track of characters in X using a hashmap
Use two pointers to maintain a sliding window and find the smallest window containing all characters in X
Return the smallest window found
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
Technical round with questions based on OOPS and Angular.
- Q1. What are the different OOP concepts?
- Ans.
OOP concepts include inheritance, encapsulation, polymorphism, and abstraction.
Inheritance allows a class to inherit properties and behavior from another class.
Encapsulation restricts access to certain components of an object, protecting its integrity.
Polymorphism allows objects to be treated as instances of their parent class.
Abstraction hides the complex implementation details of an object and only shows the necessar
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Questions based on System Design, ajax, jquery were asked.
- Q1. How would you design a traffic light system?
- Ans.
Designing a traffic light system involves creating a system that controls the flow of traffic at intersections.
Divide the traffic light system into three main lights: red, yellow, and green.
Implement timers to control the duration of each light.
Include sensors to detect the presence of vehicles and pedestrians.
Consider implementing a pedestrian crossing signal.
Integrate a central control system to coordinate the timing
- Q2. How does AJAX work?
- Ans.
AJAX allows for asynchronous communication between client and server without needing to reload the entire page.
AJAX stands for Asynchronous JavaScript and XML.
It allows for sending and receiving data from a server without reloading the entire page.
AJAX uses XMLHttpRequest object to make requests to the server.
It can update parts of a web page without requiring a full page reload.
Commonly used in web applications to pro
- Q3. What is the difference between AngularJS and jQuery?
- Ans.
AngularJS is a full-fledged MVC framework for building dynamic web applications, while jQuery is a lightweight library for DOM manipulation and event handling.
AngularJS is a full-fledged MVC framework, providing features like two-way data binding, dependency injection, and routing.
jQuery is a lightweight library primarily used for DOM manipulation and event handling.
AngularJS is suitable for building single-page applic...
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
I was interviewed before Dec 2020.
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.
- Q1.
Binary Tree Traversals Problem Statement
Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...
- Ans.
Compute the In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.
Implement functions to perform In-Order, Pre-Order, and Post-Order traversals of a Binary Tree.
Use level-order input to construct the Binary Tree.
Traverse the Binary Tree recursively to generate the required traversals.
Ensure proper handling of null nodes represented by -1 in the input.
Return the three traversals as
- Q2.
Reverse Linked List Problem Statement
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
Input:
The first line of input is an intege... - Ans.
Reverse a singly linked list by altering the links between nodes.
Iterate through the linked list and reverse the links between nodes
Use three pointers to keep track of the current, previous, and next nodes
Update the links between nodes to reverse the list
Return the head of the reversed linked list
(1 Question)
Round duration - 45 Minutes
Round difficulty - Medium
This round basically tested some concepts from Data Structures and File Manipulation .
- Q1.
Intersection of Two Arrays Problem Statement
Given two arrays
AandBwith sizesNandMrespectively, both sorted in non-decreasing order, determine their intersection.The intersection of two arrays in...
- Ans.
The problem involves finding the intersection of two sorted arrays efficiently.
Use two pointers to iterate through both arrays simultaneously.
Compare elements at the pointers and move the pointers accordingly.
Handle cases where elements are equal and update the intersection array.
Return the intersection array as the result.
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Interview Questionnaire
21 Questions
- Q1. Discussion of previous written test questions
- Q2. Find the odd repeating element from a set of repeating elements
- Ans.
Find the odd repeating element from an array of strings
Use a hash table to count the frequency of each element
Iterate through the hash table to find the element with an odd count
- Q3. A 2D matrix is given which is row wise and column wise sorted. Find a particular element from it
- Ans.
Finding an element in a sorted 2D matrix
Start from the top right corner or bottom left corner
Compare the target element with the current element
Move left or down if the target is smaller, else move right or up
Repeat until the target is found or all elements are checked
- Q4. SQL Query to find Nth highest salary from table
- Ans.
SQL query to find Nth highest salary from table
Use ORDER BY and LIMIT clauses
Use subquery to get the Nth highest salary
Handle cases where there are less than N distinct salaries
- Q5. Another basic SQL query
- Q6. Write a function that returns '3' when '4' is passed as an input and vice versa without using if-else condition
- Ans.
Function to swap '3' and '4' without using if-else
Use XOR operator to swap the values
Convert the input to ASCII code and perform the swap
Use a lookup table to map the values
- Q7. Question on Suffix trees
- Q8. Question on Tries
- Q9. Question on Ternary search trees
- Q10. Question on hash maps
- Q11. Question on complexity of an algorithm
- Q12. 3-4 SQL queries
- Q13. Question on SQL joins
- Q14. JAVA questions on static block,static function and static variables
- Q15. JAVA questions on memory initialization and references
- Q16. Puzzle on measuring exactly half a glass of water
- Q17. Introduce yourself
- Ans.
I am a software developer with experience in Java and Python.
Proficient in Java and Python programming languages
Experience in developing web applications using Spring framework
Familiarity with database management systems like MySQL and MongoDB
- Q18. Why PAYTM?
- Ans.
PAYTM is a leading digital payment platform in India with a wide range of services.
PAYTM has a user-friendly interface and offers a seamless payment experience.
It provides a variety of services like mobile recharges, bill payments, and online shopping.
PAYTM has a strong focus on security and fraud prevention measures.
It has a large user base and is widely accepted by merchants across India.
PAYTM is constantly innovatin...
- Q19. Will you go for further studies?
- Ans.
Yes, I am open to pursuing further studies in the future.
I believe in continuous learning and staying updated with the latest technologies.
Further studies can help me specialize in a particular field and enhance my skills.
I may consider pursuing a master's degree in computer science or a related field.
However, my immediate focus is on gaining practical experience and contributing to the organization.
- Q20. Why do you think has PAYTM grown so fast?
- Ans.
PAYTM grew fast due to its innovative approach and early adoption of digital payments.
Early adoption of digital payments in India
Innovative approach with features like mobile recharges, bill payments, and cashback offers
Expansion into e-commerce and financial services
Strategic partnerships with major companies like Uber and Alibaba
- Q21. (looking at my CGPA of 9) You can get a better company. Then Why PAYTM only?
Interview Preparation Tips
Experience: there were 20 mcqs and 2 coding questions. It was a pen and paper test. We were given 1 hour to solve it. The mcqs were of average difficulty. The 2 coding questions were:
1. A variation of the standard Josephus Problem
2. Find the 'x' largest elements from 'n' input elements without using sorting.
Tips: They focus on algorithms not on complete solutions. Do not leave any question unattempted. If you do not know the exact approach then use Brute-Force approach.
Round: Technical Interview
Experience: The Interviewer was very nice. He was focussing on the approach used not on codes.
Tips: Be calm and think by basics :)
Round: Technical Interview
Experience: The interviewer asked high level data structures in this round. But again he saw the approach used and not exact solution
Tips: Don't give up. Tell whatever you know
Round: Technical Interview
Experience: JAVA questions were based on very detailed concepts. Study OOP properly.
Tips: Maintain your calm :)
Round: HR Interview
Experience: Overall the experience was nice and smooth.
Tips: If they allow you to ask them any question then ask them something about the company. They should find you interested in the company :)
General Tips: Just be cool. Show them you are enthusiastic to learn and work. While prepration focus on Basics and Algorithms. Prepare DBMS nicely too :)
Skill Tips: Have full knowledge about your projects
Skills: JAVA, Data Structures, Operating systems, Network Programming, DBMS
College Name: NIT Jalandhar
Motivation: PAYTM is a perfect mix for the dynamic startup culture and stability of a big organiztaion. PAYTM has an amazing work culture and excellent opportunities for growth
Skills evaluated in this interview
MAYANK DEEP
Interview Preparation Tips
Experience: There were 3 Questions . One on String manipulation and two were on Binary Trees. All were easy but there was time constraint.
Tips: Practice as many question as possible.
Duration: 60 minutes
Total Questions: 3
Round: Technical Interview
Experience: I was given the problem to design a car pooling system complete with the required classes .. data structures which would be used ... how the database would look like etc..
Tips: General understanding of databases and OOP concepts would do.
Round: Technical Interview
Tips: Be thorough and have in-depth knowledge of each and every point of your resume.
College Name: BITS Pilani
Jungleworks Interview FAQs
The duration of Jungleworks interview process can vary, but typically it takes about less than 2 weeks to complete.
Tell us how to improve this page.
Jungleworks Interviews By Designations
- Jungleworks Associate Software Engineer Interview Questions
- Jungleworks Software Developer Interview Questions
- Jungleworks Full Stack Developer Interview Questions
- Jungleworks Business Development Trainee Interview Questions
- Jungleworks Software Sales Executive Interview Questions
- Jungleworks Technical Trainee Interview Questions
- Jungleworks Business Development Manager Interview Questions
- Jungleworks Associate Engineer Interview Questions
- Show more
Interview Questions for Popular Designations
Jungleworks Interview Process for Experienced
based on 5 interviews
Interview experience
Interview Questions from Similar Companies
Fast track your campus placements
Jungleworks Reviews and Ratings
based on 66 reviews
Rating in categories
|
Associate Software Engineer
38
salaries
|  ₹0 L/yr - ₹0 L/yr |
|
Business Development Executive
35
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Business Development Manager
28
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Software Engineer
24
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Product Manager
16
salaries
| ₹0 L/yr - ₹0 L/yr |
Zoho
Freshworks
Paytm
Ola Cabs
- Home >
- Interviews >
- Jungleworks Interview Questions >
- Jungleworks Interview Questions for Experienced
