i
Hy-Vee
Filter interviews by
Rate your
company
🤫 100% anonymous
How was your last interview experience?
I applied via Instahyre and was interviewed in Jul 2023. There were 4 interview rounds.
Programming problems
They asked questions based on sql, python and dax in power bi along with ssrs basics
I applied via Instahyre and was interviewed in Jul 2023. There were 4 interview rounds.
Programming problems
Hy-Vee interview questions for popular designations
Top trending discussions
Factors affecting pricing of products on e-retail website
Cost of production
Competitor pricing
Demand and supply
Target audience
Marketing and advertising costs
Vertical scrolling is the best option for e-retail websites.
Vertical scrolling is more intuitive and easier to use for most users.
Horizontal scrolling can be confusing and frustrating for users.
Each product on a different page can lead to slower load times and more clicks for users.
Infinite scrolling can be a good option for some e-retail websites.
Consider the type of products being sold and the user experience when de
My happiest moment was when I got accepted into my dream university.
Received the acceptance letter in the mail
Celebrated with family and friends
Felt a sense of accomplishment and excitement for the future
I completed internships at two different companies, one focused on web development and the other on software testing.
Interned at XYZ Company as a web developer, worked on front-end development using React and back-end development using Node.js
Interned at ABC Company as a software tester, tested various software applications and reported bugs to the development team
My strengths include problem-solving, adaptability, and teamwork. My weaknesses include public speaking and time management.
Strengths: Problem-solving - I enjoy finding solutions to complex problems. Adaptability - I am able to quickly adjust to new situations. Teamwork - I work well in a team environment and value collaboration.
Weaknesses: Public speaking - I get nervous when speaking in front of large groups. Time ma...
I enjoy playing sports, reading books, and volunteering in my community.
Playing basketball and soccer with friends
Reading books on technology and self-improvement
Volunteering at local food banks and animal shelters
I believe gaining practical experience is more valuable than pursuing further education at this point in my career.
I have gained valuable experience through internships and projects
I am constantly learning and improving my skills through online courses and workshops
I may consider pursuing further education in the future if it aligns with my career goals
I was interviewed in Oct 2016.
I applied via Campus Placement
Boundary traversal of a tree is the process of visiting the nodes on the boundary of a tree in a specific order.
The boundary traversal can be done in three steps: left boundary, leaf nodes, and right boundary.
For the left boundary, start from the root and traverse down the left side of the tree until reaching a leaf node.
For the leaf nodes, perform an inorder traversal to visit all the leaf nodes of the tree.
For the ri...
Find the nearest greater value of a given value in a Binary Search Tree (BST).
Start from the root node and compare the given value with the current node's value.
If the given value is less than the current node's value, move to the left subtree.
If the given value is greater than the current node's value, move to the right subtree.
Keep track of the closest greater value encountered while traversing the tree.
Return the cl
Given an infinite staircase with a broken kth step, find the maximum height we can reach in n rounds of jumping i steps.
We can start by jumping the maximum number of steps in each round until we reach the broken step.
After reaching the broken step, we can discard the i steps that would land us on the broken step and jump the remaining steps.
We can continue this pattern until we reach the maximum height we can reach wit
Function to check if a string of parenthesis is balanced
Use a stack to keep track of opening parenthesis
If a closing parenthesis is encountered, pop from stack and check if it matches
If stack is empty and a closing parenthesis is encountered, return False
If all parenthesis are matched and stack is empty, return True
Count the occurrences of words in a paragraph.
Split the paragraph into words using whitespace as a delimiter.
Create a dictionary to store the count of each word.
Iterate through the words and increment the count in the dictionary.
Return the dictionary with the word counts.
Find common elements out of two sorted array
Use two pointers to traverse both arrays simultaneously
Compare elements at each pointer and move the pointer of the smaller element
If elements are equal, add to common elements list and move both pointers
Stop when either pointer reaches end of array
Convert a Binary Search Tree to a Doubly Linked List.
Create a DLL node class with left, right, and data fields.
Traverse the BST in-order and add each node to the DLL.
Adjust the left and right pointers of each node to create the DLL.
Return the head of the DLL.
The task is to fill the 'next' field of each node in a binary tree to point to the next node at the same level.
Use a level order traversal to process the tree nodes.
Maintain a queue to store the nodes at each level.
For each node, set its 'next' field to the next node in the queue.
If a node is the last node at its level, set its 'next' field to NULL.
To find anagrams of a given word in a dictionary, use a hash table to store sorted versions of each word as keys and their corresponding original words as values.
Create a hash table to store the anagrams
Iterate through each word in the dictionary
Sort the characters of the word and use it as a key in the hash table
If the key already exists, add the word to the list of values for that key
Print the list of values for the
Suggest a data structure for efficient search of a string in 10 files and print line number and file if string appears more than once.
Use a hash table to store the file name and line number of each occurrence of the string.
Iterate through each file and for each line, check if the string is present and update the hash table accordingly.
Print the hash table entries for the string.
Amazon is the right place for me because of its innovative culture, vast resources, and opportunities for growth.
Amazon's innovative culture aligns with my passion for pushing boundaries and finding creative solutions.
The company's vast resources provide the necessary tools and support to develop and deliver high-quality software.
Amazon offers numerous opportunities for growth and career advancement, allowing me to con...
based on 6 interviews
Interview experience
Anonymously discuss salaries, work culture, and many more
Get Ambitionbox App
Product Owner
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Principal Software Engineer
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer2
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Walmart
Target
Kroger
Costco Wholesale