Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Jungleworks Team. If you also belong to the team, you can get access from here

Jungleworks Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Jungleworks Interview Questions, Process, and Tips for Experienced

Updated 18 Jan 2025

Top Jungleworks Interview Questions and Answers for Experienced

Jungleworks Interview Experiences for Experienced

Popular Designations

4 interviews found

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
-

I applied via Hirist and was interviewed in Sep 2024. There was 1 interview round.

Round 1 - Technical 

(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!'

  • Answered by AI
  • 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

  • Answered by AI

Skills evaluated in this interview

Full Stack Developer Interview Questions asked at other Companies

Q1. Query and Matrix Problem Statement You are given a binary matrix with 'M' rows and 'N' columns, initially consisting of all 0s. You will receive 'Q' queries, which can be of four types: Query 1: 1 R indexQuery 2: 1 C indexQuery 3: 2 R index... read more
View answer (1)
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I appeared for an interview in May 2024.

Round 1 - Technical 

(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

Q1. Query and Matrix Problem Statement You are given a binary matrix with 'M' rows and 'N' columns, initially consisting of all 0s. You will receive 'Q' queries, which can be of four types: Query 1: 1 R indexQuery 2: 1 C indexQuery 3: 2 R index... read more
View answer (1)
Interview experience
1
Bad
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Approached by Company and was interviewed in Jul 2023. There were 2 interview rounds.

Round 1 - Aptitude Test 

Low aptitude questions, only willing to know if you can work 24 hours, 7 days a week.

Round 2 - One-on-one 

(1 Question)

  • Q1. Two Questions. What is CAC and Lifecycle

Interview Preparation Tips

Interview preparation tips for other job seekers - Just Tell them that you can work 24 hours are day and 7 days a week and you'll get the job.

Business Development Manager Interview Questions asked at other Companies

Q1. If your not getting support from bank or agent, then what will make further to generate business, what is the approach or strategy to be implemented during such cases to convince the customers ?
View answer (14)
Interview experience
4
Good
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Sep 2023. There were 2 interview rounds.

Round 1 - HR 

(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'

  • Answered by AI
  • 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

  • Answered by AI
Round 2 - Coding Test 

Task is to find first equilibrium point in an array

Interview Preparation Tips

Interview preparation tips for other job seekers - focus on array and lined list

Skills evaluated in this interview

Associate Engineer Interview Questions asked at other Companies

Q1. Count Ways To Reach The N-th Stair Problem Statement You are given a number of stairs, N. Starting at the 0th stair, you need to reach the Nth stair. Each time you can either climb one step or two steps. You have to return the number of dis... read more
View answer (1)

Jungleworks interview questions for popular designations

 Associate Software Engineer

 (3)

 Software Developer

 (2)

 Full Stack Developer

 (2)

 Business Development Trainee

 (1)

 Software Sales Executive

 (1)

 Technical Trainee

 (1)

 Business Development Manager

 (1)

 Associate Engineer

 (1)

Interview questions from similar companies

I applied via Campus Placement and was interviewed before May 2020. There were 5 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Basic SQL Queries, some very basic Java questions, the interviewer herself didn't know much about coding in general.

Interview Preparation Tips

Interview preparation tips for other job seekers - Yodlee is a big company will several departments, every department has its own requirements.

I was inducted into the IAE department as an ASE through pool-campus placement.

The issue at Yodlee is that it's IAE department that they actively hire for, is the worst department as far as technical growth and knowledge are concerned. There is no learning. Hence usually the interviewers (mostly the directors, managers, and leads in IAE) who have been in the organization for a very large part of their career, are also very weak as far as their technical skills are concerned. Their political and toxic managerial skills skyrocket though. They stay there for too long and become virtually outdated in terms of their technical skills.

Therefore you can rest be assured that the interview quality will be well below average as far as IAE is concerned. I am not sure about other departments, but I would not assume otherwise. I would suggest, if you have to absolutely join IAE in Yodlee, just an average preparation would be more than enough. If you have other opportunities, I would suggest prioritizing them over Yodlee.

Interview Questionnaire 

9 Questions

  • Q1. Questions related to the work done at my previous company
  • Q2. Find if a given directed graph is cyclic or not
  • Ans. 

    To check if a directed graph is cyclic or not

    • Use Depth First Search (DFS) algorithm to traverse the graph

    • Maintain a visited set to keep track of visited nodes

    • Maintain a recursion stack to keep track of nodes in the current DFS traversal

    • If a node is visited and is already in the recursion stack, then the graph is cyclic

    • If DFS traversal completes without finding a cycle, then the graph is acyclic

  • Answered by AI
  • Q3. You have a stream of bytes from which you can read one byte at a time. You only have enough space to store one byte. After processing those bytes, you have to return a random byte. Note: The probability of...
  • Ans. 

    Return a random byte from a stream of bytes with equal probability.

    • Create a variable to store the count of bytes read

    • Create a variable to store the current random byte

    • For each byte read, generate a random number between 0 and the count of bytes read

    • If the random number is 0, store the current byte as the random byte

    • Return the random byte

  • Answered by AI
  • Q4. Find if a given Binary Tree is BST or not
  • Ans. 

    Check if a binary tree is a binary search tree or not.

    • Traverse the tree in-order and check if the values are in ascending order.

    • For each node, check if its value is greater than the maximum value of its left subtree and less than the minimum value of its right subtree.

    • Use recursion to check if all nodes in the tree satisfy the above condition.

  • Answered by AI
  • Q5. Devise an algorithm to determine the Nth-to-Last element in a singly linked list of unknown length. If N = 0, then your algorithm must return the last element. You should parse the list only once
  • Ans. 

    Algorithm to find Nth-to-Last element in a singly linked list of unknown length

    • Traverse the list and maintain two pointers, one at the beginning and one at Nth node from beginning

    • Move both pointers simultaneously until the second pointer reaches the end of the list

    • The first pointer will be pointing to the Nth-to-Last element

    • If N=0, return the last element

    • Parse the list only once

  • Answered by AI
  • Q6. Given an array of integers, print all possible permutations. Also explain your approach
  • Ans. 

    Print all possible permutations of an array of integers

    • Use recursion to swap elements and generate permutations

    • Start with the first element and swap it with each subsequent element

    • Repeat the process for the remaining elements

    • Stop when all elements have been swapped with the first element

    • Print each permutation as it is generated

  • Answered by AI
  • Q7. Design a Stack DS that also prints in O(1) the minimum element you pushed in the stack
  • Ans. 

    Design a stack that prints the minimum element pushed in O(1)

    • Use two stacks, one for storing elements and another for storing minimums

    • When pushing an element, compare it with the top of minimum stack and push the smaller one

    • When popping an element, pop from both stacks

    • To get the minimum element, just return the top of minimum stack

  • Answered by AI
  • Q8. Given a linked list with loop, how would you find the starting point of the loop ?
  • Ans. 

    To find the starting point of a loop in a linked list, use Floyd's cycle-finding algorithm.

    • Use two pointers, one moving at twice the speed of the other.

    • When they meet, move one pointer to the head of the list and keep the other at the meeting point.

    • Move both pointers one step at a time until they meet again, which is the starting point of the loop.

  • Answered by AI
  • Q9. Find a number a matrix mat[m][n] where all the rows and columns are sorted non-decreasingly. What will be the complexity of the solution
  • Ans. 

    To find a number in a matrix where all rows and columns are sorted non-decreasingly. Complexity of the solution.

    • Use binary search to find the number in each row and column

    • Start from the top-right corner or bottom-left corner to optimize search

    • Time complexity: O(m log n) or O(n log m) depending on the starting corner

  • Answered by AI

Interview Preparation Tips

Skills: Algorithm, Data structure
College Name: Na

Skills evaluated in this interview

I appeared for an interview before Apr 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

The second round is also written but you need to write programming based on their concept.

  • Q1. 

    Prime Numbers Identification

    Given a positive integer N, your task is to identify all prime numbers less than or equal to N.

    Explanation:

    A prime number is a natural number greater than 1 that has no po...

  • Ans. 

    Identify all prime numbers less than or equal to a given positive integer N.

    • Iterate from 2 to N and check if each number is prime

    • Use the Sieve of Eratosthenes algorithm for better efficiency

    • Optimize by only checking up to the square root of N for divisors

  • Answered by AI
  • Q2. 

    Palindrome String Validation

    Determine if a given string 'S' is a palindrome, considering only alphanumeric characters and ignoring spaces and symbols.

    Note:
    The string 'S' should be evaluated in a case...
  • Ans. 

    Check if a given string is a palindrome after removing special characters, spaces, and converting to lowercase.

    • Remove special characters and spaces from the string

    • Convert the string to lowercase

    • Check if the modified string is a palindrome by comparing characters from start and end

  • Answered by AI
Round 2 - Face to Face 

(6 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical round with questions mainly on Java and OOPS concepts.

  • Q1. What is the difference between static methods and instance methods in Java?
  • Ans. 

    Static methods belong to the class itself, while instance methods belong to individual objects of the class.

    • Static methods are called using the class name, while instance methods are called using object references.

    • Static methods cannot access instance variables directly, while instance methods can access both static and instance variables.

    • Static methods are shared among all instances of the class, while instance method...

  • Answered by AI
  • Q2. What is the difference between an abstract class and an interface in Java?
  • Ans. 

    Abstract class can have both abstract and non-abstract methods, while interface can only have abstract methods.

    • Abstract class can have constructors, member variables, and methods with implementation.

    • Interface can only have abstract methods and constants.

    • A class can implement multiple interfaces but can only extend one abstract class.

    • Example: Abstract class - Animal with abstract method 'eat', Interface - Flyable with m

  • Answered by AI
  • Q3. What is the difference between ClassNotFoundException and NoClassDefFoundError in Java?
  • Ans. 

    ClassNotFoundException occurs when a class is not found during runtime, while NoClassDefFoundError occurs when a class was found during compilation but not during runtime.

    • ClassNotFoundException is a checked exception, while NoClassDefFoundError is an Error.

    • ClassNotFoundException occurs when a class is not found at runtime, usually due to a missing classpath or incorrect class name.

    • NoClassDefFoundError occurs when a cla...

  • Answered by AI
  • Q4. What is the difference between an Error and an Exception in Java?
  • Ans. 

    Error is a serious issue that cannot be handled at runtime, while Exception is a recoverable issue that can be caught and handled.

    • Error is a subclass of Throwable and is usually caused by the environment or system, such as running out of memory or stack overflow.

    • Exception is also a subclass of Throwable but is caused by the application code, such as invalid input or file not found.

    • Errors are unchecked and are not meant...

  • Answered by AI
  • Q5. What is SerialVersionUID in Java?
  • Ans. 

    SerialVersionUID is a unique identifier used by Java to ensure the compatibility of serialized objects.

    • SerialVersionUID is a static final long variable in a class that implements Serializable interface.

    • It is used to ensure that the serialized object can be deserialized correctly even if the class definition has changed.

    • If the SerialVersionUID of the serialized object does not match the one in the class, an InvalidClass...

  • Answered by AI
  • Q6. What are the requirements for creating an immutable class in Java?
  • Ans. 

    Requirements for creating an immutable class in Java

    • Make the class final so it cannot be extended

    • Make all fields private and final

    • Do not provide setter methods, only getter methods

    • Ensure that mutable objects are not returned in getter methods

    • Override equals() and hashCode() methods for proper comparison

    • Consider making defensive copies of mutable fields in constructor or getter methods

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAYodlee interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Company Website and was interviewed before May 2018. There were 3 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. Questions about Oops, data structures based on the projects I had done, and my resume
  • Q2. Questions about classes and abstraction

Interview Preparation Tips

Interview preparation tips for other job seekers - 2 parts; part 1 is a coding test and part 2 is discussion.

I applied via Naukri.com and was interviewed before Jul 2019. There were 4 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. Questions about the projects you worked with. About how specific coding challenges were solved. How it could have been done other ways. etc.
  • Q2. About Python versions and differences. Impact on frameworks.
  • Q3. About module design, apis.

Interview Preparation Tips

Interview preparation tips for other job seekers - It is a relaxed interview, like a discussion. The questions are tough in that they make you think. Review your previous projects and be honest.

I applied via Campus Placement and was interviewed in Sep 2021. There was 1 interview round.

Interview Preparation Tips

Interview preparation tips for other job seekers - Be thorough with DSA and low level design. Also have a good idea about Computer science fundamentals .

Jungleworks Interview FAQs

How many rounds are there in Jungleworks interview for experienced candidates?
Jungleworks interview process for experienced candidates usually has 1-2 rounds. The most common rounds in the Jungleworks interview process for experienced candidates are Technical, Aptitude Test and One-on-one Round.
How to prepare for Jungleworks interview for experienced candidates?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Jungleworks. The most common topics and skills that interviewers at Jungleworks expect are IT Sales, Sales, B2B Sales, IT Product Sales and CRM.
What are the top questions asked in Jungleworks interview for experienced candidates?

Some of the top questions asked at the Jungleworks interview for experienced candidates -

  1. array leaders, find all the leaders in the ar...read more
  2. palindrome string prob...read more
  3. merger two sorted arr...read more
How long is the Jungleworks interview process?

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 Interview Process for Experienced

based on 5 interviews

Interview experience

3.2
  
Average
View more

Interview Questions from Similar Companies

BrowserStack Interview Questions
3.6
 • 49 Interviews
Fingent Interview Questions
4.4
 • 22 Interviews
Backbase Interview Questions
3.7
 • 22 Interviews
3Pillar Global Interview Questions
3.3
 • 19 Interviews
Khoros Interview Questions
3.7
 • 19 Interviews
Mentor Graphics Interview Questions
4.0
 • 18 Interviews
Yodlee Interview Questions
3.8
 • 17 Interviews
Saviynt Interview Questions
2.5
 • 17 Interviews
View all

Jungleworks Reviews and Ratings

based on 69 reviews

2.3/5

Rating in categories

2.6

Skill development

2.1

Work-life balance

2.3

Salary

1.8

Job security

2.0

Company culture

2.1

Promotions

2.2

Work satisfaction

Explore 69 Reviews and Ratings
Associate Software Engineer
39 salaries
unlock blur

₹5 L/yr - ₹15.6 L/yr

Business Development Executive
35 salaries
unlock blur

₹2.4 L/yr - ₹8 L/yr

Business Development Manager
28 salaries
unlock blur

₹4.2 L/yr - ₹14 L/yr

Software Engineer
21 salaries
unlock blur

₹6 L/yr - ₹12 L/yr

Product Manager
16 salaries
unlock blur

₹10 L/yr - ₹22 L/yr

Explore more salaries
Compare Jungleworks with

Yodlee

3.8
Compare

Fingent

4.4
Compare

Bravura Solutions

3.9
Compare

CloudMoyo

4.1
Compare
Did you find this page helpful?
Yes No
write
Share an Interview