i
Cornerstone OnDemand
Filter interviews by
I applied via LinkedIn and was interviewed in May 2024. There was 1 interview round.
4 coding questions were asked regarding SQL and competitive programming
Top trending discussions
Focused more on Logics and DSA
I applied via Job Portal and was interviewed in Mar 2024. There were 2 interview rounds.
Know your resume and your basics
Know class diagrams. Very Huge for workday.
I applied via Campus Placement and was interviewed in Nov 2021. There were 3 interview rounds.
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
I was interviewed in Oct 2021.
Round duration - 105 minutes
Round difficulty - Medium
There were 3 problems .
One was easy but the other two were of medium level.
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 ...
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 ...
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...
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...
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...
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
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.
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...
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
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 ...
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
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.
Given a string STR
consisting of both lower and upper case characters, your task is to remove consecutive duplicate characters from the string a...
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
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...
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...
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.
Tip 1 : Mention 1 or 2 projects in your resume.
Tip 2 : Don't put false things in your resume.
posted on 15 Jun 2021
I applied via Referral and was interviewed in Mar 2022. There were 2 interview rounds.
posted on 9 Apr 2024
Jquery tags syntax uses angle brackets and CSS selectors.
Jquery tags are enclosed in angle brackets, like
Jquery selectors are used to target specific elements, like $('p') or $('.class')
posted on 30 May 2024
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
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.
posted on 29 Aug 2024
I applied via Referral and was interviewed in Jul 2024. There were 3 interview rounds.
posted on 8 Oct 2024
I applied via Naukri.com and was interviewed in Sep 2024. There was 1 interview round.
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...
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:...
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
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
based on 1 interview
Interview experience
Senior Software Engineer
111
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
83
salaries
| ₹0 L/yr - ₹0 L/yr |
Lead Software Engineer
55
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Software Engineer
31
salaries
| ₹0 L/yr - ₹0 L/yr |
Principal Software Engineer
25
salaries
| ₹0 L/yr - ₹0 L/yr |
Saba Software
PeopleStrong
UKG
Sumtotal Systems