Upload Button Icon Add office photos

Filter interviews by

IDeaS Revenue Solutions Software Developer Intern Interview Questions and Answers

Updated 18 Nov 2024

IDeaS Revenue Solutions Software Developer Intern Interview Experiences

2 interviews found

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

I applied via campus placement at BRACT's Vishwakarma Institute of Information Technology, Pune and was interviewed in May 2024. There were 2 interview rounds.

Round 1 - Aptitude Test 

Basic Aptitude questions and some questions related to testing faulty code.

Round 2 - Technical 

(2 Questions)

  • Q1. Explain your projects.
  • Q2. Java OOP questions
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via campus placement at BRACT's Vishwakarma Institute of Information Technology, Pune and was interviewed in Jan 2024. There were 2 interview rounds.

Round 1 - Aptitude Test 

It was good and easy test, all are aptitude questions, at least one coding question was there

Round 2 - One-on-one 

(2 Questions)

  • Q1. Tell me about your projects.
  • Ans. 

    Developed a web application for tracking personal fitness goals and progress.

    • Used HTML, CSS, and JavaScript for front-end development

    • Implemented a RESTful API using Node.js and Express for back-end functionality

    • Utilized MongoDB for database management

    • Incorporated chart.js for visualizing progress data

  • Answered by AI
  • Q2. Reverse a string
  • Ans. 

    Reverse a string

    • Use a loop to iterate through the characters of the string

    • Swap the characters from start to end of the string

    • Repeat until the entire string is reversed

  • Answered by AI

Software Developer Intern Interview Questions Asked at Other Companies

Q1. Sum of Maximum and Minimum Elements Problem Statement Given an ar ... read more
asked in Amazon
Q2. Fish Eater Problem Statement In a river where water flows from le ... read more
asked in Apple
Q3. Kevin and his Fruits Problem Statement Kevin has 'N' buckets, eac ... read more
asked in CommVault
Q4. Sliding Maximum Problem Statement Given an array of integers ARR ... read more
Q5. Reverse Words in a String: Problem Statement You are given a stri ... read more

Interview questions from similar companies

Interview experience
4
Good
Difficulty level
Hard
Process Duration
2-4 weeks
Result
Not Selected

I applied via campus placement at KIIT University, Bhuvaneshwar and was interviewed in Jul 2024. There were 2 interview rounds.

Round 1 - Coding Test 

It had mcq and 1 hard coding question

Round 2 - Technical 

(2 Questions)

  • Q1. They asked me about backtracking and dp series problem and also to solve the given question
  • Q2. Java and in depth about different pillars of java

Interview Preparation Tips

Interview preparation tips for other job seekers - Focus primarily on Java and advanced data structures and algorithms topics, such as backtracking and dynamic programming.
Interview experience
3
Average
Difficulty level
Hard
Process Duration
4-6 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in May 2024. There were 2 interview rounds.

Round 1 - Aptitude Test 

Moderate difficulty level questions were asked

Round 2 - Coding Test 

High difficulty level questions were asked

Interview Preparation Tips

Interview preparation tips for other job seekers - Tough process
Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - HR 

(2 Questions)

  • Q1. What was ur expected salary
  • Q2. Tell the needed one

Interview Preparation Tips

Interview preparation tips for other job seekers - Keep prepared for every round
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Coding Test 

DSA questions of array and strings

Round 3 - Technical 

(1 Question)

  • Q1. DSA on array advanced topics

Interview Preparation Tips

Interview preparation tips for other job seekers - DSA is must
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via campus placement at Birla Institute of Technology and Science (BITS), Pilani and was interviewed in Nov 2022. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Don’t add your photo or details such as gender, age, and address in your resume. These details do not add any value.
View all tips
Round 2 - Coding Test 

Coding test was easy, there were 2 questions.

Round 3 - Technical 

(1 Question)

  • Q1. Square root of a number in log n time
  • Ans. 

    Using binary search, square root of a number can be found in log n time.

    • Choose a range for the square root

    • Use binary search to find the square root within the range

    • Adjust the range based on whether the guess is too high or too low

  • Answered by AI
Round 4 - HR 

(2 Questions)

  • Q1. Basic questions on leadership and some problem based.
  • Q2. Basics questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Just be confident and try to give as many mock interviews as possible

Skills evaluated in this interview

I was interviewed in Dec 2020.

Round 1 - Video Call 

(3 Questions)

Round duration - 45 Minutes
Round difficulty - Easy

