i
Planview
Filter interviews by
I applied via LinkedIn and was interviewed in Jul 2024. There was 1 interview round.
Join two tables in SQL and fetch details with multiple conditions.
Use JOIN keyword to combine tables based on a common column
Use WHERE clause to specify conditions for filtering data
Use AND or OR operators to combine multiple conditions
Example: SELECT * FROM table1 JOIN table2 ON table1.id = table2.id WHERE condition1 AND condition2
My cadences as a CSM involved regular check-ins, proactive outreach, and personalized communication.
Scheduled regular check-in calls with clients to review progress and address any concerns
Sent proactive emails with helpful resources or tips to support client success
Personalized communication based on each client's specific needs and goals
Used a mix of phone calls, emails, and in-app messages to stay connected with cli
Planview interview questions for popular designations
I applied via Approached by Company and was interviewed before Mar 2023. There was 1 interview round.
Use a variable to keep track of the maximum element while iterating through the array.
Initialize a variable to store the maximum element as the first element of the array.
Iterate through the array and compare each element with the current maximum, updating the maximum if necessary.
Return the maximum element after the loop completes.
HashMap is implemented using an array of linked lists to handle collisions.
HashMap stores key-value pairs in an array of linked lists.
Hashing function is used to determine the index of the array where the key-value pair will be stored.
If two keys hash to the same index, a collision occurs and the key-value pairs are stored in the same linked list.
I applied via LinkedIn and was interviewed before Apr 2023. There was 1 interview round.
posted on 2 Nov 2021
I applied via Naukri.com and was interviewed in May 2021. There were 3 interview rounds.
Top trending discussions
I applied via Campus Placement and was interviewed before Nov 2020. There were 4 interview rounds.
I applied via Campus Placement and was interviewed before Nov 2020. There was 1 interview round.
Insertion sort and quicksort are sorting algorithms used to sort arrays of data.
Insertion sort: iterates through the array and inserts each element into its proper position.
Quicksort: selects a pivot element and partitions the array into two sub-arrays, one with elements less than the pivot and one with elements greater than the pivot.
Insertion sort is best for small arrays, while quicksort is best for large arrays.
Bot...
Merge two sorted linked lists using recursion
Create a recursive function that compares the first nodes of both lists
Set the smaller node as the head of the merged list and call the function again with the next node of the smaller list
Base case: if one list is empty, return the other list
Return the merged list
Given an integer, determine which byte is zero.
Convert the integer to a byte array using bitwise operations.
Iterate through the byte array and check for a zero value.
Return the index of the zero byte.
Consider endianness when converting to byte array.
To check endianness, create a 4-byte integer with a known value and check the byte order.
Create a 4-byte integer with a known value
Check the value of the first byte to determine endianness
If the first byte is the least significant, the machine is little endian
If the first byte is the most significant, the machine is big endian
Static objects can be used to print something before main() execution.
Static objects are initialized before main() execution
They can be used to print something before main()
Example: static int x = printf("Hello World!");
Output: Hello World! will be printed before main() execution
Static variables are allocated memory in the data segment of the program's memory space.
Static variables have a fixed memory location throughout the program's execution.
They are initialized to zero by default.
If initialized explicitly, they are stored in the data segment.
Static variables can be accessed by any function in the program.
Finding space and time complexity of a recursive function.
Space complexity is the amount of memory used by the function.
Time complexity is the amount of time taken by the function to execute.
Recursive functions have higher space complexity due to the call stack.
Time complexity can be calculated using Big O notation.
Examples of recursive functions include factorial and Fibonacci sequence.
Diamond hierarchy problem is a problem in object-oriented programming where a class inherits from multiple classes in a diamond-shaped hierarchy.
Occurs when a class inherits from two classes that share a common base class
Can lead to ambiguity in method calls and data members
Solved using virtual inheritance or by using interfaces
based on 9 interviews
Interview experience
based on 71 reviews
Rating in categories
Managed Services Consultant
20
salaries
| ₹7 L/yr - ₹17 L/yr |
Integration Developer
16
salaries
| ₹10.5 L/yr - ₹18 L/yr |
Senior Software Engineer
16
salaries
| ₹25 L/yr - ₹48.5 L/yr |
Implementation Consultant
11
salaries
| ₹20 L/yr - ₹27.3 L/yr |
Software Engineer
11
salaries
| ₹8 L/yr - ₹25 L/yr |
ServiceNow
Atlassian
Salesforce
Oracle