Filter interviews by
I was interviewed before May 2016.
I am a digital marketing enthusiast with a passion for creating engaging content and driving results.
Experienced in social media management and content creation
Proficient in SEO and SEM strategies
Skilled in data analysis and reporting
Strong communication and collaboration skills
Examples: Managed social media accounts for a local business, created successful email marketing campaigns for a non-profit organization
Yes, I am a part of the Marketing Society in college.
I am a member of the Marketing Society in college
I have participated in various events and workshops organized by the society
I have gained experience in event management, social media marketing, and content creation through the society
I have also worked on various marketing campaigns for the society's clients
Elon Musk is my role model.
His innovative ideas and determination to achieve them inspire me.
He has successfully founded and led multiple companies like SpaceX, Tesla, and PayPal.
His focus on sustainable energy and space exploration aligns with my interests.
He has faced numerous challenges and setbacks but continues to persevere.
His leadership style emphasizes on empowering his team and fostering a culture of innovatio
Top trending discussions
To identify whether a binary tree is a Binary Search Tree or not.
Check if the left subtree is a Binary Search Tree
Check if the right subtree is a Binary Search Tree
Check if the root node is greater than all the nodes in the left subtree
Check if the root node is less than all the nodes in the right subtree
Solution for inorder traversal in sorted order without using array
Implement a binary search tree and perform inorder traversal
Use a stack to simulate the recursive function call stack
Maintain a variable to keep track of the previously visited node
Compare the current node with the previously visited node to check if it is in sorted order
Convert a BST to a binary tree with each element replaced by sum of all greater elements.
Traverse the BST in reverse inorder and keep track of the sum of all greater elements.
Replace each node's value with the sum and update the sum.
Recursively perform the above steps on left and right subtrees.
Time complexity: O(n), Space complexity: O(h) where h is the height of the tree.
Find the 2nd highest salary from an employee table in SQL.
Use the SELECT statement to retrieve the salaries in descending order.
Use the LIMIT keyword to limit the result set to the second row.
Use a subquery to exclude the highest salary from the result set.
I am a software engineer with experience in developing web applications and a passion for problem-solving.
Experienced in developing web applications using languages such as Java, Python, and JavaScript
Proficient in using frameworks such as Spring, Django, and React
Strong problem-solving skills and ability to work in a team environment
Passionate about learning new technologies and keeping up with industry trends
Given an array, determine if it follows one of four patterns: increasing, decreasing, increase then decrease, or decrease then increase.
Iterate through the array and compare each element to the previous one.
If all elements are increasing, it follows the increasing pattern.
If all elements are decreasing, it follows the decreasing pattern.
If there is a point where the elements start decreasing after increasing, it follow...
Given an array of distinct positive numbers, find the maximum sum of non-adjacent elements.
Use dynamic programming to keep track of the maximum sum at each index
At each index, choose between including the current element or skipping it
The maximum sum at index i is the maximum of the sum including i-2 and i or the sum excluding i
Return the maximum sum at the last index
Use machine learning algorithms to analyze user behavior and preferences to suggest personalized coupons.
Collect user data such as purchase history, search history, and demographics
Use machine learning algorithms to analyze the data and identify patterns
Create personalized coupon suggestions based on the identified patterns
Regularly update and refine the algorithm to improve accuracy
Allow users to provide feedback on t
posted on 28 Oct 2022
I applied via Recruitment Consulltant and was interviewed before Oct 2021. There were 3 interview rounds.
Not applicable , this was final round
posted on 12 Feb 2024
I applied via Walk-in and was interviewed in Jan 2024. There were 4 interview rounds.
They given some topic on gd
They gave some gd questions
I applied via Approached by Company and was interviewed in Mar 2024. There was 1 interview round.
I applied via Referral and was interviewed in Dec 2022. There were 5 interview rounds.
It had the role related questions for example writing the voucher description for a bank credit card.
It consisted of general aptitude and analytical questions to be answered within one of opening the link with the access to the test.
Good level question. I have qualified for the next round
Basic to intermediate question, Cleared the test
I applied via LinkedIn and was interviewed in May 2024. There were 2 interview rounds.
Online coding test had two questions to be solved in 60 mins. Medium level questions to be expected.
Cashkaro.com
CouponDunia
GrabOn
CouponRani