This round was held on Google Meet Video Call at 10 A.M.
There were 2 Interviewers and they were very helpful.

  • Q1. 

    Kth Largest Element Problem

    Given an array containing N distinct positive integers and a number K, determine the Kth largest element in the array.

    Example:

    Input:
    N = 6, K = 3, array = [2, 1, 5, 6, 3, ...
  • Ans. Brute Force
    • The most obvious brute force approach would be to sort the array in descending order and return the ‘K’th element from the beginning of the array.
    • Sort the array in descending order, for sorting most of the languages have their inbuilt sort methods which are usually very fast.
    • After sorting, return the element arr['K'-1](i.e. element at index ‘K’-1, considering 0-based indexing).
    Space Complexity: O(1)Explanati...
  • Answered Anonymously
  • Q2. Can you draw an E-R Diagram for Uber?
  • Q3. 

    Maximum Sum Path from Leaf to Root

    Given a binary tree with 'N' nodes, identify the path from a leaf node to the root node that has the maximum sum among all root-to-leaf paths.

    Example:

    All the possibl...

  • Ans. Recursive Subproblem

    The idea here is that we will do a recursive solution by asking the children of the current node for the max sum path and then choose the path with the max sum. 

     

    The approach will be as follows:

    1. Get the max sum path for the left subtree.
    2. Get the max sum path for the right subtree.
    3. Select the one with the max sum from both and insert current node's data into it.
    4. Return the updated path.
       

    Al...

  • Answered Anonymously
Round 2 - Video Call 

(1 Question)

Round duration - 30 Minutes
Round difficulty - Easy

The round was 2nd technical round conducted through Google Meet.
There were 2 interviewers and they were helpful.
Timing was from 11:10 A.M - 12:00 P.M

  • Q1. 

    Add Two Numbers Represented as Linked Lists

    Given two linked lists representing two non-negative integers, where the digits are stored in reverse order (i.e., starting from the least significant digit to ...

  • Ans. Recursion
    • A simple approach could be to recursively add the nodes of the linked list while keeping track of the carry generated.
    • The idea behind this approach is the same as finding the sum of two numbers manually on a paper, where we start by adding the LSD and move on till the MSD. Also, keeping track of the carry generated in every iteration.
    • As the linked lists represent the numbers in reverse order, the LSD occurs at...
  • Answered Anonymously
Round 3 - HR 

Round duration - 15 Minutes
Round difficulty - Easy

Timing was 12:30 P.M. to 1:00 P.M.
It was held on Google Meet and HR was helpful.

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in ChennaiEligibility criteria70% aboveHexaware Technologies interview preparation:Topics to prepare for the interview - Dynamic Programming, Sort and Search Algorithms, Graphs, Data Structures ( Priority Queue, stack, sets), Greedy Algorithms, OOPS, DBMSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

Tip 1 : Contribute time for course subjects also like OS,DBMS,OOPS.
Tip 2 : Start practicing on Leetcode and InterviewBit 1 month before your Placement Drive and try solving approx 300+ questions.
Tip 3 : Regularly Participate in Coding Contests on CodeForces and try to be Expert.

Application resume tips for other job seekers

Tip 1 : Don't try to lie in resume as questions can be asked on the same in depth.
Tip 2 : Mention atleast 1 project or past work experience.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before May 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 minutes
Round difficulty - Medium

It was in the morning. It had basic questions and 2 programming questions(1 string and 1 Data Structure)

  • Q1. 

    Character Pattern Problem Statement

    Generate a pattern based on the input number of rows N. Each row i should start with the i-th letter of the alphabet, and the number of letters in the row should match ...

  • Ans. Space Complexity: Explanation: Time Complexity: Explanation:
  • Answered Anonymously
  • Q2. 

    Stack using Two Queues Problem Statement

    Develop a Stack Data Structure to store integer values using two Queues internally.

    Your stack implementation should provide these public functions:

    Explanation:

    ...
  • Ans. Approach 1
    • This method ensures that every new element entered in the queue ‘q1’ is always at the front.
    • Hence, during pop operation, we just dequeue from ‘q1’.
    • For this, we need another queue ‘q2., which is used to keep every new element to the front of ‘q1’.
    • During push operation :
      • Enqueue new element ‘x’ to queue ‘q2’.
      • One by one, dequeue everything from ‘q1’ and enqueue to ‘q2’.
      • Swap the names of ‘q1’ and ‘q2’.
    • During pop o...
  • Answered Anonymously
Round 2 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

My interviewer asked me about my projects and the concepts involved in making it. Then he asked me to solve a string problem which was not very difficult followed by basic questions on array and it's properties. He also asked HTML tags.

  • Q1. 

    Reverse the String Problem Statement

    You are given a string STR which contains alphabets, numbers, and special characters. Your task is to reverse the string.

    Example:

    Input:
    STR = "abcde"
    Output:
    "e...
  • Ans. Optimal Solution
    • Traverse the string and swap the first character with the last character, the second character with the second last character and so on.
    • Basically, you need to swap the i-th character with the (N-i-1)-th character where N is the length of the string and 0-based indexing is considered.
    Space Complexity: O(1)Explanation:

    O(1).

     

    In the worst case, only constant extra space is required.

    Time Complexity: O(...
  • Answered Anonymously
Round 3 - HR 

Round duration - 150 minutes
Round difficulty - Easy

This round for Sapient was based on it's core values and how I've implemented these once or more in life. It mostly involved discussion around my leadership, team player, problem solving and innovative skills as a part of the clubs in college. Also, what are my expectations from Sapient and what I bring to them

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in GurgaonEligibility criteriaAbove 6 CGPA, 60% in 12th and 10thPublicis Sapient interview preparation:Topics to prepare for the interview - Strings, Arrays, Stack, Queue, Basics of HTML, Basics of CSS, OOPSTime required to prepare for the interview - 1 monthInterview preparation tips for other job seekers

Tip 1 : Be confident, clear and calm with the answers during interview
Tip 2 : Practice coding questions on based on different difficulty
Tip 3 : Prepare the topics thoroughly the questions might not be tough but they would be based on the core concept
Tip 4 : You should have at least 2 projects - JAVA and database related or Data Analytics

Application resume tips for other job seekers

Tip 1 : Projects are mandatory you can steer the interview in that direction
Tip 2 : Resume should only have what you actually know and did
Tip 3 : Add extra-curriculars (for Sapient it really matters if you have incidents related team building, leadership, conflict resolution experiences)

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
Selected Selected

I applied via Campus Placement and was interviewed before Oct 2022. There were 3 interview rounds.

Round 1 - Aptitude Test 

It was a 2hr test. It had two sections. 1)Quantitative aptitude and verbal ability and 2) Technical aptitude.

Round 2 - Technical 

(1 Question)

  • Q1. It was for 45 min. Asked some OOPs concepts, CN fundamentals. Questions were asked on arrays and linked lists. also on OS
Round 3 - HR 

(1 Question)

  • Q1. It was for 5 min. Asked on why I wanted to join Optum

Interview Preparation Tips

Interview preparation tips for other job seekers - Mention only things that you are perfect in resume. Don't add extra stuff and don't fake it.

IDeaS Revenue Solutions Interview FAQs

How many rounds are there in IDeaS Revenue Solutions Software Developer Intern interview?
IDeaS Revenue Solutions interview process usually has 2 rounds. The most common rounds in the IDeaS Revenue Solutions interview process are Aptitude Test, One-on-one Round and Technical.
What are the top questions asked in IDeaS Revenue Solutions Software Developer Intern interview?

Some of the top questions asked at the IDeaS Revenue Solutions Software Developer Intern interview -

  1. reverse a str...read more
  2. Java OOP questi...read more

Tell us how to improve this page.

IDeaS Revenue Solutions Software Developer Intern Interview Process

based on 2 interviews

Interview experience

4.5
  
Good
View more

IDeaS Revenue Solutions Software Developer Intern Reviews and Ratings

based on 1 review

4.0/5

Rating in categories

5.0

Skill development

4.0

Work-life balance

-

Salary

-

Job security

4.0

Company culture

-

Promotions

4.0

Work satisfaction

Explore 1 Review and Rating
Associate Technical Support Engineer
16 salaries
unlock blur

₹3.3 L/yr - ₹6.5 L/yr

Data Analyst
15 salaries
unlock blur

₹4 L/yr - ₹7.6 L/yr

Product Engineer
14 salaries
unlock blur

₹5 L/yr - ₹9.8 L/yr

Software Developer
12 salaries
unlock blur

₹9 L/yr - ₹12.4 L/yr

Software Engineer
11 salaries
unlock blur

₹8.5 L/yr - ₹19 L/yr

Explore more salaries
Compare IDeaS Revenue Solutions with

RateGain

4.0
Compare

RezNext Global Solutions

4.5
Compare

AxisRooms

4.0
Compare

Hotelogix

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