Filter interviews by
I applied via LinkedIn and was interviewed in Apr 2024. There were 3 interview rounds.
Technical round- Hackerank Problem
I applied via Referral and was interviewed in Jun 2024. There were 2 interview rounds.
Two medium level question in 75 minutes
Return k most frequent strings from an array of strings
Use a hashmap to store the frequency of each string in the array
Sort the hashmap by frequency in descending order
Return the first k keys from the sorted hashmap
Java is a popular programming language used for developing various applications. Concurrency errors occur when multiple threads access shared resources simultaneously.
Java is a high-level, object-oriented programming language known for its platform independence.
Concurrency errors in Java can be solved using synchronization mechanisms like synchronized blocks, locks, and atomic variables.
Examples of solving concurrency ...
A null pointer exception occurs when a program tries to access a memory address that is null or invalid.
Occurs in programming languages like Java when trying to access an object or variable that is null
Can be caused by not properly initializing a variable before using it
Example: int[] arr = null; int x = arr.length; // This will throw a null pointer exception
Medium leet code data structures and algorithms
Apache Cassandra is a persistent in-memory key-value store optimized for write-heavy workloads using SSTables and compaction.
Apache Cassandra is a popular choice for write-heavy workloads due to its distributed architecture and support for SSTables.
SSTables (Sorted String Tables) are used to store data on disk in a sorted manner, allowing for efficient read and write operations.
Compaction in Apache Cassandra helps to m...
Salesforce interview questions for designations
I applied via Referral and was interviewed in Jan 2024. There were 2 interview rounds.
2 DSA questions were asked. they were of easy-medium difficulty.
I applied via Referral and was interviewed in May 2024. There was 1 interview round.
Developed a web-based project management tool for tracking tasks and deadlines.
Used AngularJS for front-end development
Implemented RESTful APIs for backend using Node.js
Utilized MongoDB for database storage
I applied via LinkedIn and was interviewed in Nov 2023. There were 6 interview rounds.
Round 1 was hackerrank test which had 2 questions.
Round 2 was onsite code pair round where in we have to solve 2 questions on dsa
This was similar to 2nd round
Top trending discussions
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
To determine if a point is inside a polygon, use the ray casting algorithm.
Create a line from the point to a point outside the polygon
Count the number of times the line intersects with the polygon edges
If the count is odd, the point is inside the polygon; otherwise, it is outside
The four storage classes in C are auto, register, static, and extern.
Auto: default storage class for all local variables
Register: used to define local variables that should be stored in a register instead of RAM
Static: used to define local variables that retain their value between function calls
Extern: used to declare a global variable that is defined in another file
i is stored in global data segment, j is stored in stack, k is stored in heap.
i is a global variable and is stored in the global data segment
j is a local variable and is stored in the stack
k is a pointer variable and is stored in the stack, while the memory it points to is allocated on the heap using malloc()
Use a hash table to store the words and check for existence in constant time.
Create a hash table with the words as keys and a boolean value as the value.
For each new word, check if it exists in the hash table. If it does, it has appeared before. If not, add it to the hash table.
Alternatively, use a set data structure to store only the unique words and check for existence in the set.
Return all root to leaf node paths in a binary tree with row, col and value.
Traverse the binary tree recursively and keep track of the current path.
When a leaf node is reached, add the path to the result array.
Include row, col and value of each node in the path.
Use an array of strings to store the paths.
To get max value from a stack in O(1), maintain a separate stack to keep track of maximum values.
Create a separate stack to keep track of maximum values
Push the maximum value onto the stack whenever a new maximum is encountered
Pop the maximum value stack whenever the top element of the main stack is popped
Return the top element of the maximum value stack to get the maximum value in O(1)
To get max element from a queue in O(1) time complexity
Maintain a separate variable to keep track of the maximum element in the queue
Update the maximum element variable whenever a new element is added or removed from the queue
Return the maximum element variable when getMax() function is called
Find the Next Greatest Element to the right for each element in an array of strings.
Iterate through the array from right to left
Use a stack to keep track of elements
Pop elements from stack until a greater element is found
If no greater element is found, assign -1
Return the result array
To remove unnecessary parenthesis from an expression, we need to apply a set of rules to identify and eliminate them.
Identify and remove parenthesis around single variables or constants
Identify and remove parenthesis around expressions with only one operator
Identify and remove parenthesis around expressions with operators of equal precedence
Identify and remove parenthesis around expressions with operators of different ...
Find the maximum product of three integers in an array.
Sort the array in descending order.
Check the product of the first three numbers and the product of the first and last two numbers.
Return the maximum of the two products.
Find length of longest consecutive sub array forming an AP from given array of integers.
Sort the array in ascending order
Iterate through the array and find the longest consecutive sub array forming an AP
Use a variable to keep track of the length of the current consecutive sub array forming an AP
Use another variable to keep track of the length of the longest consecutive sub array forming an AP seen so far
based on 9 interviews
1 Interview rounds
based on 10 reviews
Rating in categories
Technical Support Engineer
904
salaries
| ₹12 L/yr - ₹25 L/yr |
Technical Consultant
344
salaries
| ₹13.8 L/yr - ₹32 L/yr |
Member Technical Staff
282
salaries
| ₹18.8 L/yr - ₹60 L/yr |
Senior Member of Technical Staff
257
salaries
| ₹30 L/yr - ₹98 L/yr |
Senior Technical Consultant
247
salaries
| ₹18 L/yr - ₹45.1 L/yr |
SAP
Zoho
Oracle
Adobe