Upload Button Icon Add office photos
Engaged Employer

i

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

Cornerstone OnDemand Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Cornerstone OnDemand Java Developer Intern Interview Questions and Answers

Updated 24 Nov 2024

Cornerstone OnDemand Java Developer Intern Interview Experiences

Interview questions from similar companies

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Focused more on Logics and DSA

Round 2 - HR 

(1 Question)

  • Q1. Just with Formal Questions
Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Job Portal and was interviewed in Mar 2024. There were 2 interview rounds.

Round 1 - Aptitude Test 

Know your resume and your basics

Round 2 - Coding Test 

Know class diagrams. Very Huge for workday.

Interview Preparation Tips

Interview preparation tips for other job seekers - Just know your resume

I applied via Campus Placement and was interviewed in Nov 2021. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Reversing a string
  • Ans. 

    Reversing a string involves flipping the order of characters in a given string.

    • Create an empty string to store the reversed string

    • Iterate through the original string from the end to the beginning

    • Append each character to the empty string

    • Return the reversed string

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Basic question oh OS,threads,OOPS

Skills evaluated in this interview

I was interviewed in Oct 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 105 minutes
Round difficulty - Medium

There were 3 problems .
One was easy but the other two were of medium level.

  • Q1. 

    Aggressive Cows Problem Statement

    Given an array representing positions of stalls and an integer ‘K’ representing the number of aggressive cows, determine the largest minimum distance between any two cows ...

  • Ans. 

    The problem requires assigning aggressive cows to stalls in a way that maximizes the minimum distance between any two cows.

    • Sort the array of stall positions in ascending order.

    • Use binary search to find the largest minimum distance between cows.

    • Check if it is possible to assign cows with this minimum distance by iterating through the sorted array.

    • If it is possible, update the maximum distance and continue binary search ...

  • Answered by AI
  • Q2. 

    Shortest Path in an Unweighted Graph

    The city of Ninjaland is represented as an unweighted graph with houses and roads. There are 'N' houses numbered 1 to 'N', connected by 'M' bidirectional roads. A road...

  • Ans. 

    The problem is to find the shortest path between two houses in an unweighted graph.

    • The graph represents the city of Ninjaland with houses connected by roads.

    • The input consists of the number of test cases, number of houses and roads, starting and ending house, and the roads between houses.

    • The output is a vector of nodes representing the shortest path from the starting house to the ending house.

    • If there are multiple shor...

  • Answered by AI
  • Q3. 

    Count Set Bits Problem Statement

    Given a positive integer N, compute the total number of '1's in the binary representation of all numbers from 1 to N. Return this count modulo 1e9+7 because the result can...

  • Ans. 

    The task is to count the total number of '1' in the binary representation of all numbers from 1 to N.

    • Convert each number from 1 to N into its binary representation

    • Count the number of '1' bits in each binary representation

    • Sum up the counts of '1' bits for all numbers

    • Return the sum modulo 1e9+7

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

The interviewer was very polite and straightforward. 
Firstly he introduced himself and then asked me to introduce myself and then he jumped to the coding problems.
After the coding problems, he asked some questions from the OS and DBMS.

  • Q1. 

    Reverse Words in a String: Problem Statement

    You are given a string of length N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...

  • Ans. 

    The task is to reverse the words in a given string, removing any leading or trailing spaces and replacing multiple spaces between words with a single space.

    • Split the string into words using spaces as delimiters

    • Reverse the order of the words

    • Join the reversed words with a single space between them

    • Remove any leading or trailing spaces

  • Answered by AI
  • Q2. 

    Reverse Linked List in Groups of K

    You are provided with a linked list containing 'N' nodes and an integer 'K'. The task is to reverse the linked list in groups of size K, which means reversing the nodes ...

  • Ans. 

    The task is to reverse a linked list in groups of size K.

    • Iterate through the linked list in groups of size K

    • Reverse each group using a helper function

    • Connect the reversed groups to form the final reversed linked list

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

The interviewer was very polite and straightforward, firstly he introduce himself and then ask me to introduce myself and then ask some ques on my projects and then he jumps to the coding problems.

  • Q1. 

    Remove Consecutive Duplicates From String Problem Statement

    Given a string STR consisting of both lower and upper case characters, your task is to remove consecutive duplicate characters from the string a...

  • Ans. 

    The task is to remove consecutive duplicate characters from a given string and return the new string.

    • Iterate through the characters of the string

    • Compare each character with the next character

    • If they are the same, skip the next character

    • If they are different, add the current character to the new string

    • Return the new string

  • Answered by AI
  • Q2. 

    Maximum Path Sum in a Matrix

    Given an N*M matrix filled with integer numbers, determine the maximum sum that can be obtained from a path starting from any cell in the first row to any cell in the last row...

  • Ans. 

    The question asks to find the maximum sum that can be obtained from a path starting from any cell in the first row to any cell in the last row of a given matrix.

    • Iterate through each cell in the first row and calculate the maximum sum path ending at that cell

    • For each cell, calculate the maximum sum path ending at that cell by considering the three possible directions

    • Store the maximum sum path ending at each cell in a se...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Indian Institute Of Information Technology Sonepat. I applied for the job as SDE - 1 in GurgaonEligibility criteriaAbove 7 CGPA with no backlogs.PeopleStrong interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, DBMS, Operating Systems, Computer Networking, System Design, OOPS.Time required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Deep knowledge of the projects mentioned in your resume is a must.
Tip 2 : Practice must do GFG coding questions.
Tip 3 : Practice as many problems as you can from Leetcode.

Application resume tips for other job seekers

Tip 1 : Mention 1 or 2 projects in your resume.
Tip 2 : Don't put false things in your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
-
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Referral and was interviewed in Mar 2022. There were 2 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. Technical related to your skill
  • Q2. 2 rounds of technical interview
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - One-on-one 

