Filter interviews by
Optimizing problems with Disjoint Set Union involves efficient union and find operations to manage connected components.
1. Understand the problem: Identify if it can be represented as a set of elements with union and find operations.
2. Implement DSU: Use path compression in the find operation to flatten the structure, speeding up future queries.
3. Union by rank: Always attach the smaller tree under the root of the...
OOP concepts are foundational principles in programming that enable code reusability and organization through objects and classes.
Encapsulation: Bundling data and methods that operate on the data within one unit (e.g., a class).
Inheritance: Mechanism where a new class inherits properties and behavior from an existing class (e.g., a 'Dog' class inheriting from an 'Animal' class).
Polymorphism: Ability to present the...
Develop a seamless onboarding platform for riders, enhancing user experience and operational efficiency.
User Registration: Simplified sign-up process via email, phone number, or social media accounts.
Profile Setup: Allow users to input personal details, payment methods, and preferred ride options.
Onboarding Tutorial: Provide a quick tutorial or walkthrough to familiarize users with the app features.
Ride Booking Pr...
Gradient accumulation helps manage memory and improve training efficiency by accumulating gradients over multiple batches before updating weights.
Gradient accumulation allows for larger effective batch sizes without increasing memory usage.
Example: Instead of using a batch size of 64, accumulate gradients over 4 batches of size 16.
This technique is useful when GPU memory is limited, enabling training on larger mod...
Reverses groups of k nodes in a linked list
Iterate through the linked list in groups of k nodes
Reverse each group of k nodes using a helper function
Update the pointers to connect the reversed groups back together
Dynamic programming is a method for solving complex problems by breaking them down into simpler subproblems.
Dynamic programming is used in optimization problems, like the Knapsack problem.
It involves storing results of subproblems to avoid redundant calculations.
Example: Fibonacci sequence can be computed efficiently using dynamic programming.
Dynamic programming can be applied in various fields, including finance ...
Kadane's Algorithm finds the maximum sum of a contiguous subarray in an array of integers efficiently.
Initialize two variables: max_current and max_global. Set both to the first element of the array.
Iterate through the array starting from the second element.
For each element, update max_current as the maximum of the current element and the sum of max_current and the current element.
If max_current exceeds max_global...
Iterate through array to find second largest number
Iterate through the array and keep track of the largest and second largest numbers
Handle edge cases like duplicates or small array sizes
Return the second largest number found
Largest Common Subsequence DP problem involves finding the longest subsequence that is common to two given strings.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store the lengths of common subsequences of substrings.
Traverse the array to find the length of the largest common subsequence.
Example: Given strings 'ABCD' and 'ACD', the largest common subsequence is 'ACD'.
A large language model is a type of artificial intelligence model that is capable of understanding and generating human language at a large scale.
Large language models use deep learning techniques to process and generate text.
Examples include GPT-3 (Generative Pre-trained Transformer 3) and BERT (Bidirectional Encoder Representations from Transformers).
I applied via Campus Placement and was interviewed in Nov 2024. There were 4 interview rounds.
1 and half hour coding assessment
1 - Hard question (100M)
1 - Medium question (50M)
1 - easy question (20M)
Dynamic programming is a method for solving complex problems by breaking them down into simpler subproblems.
Dynamic programming is used in optimization problems, like the Knapsack problem.
It involves storing results of subproblems to avoid redundant calculations.
Example: Fibonacci sequence can be computed efficiently using dynamic programming.
Dynamic programming can be applied in various fields, including finance and l...
Kadane's Algorithm finds the maximum sum of a contiguous subarray in an array of integers efficiently.
Initialize two variables: max_current and max_global. Set both to the first element of the array.
Iterate through the array starting from the second element.
For each element, update max_current as the maximum of the current element and the sum of max_current and the current element.
If max_current exceeds max_global, upd...
Reverses groups of k nodes in a linked list
Iterate through the linked list in groups of k nodes
Reverse each group of k nodes using a helper function
Update the pointers to connect the reversed groups back together
I applied via Campus Placement and was interviewed in Sep 2024. There were 4 interview rounds.
Three questions regarding dynamic programming and arrays
Largest Common Subsequence DP problem involves finding the longest subsequence that is common to two given strings.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store the lengths of common subsequences of substrings.
Traverse the array to find the length of the largest common subsequence.
Example: Given strings 'ABCD' and 'ACD', the largest common subsequence is 'ACD'.
Check if a string contains any palindromes
Iterate through each string in the array
Reverse the string and compare it with the original string to check for palindrome
Return true if any palindrome is found, false otherwise
SQL is a traditional relational database management system, while NoSQL is a non-relational database system.
SQL is structured, uses tables with rows and columns, and follows ACID properties.
NoSQL is unstructured, uses collections of documents, key-value pairs, or graphs, and is horizontally scalable.
SQL is better for complex queries and transactions, while NoSQL is better for large amounts of data and flexible schemas.
I appeared for an interview in May 2025, where I was asked the following questions.
I appeared for an interview in Aug 2024.
It is impossible to accurately guestimate the number of trees worldwide due to varying factors such as deforestation, reforestation, and different types of forests.
Factors to consider include the types of forests (tropical, temperate, boreal), deforestation rates, reforestation efforts, and urban areas.
Estimates range from 3 trillion to 6 trillion trees globally, but these numbers are constantly changing.
Remote sensing...
Enhance Spotify's personalized playlists
Implement a feature to allow users to manually adjust the algorithm's recommendations
Introduce a 'collaborative playlist' option for users to create playlists with friends
Enhance the 'Discover Weekly' playlist by incorporating user feedback on song selections
3 question were asked in 90 min time
Precision is the ratio of correctly predicted positive observations to the total predicted positive observations.
Precision is calculated as TP / (TP + FP), where TP is true positives and FP is false positives.
It measures the accuracy of positive predictions made by the model.
A high precision indicates that the model is good at predicting positive cases without many false positives.
For example, in a binary classificatio...
A large language model is a type of artificial intelligence model that is capable of understanding and generating human language at a large scale.
Large language models use deep learning techniques to process and generate text.
Examples include GPT-3 (Generative Pre-trained Transformer 3) and BERT (Bidirectional Encoder Representations from Transformers).
3 questions, varying difficulty
I appeared for an interview in Mar 2025, where I was asked the following questions.
Red swift cars in Delhi are popular for their speed, style, and vibrant color, appealing to car enthusiasts and urban drivers alike.
Popularity: Red swift cars are favored in Delhi for their sporty look and compact size, making them ideal for city driving.
Performance: The Swift is known for its peppy engine and responsive handling, providing an enjoyable driving experience in urban traffic.
Fuel Efficiency: Swift cars ar...
Develop a seamless onboarding platform for riders, enhancing user experience and operational efficiency.
User Registration: Simplified sign-up process via email, phone number, or social media accounts.
Profile Setup: Allow users to input personal details, payment methods, and preferred ride options.
Onboarding Tutorial: Provide a quick tutorial or walkthrough to familiarize users with the app features.
Ride Booking Process...
I appeared for an interview in Mar 2025, where I was asked the following questions.
OOP concepts are foundational principles in programming that enable code reusability and organization through objects and classes.
Encapsulation: Bundling data and methods that operate on the data within one unit (e.g., a class).
Inheritance: Mechanism where a new class inherits properties and behavior from an existing class (e.g., a 'Dog' class inheriting from an 'Animal' class).
Polymorphism: Ability to present the same...
3 questions - 1 medium, 2 hard cp based
I want to join Sprinklr because of its innovative products and strong company culture.
I am impressed by Sprinklr's reputation in the industry for providing cutting-edge solutions for social media management.
I believe Sprinklr's emphasis on employee growth and development aligns with my career goals.
I am excited about the opportunity to work with a diverse and talented team at Sprinklr.
I faced a difficult situation when a project deadline was moved up unexpectedly.
Communicated with team members to assess the impact of the deadline change
Prioritized tasks and created a new timeline to meet the revised deadline
Worked extra hours and delegated tasks effectively to ensure project completion on time
Top trending discussions
The duration of SPRINKLR interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 79 interview experiences
Difficulty level
Duration
based on 359 reviews
Rating in categories
8-13 Yrs
Not Disclosed
Production Analyst
157
salaries
| ₹8.6 L/yr - ₹21 L/yr |
Product Manager
132
salaries
| ₹22.7 L/yr - ₹40 L/yr |
Senior Product Analyst
116
salaries
| ₹14.7 L/yr - ₹25 L/yr |
Associate Product Manager
97
salaries
| ₹17.6 L/yr - ₹32.6 L/yr |
Customer Success Manager
83
salaries
| ₹13.5 L/yr - ₹32.2 L/yr |
Thomson Reuters
Oracle Cerner
Chetu
R Systems International