i
ZIGRAM
Filter interviews by
Experienced product manager with a background in tech industry and a passion for innovation.
Over 5 years of product management experience
Strong background in technology industry
Proven track record of launching successful products
Passionate about driving innovation and customer satisfaction
I want to join Ziagram because of its innovative products and strong company culture.
Innovative products: I am excited about the opportunity to work on cutting-edge products that can make a real impact in the market.
Strong company culture: I have heard great things about Ziagram's inclusive and collaborative work environment, and I believe I would thrive in such a setting.
I applied via Referral and was interviewed in Nov 2018. There were 4 interview rounds.
I applied via Company Website and was interviewed before Dec 2023. There were 3 interview rounds.
Case study and call simulation
I applied via Naukri.com and was interviewed before May 2023. There were 2 interview rounds.
Query to extract unique values
Use the SELECT DISTINCT statement in SQL to retrieve unique values from a table
For example, SELECT DISTINCT column_name FROM table_name;
In Python, you can use the set() function to extract unique values from a list or array
I applied via LinkedIn and was interviewed in Jan 2022. There were 3 interview rounds.
I have 5 years of experience in digital banking and engagement banking as a product owner.
Developed and launched a mobile banking app with enhanced user experience
Implemented AI chatbot for customer support resulting in 30% reduction in call center traffic
Conducted market research and identified customer pain points to improve product offerings
Collaborated with cross-functional teams to prioritize and deliver product r...
Product Roadmap creation for Engagement Banking
Yes, I have 5 years of experience working in the banking domain.
Managed projects for implementing new banking software systems
Worked closely with stakeholders to ensure project goals aligned with business objectives
Led a team of developers to customize banking applications for client needs
Real time application refers to software that processes data as it is received, providing instant feedback or results.
Real time applications require low latency for immediate response
Examples include live chat applications, stock trading platforms, and online gaming
Data is processed and displayed instantly without delay
posted on 30 Jul 2023
I applied via Naukri.com and was interviewed before Jul 2022. There were 5 interview rounds.
To check if a directed graph is cyclic or not
Use Depth First Search (DFS) algorithm to traverse the graph
Maintain a visited set to keep track of visited nodes
Maintain a recursion stack to keep track of nodes in the current DFS traversal
If a node is visited and is already in the recursion stack, then the graph is cyclic
If DFS traversal completes without finding a cycle, then the graph is acyclic
Return a random byte from a stream of bytes with equal probability.
Create a variable to store the count of bytes read
Create a variable to store the current random byte
For each byte read, generate a random number between 0 and the count of bytes read
If the random number is 0, store the current byte as the random byte
Return the random byte
Check if a binary tree is a binary search tree or not.
Traverse the tree in-order and check if the values are in ascending order.
For each node, check if its value is greater than the maximum value of its left subtree and less than the minimum value of its right subtree.
Use recursion to check if all nodes in the tree satisfy the above condition.
Algorithm to find Nth-to-Last element in a singly linked list of unknown length
Traverse the list and maintain two pointers, one at the beginning and one at Nth node from beginning
Move both pointers simultaneously until the second pointer reaches the end of the list
The first pointer will be pointing to the Nth-to-Last element
If N=0, return the last element
Parse the list only once
Print all possible permutations of an array of integers
Use recursion to swap elements and generate permutations
Start with the first element and swap it with each subsequent element
Repeat the process for the remaining elements
Stop when all elements have been swapped with the first element
Print each permutation as it is generated
Design a stack that prints the minimum element pushed in O(1)
Use two stacks, one for storing elements and another for storing minimums
When pushing an element, compare it with the top of minimum stack and push the smaller one
When popping an element, pop from both stacks
To get the minimum element, just return the top of minimum stack
To find the starting point of a loop in a linked list, use Floyd's cycle-finding algorithm.
Use two pointers, one moving at twice the speed of the other.
When they meet, move one pointer to the head of the list and keep the other at the meeting point.
Move both pointers one step at a time until they meet again, which is the starting point of the loop.
To find a number in a matrix where all rows and columns are sorted non-decreasingly. Complexity of the solution.
Use binary search to find the number in each row and column
Start from the top-right corner or bottom-left corner to optimize search
Time complexity: O(m log n) or O(n log m) depending on the starting corner
posted on 24 Mar 2015
I applied via Company Website and was interviewed before May 2018. There were 3 interview rounds.
based on 1 interview
Interview experience
Research Analyst
179
salaries
| ₹1.7 L/yr - ₹4.4 L/yr |
Senior Analyst
160
salaries
| ₹2.8 L/yr - ₹7 L/yr |
Senior Research Analyst
75
salaries
| ₹2.3 L/yr - ₹5.5 L/yr |
Analyst
71
salaries
| ₹2 L/yr - ₹3.6 L/yr |
Associate
20
salaries
| ₹4.8 L/yr - ₹11 L/yr |
Aurigo
Prime Focus Technologies
Yalamanchili Software Exports
MapmyIndia