(1 Question)

  • Q1. Oops XML MVC SQL
Round 2 - Technical 

(2 Questions)

  • Q1. Jquery tags syntax uses
  • Ans. 

    Jquery tags syntax uses angle brackets and CSS selectors.

    • Jquery tags are enclosed in angle brackets, like

      or

    • Jquery selectors are used to target specific elements, like $('p') or $('.class')

Answered by AI
  • Q2. Seting values XML data JSON data transfer
  • Skills evaluated in this interview

    Interview experience
    5
    Excellent
    Difficulty level
    -
    Process Duration
    -
    Result
    -
    Round 1 - One-on-one 

    (2 Questions)

    • Q1. Container with most water
    • Ans. 

      The container with most water problem involves finding the maximum area that can be formed between two vertical lines by selecting two points on a line.

      • Start with two pointers at the beginning and end of the array.

      • Calculate the area between the two pointers using the formula min(height[left], height[right]) * (right - left).

      • Move the pointer with the smaller height towards the center to potentially increase the area.

      • Rep

    • Answered by AI
    • Q2. Maximum subarray with 0 sum
    • Ans. 

      Find the maximum subarray with a sum of 0 in an array.

      • Iterate through the array and keep track of the running sum.

      • Store the running sum in a hashmap along with the index.

      • If the running sum is seen again, the subarray between the two occurrences has a sum of 0.

    • Answered by AI

    Skills evaluated in this interview

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

    I applied via Referral and was interviewed in Jul 2024. There were 3 interview rounds.

    Round 1 - Technical 

    (4 Questions)

    • Q1. Internal working of hashmap
    • Q2. What are collections
    • Q3. What are design Patterns explain singleton design pattern
    • Q4. What annotations did you use in spring boot. how @transaction annotation works
    Round 2 - Behavioral 

    (2 Questions)

    • Q1. Asked 2 puzzles
    • Q2. What is vertical scaling and horizontal scaling
    Round 3 - HR 

    (1 Question)

    • Q1. Salary Discussion
    Interview experience
    3
    Average
    Difficulty level
    Moderate
    Process Duration
    -
    Result
    -

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

    Round 1 - Technical 

    (5 Questions)

    • Q1. Explain OOPS concept and how you apply it in your implementation
    • Ans. 

      OOPS is a programming paradigm based on the concept of objects, which can contain data in the form of fields and code in the form of procedures.

      • OOPS focuses on the concept of classes and objects

      • Encapsulation: bundling data and methods that operate on the data within a single unit

      • Inheritance: allows a class to inherit properties and behavior from another class

      • Polymorphism: ability to present the same interface for diffe...

    • Answered by AI
    • Q2. Difference between Comparable and Comparator. Difference between Abstract Class and Interface
    • Ans. 

      Comparable is an interface used for natural ordering, Comparator is an interface used for custom ordering. Abstract class can have method implementations, Interface cannot.

      • Comparable interface is used to define the natural ordering of objects. Example: String class implements Comparable interface for natural ordering based on alphabetical order.

      • Comparator interface is used to define custom ordering of objects. Example:...

    • Answered by AI
    • Q3. Given a string. Find the number of occurrences of each character
    • Ans. 

      Count occurrences of each character in a given string

      • Create an array to store the count of each character

      • Iterate through the string and increment the count of each character in the array

      • Return the array with counts for each character

    • Answered by AI
    • Q4. Given an array. Remove the number of duplicates
    • Ans. 

      Remove duplicates from an array of strings

      • Iterate through the array and store each element in a set to keep track of unique values

      • Create a new array with the unique values from the set

    • Answered by AI
    • Q5. Given a student object having name and grade data variables. Sort the object on the basis of highest grade.

    Skills evaluated in this interview

    Cornerstone OnDemand Interview FAQs

    How many rounds are there in Cornerstone OnDemand Java Developer Intern interview?
    Cornerstone OnDemand interview process usually has 1 rounds. The most common rounds in the Cornerstone OnDemand interview process are Aptitude Test.

    Tell us how to improve this page.

    Cornerstone OnDemand Java Developer Intern Interview Process

    based on 1 interview

    Interview experience

    4
      
    Good
    View more

    Interview Questions from Similar Companies

    Globant Interview Questions
    3.8
     • 172 Interviews
    Chetu Interview Questions
    3.3
     • 172 Interviews
    Oracle Cerner Interview Questions
    3.7
     • 157 Interviews
    AVASOFT Interview Questions
    3.6
     • 146 Interviews
    ServiceNow Interview Questions
    4.1
     • 120 Interviews
    Thomson Reuters Interview Questions
    4.1
     • 112 Interviews
    Amadeus Interview Questions
    3.9
     • 107 Interviews
    UKG Interview Questions
    3.1
     • 100 Interviews
    SPRINKLR Interview Questions
    3.0
     • 100 Interviews
    View all
    Senior Software Engineer
    111 salaries
    unlock blur

    ₹0 L/yr - ₹0 L/yr

    Software Engineer
    83 salaries
    unlock blur

    ₹0 L/yr - ₹0 L/yr

    Lead Software Engineer
    55 salaries
    unlock blur

    ₹0 L/yr - ₹0 L/yr

    Associate Software Engineer
    31 salaries
    unlock blur

    ₹0 L/yr - ₹0 L/yr

    Principal Software Engineer
    25 salaries
    unlock blur

    ₹0 L/yr - ₹0 L/yr

    Explore more salaries
    Compare Cornerstone OnDemand with

    Saba Software

    4.4
    Compare

    PeopleStrong

    3.4
    Compare

    UKG

    3.1
    Compare

    Sumtotal Systems

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