GreedyGame Software Engineer Interview Questions and Answers

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...read more

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...read more

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

Algorithms for manipulating arrays and strings in coding

• Use sorting algorithms like quicksort and mergesort for arrays

• Use string manipulation functions like substring and replace for strings

• Use dynamic programming for optimizing solutions to array and string problems

Designing a large scale Ad Server

• Use distributed systems for scalability

• Implement caching for faster ad delivery

• Ensure high availability and fault tolerance

• Use real-time bidding for efficient ad placement

• Implement fraud detection mechanisms

• Ensure compliance with privacy regulations

Maximum sub sequence sum in an array

• Use Kadane's algorithm

• Initialize max_so_far and max_ending_here to 0

• Iterate through the array and update max_ending_here and max_so_far

• Return max_so_far

Endianness refers to the byte order of a system. It determines how multi-byte data types are stored in memory.

• Little-endian systems store the least significant byte first, while big-endian systems store the most significant byte first.

• Endianness can affect the way data is transmitted between systems.

• To determine the endianness of a system, you can use the byte order mark (BOM) or write a test program that checks the by...read more

Sort an array of 0's and 1's only.

• Use two pointers, one at the beginning and one at the end of the array.

• Swap 0's from the beginning with 1's from the end until the pointers meet.

• Alternatively, use a counting sort algorithm to count the number of 0's and 1's and then reconstruct the array.

Heaps are data structures used to efficiently find the maximum or minimum element in a collection.

• Max heap: parent nodes are always greater than or equal to child nodes

• Min heap: parent nodes are always smaller than or equal to child nodes

• Heaps are commonly used in priority queues and sorting algorithms

• Heap operations include insert, delete, and extract max/min

• Example: An array [3, 8, 2, 5, 1, 4, 6] can be represented a

Find 3 numbers in an array where a+b=c.

• Loop through the array and check for all possible combinations of a and b.

• Use a hash table to store the values of a and b, and check if c is present in the hash table.

• Sort the array and use two pointers to find a and b, and then check if their sum equals c.

I am an avid traveler and have visited over 20 countries

• I love experiencing new cultures and trying new foods

• I have backpacked through Europe and Asia

• I have volunteered in orphanages in Cambodia and Nepal

Mobile advertising platform

• Adtech

• Mobile marketing

• App monetization