Fyle Senior Member of Technical Staff Interview Questions and Answers

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

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.

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

To find the maximum water pond formed between buildings.

• Identify the lowest point between the buildings.

• Calculate the area of the pond using the distance between the buildings and the depth of the pond.

• Consider any obstacles or uneven ground that may affect the pond's shape.

• Use a surveying tool or satellite imagery to get accurate measurements.

• Take into account any drainage systems or natural water flow that may affect

Design a dictionary using trie with insert, update and delete operations.

• Implement a Trie data structure with nodes containing a character and a boolean flag to indicate end of word

• For insert operation, traverse the trie and add nodes for each character in the word

• For update operation, delete the existing word and insert the updated word

• For delete operation, mark the end of word flag as false and delete the node if it ...read more

The program capitalizes the first letter of each reversed word in a sentence.

• Split the sentence into an array of words using space as a delimiter.

• Reverse each word in the array and capitalize the first letter.

• Join the modified words back into a sentence.

Implementing a shuffle function for a playlist of songs

• Create a new empty playlist

• Randomly select a song from the original playlist and add it to the new playlist

• Remove the selected song from the original playlist

• Repeat until all songs have been added to the new playlist

• Return the new shuffled playlist

Memory leak is a situation where a program fails to release memory it no longer needs.

• Memory leaks can cause a program to consume more and more memory over time, eventually leading to crashes or other issues.

• Memory leaks can be caused by programming errors such as not freeing memory after it is no longer needed.

• Tools like valgrind can be used to detect memory leaks in C and C++ programs.

• Examples of memory leaks include...read more

Arrays have fixed size and can lead to memory wastage and performance issues.

• Arrays have a fixed size and cannot be resized dynamically.

• Inserting or deleting elements in an array can be time-consuming.

• Arrays can lead to memory wastage if they are not fully utilized.

• Arrays can cause performance issues if they are too large and need to be traversed frequently.

• Arrays can also be prone to buffer overflow attacks.

• Example: A...read more

Function to hide text on mouse click in JavaScript

• Create a function that takes an element as input

• Add an event listener to the element for a mouse click

• Toggle the element's display property between 'none' and its original value

Find two elements in an unsorted array whose sum is equal to a given number x.

• Use a hash table to store the difference between x and each element in the array.

• Iterate through the array and check if the current element is in the hash table.

• Return the pair of elements that add up to x.

BST stands for Binary Search Tree, a data structure used for efficient searching and sorting operations.

• BST is a tree-like data structure where each node has at most two children.

• The left child of a node contains a value less than the parent node, while the right child contains a value greater than the parent node.

• BST allows for efficient searching and sorting operations with a time complexity of O(log n).

• Examples of a...read more

Number of possible BSTs with 2 and 3 nodes.

• For 2 nodes, only 2 BSTs are possible.

• For 3 nodes, 5 BSTs are possible.

• Number of BSTs can be calculated using Catalan numbers formula.

• Catalan(2) = 2, Catalan(3) = 5.

Answering the question about possible trees with two and three nodes.

• For two nodes, there is only one possible tree.

• For three nodes, there are three possible trees.

• The formula for calculating the number of possible trees with n nodes is (2n-3)!!.

• The double exclamation mark represents the double factorial function.

• The double factorial function is defined as n!! = n(n-2)(n-4)...(1 or 2).

B+ trees are balanced trees used for indexing and searching large amounts of data.

• B+ trees are similar to binary search trees but have multiple keys per node.

• They are commonly used in databases and file systems.

• B+ trees have a high fanout, reducing the number of disk accesses required for searching.

• They are also self-balancing, ensuring efficient performance even with large amounts of data.

• Example: In a database, a B+ ...read more

Yes, I have a few questions.

• Can you tell me more about the team I'll be working with?

• What is the company culture like?

• What are the biggest challenges the team is currently facing?

• Can you walk me through the development process for a typical project?

• What opportunities are there for professional growth and development?

I prefer hash tables for their constant time lookup and insertion.

• Hash tables are efficient for storing and retrieving data.

• They have constant time complexity for both insertion and lookup.

• They can be implemented using arrays or linked lists.

• Examples include Python's dictionary and Java's HashMap.

Yes, we can implement a stack using two queues.

• Push operation: Enqueue the element to the first queue.

• Pop operation: Dequeue all elements from the first queue and enqueue them to the second queue until the last element. Dequeue and return the last element. Swap the names of the queues.

• Top operation: Same as pop operation but don't dequeue the last element.

• Example: Push 1, 2, 3. Queue 1: 1 2 3. Queue 2: empty. Pop opera...read more

Find minimum no of platforms required to avoid collision between trains based on their arrival and departure times.

• Sort both arrays in ascending order

• Initialize platform count and max count to 1

• Loop through both arrays and compare arrival and departure times

• If arrival time is less than or equal to departure time, increment platform count

• Else, decrement platform count

• Update max count if platform count is greater than ma

JVM stands for Java Virtual Machine. It is an abstract machine that provides a runtime environment for Java programs.

• JVM is responsible for interpreting the compiled Java code and executing it.

• It provides platform independence by converting bytecode into machine-specific code.

• JVM has various components like class loader, bytecode verifier, and execution engine.

• Compiler converts source code into bytecode, while JVM exec...read more

I am a software engineer with experience in developing web applications and a passion for learning new technologies.

• Experienced in developing web applications using technologies such as Java, Spring, and Angular

• Passionate about learning new technologies and keeping up with industry trends

• Strong problem-solving skills and ability to work in a team environment

• Completed a Bachelor's degree in Computer Science from XYZ Uni

PayTM is an Indian e-commerce payment system and digital wallet company.

• PayTM was founded in 2010 by Vijay Shekhar Sharma.

• It started as a mobile recharge and bill payment platform.

• PayTM has expanded to offer services like online shopping, movie ticket booking, and travel bookings.

• It also offers a digital wallet that can be used to pay for various services and products.

• PayTM has over 350 million registered users and is ...read more

I would like to add a feature for splitting bills among friends.

• The feature would allow users to split bills for movies, dinners, etc.

• Users can select friends from their contact list and split the bill equally or unequally.

• The app would send a notification to the selected friends to pay their share.

• The feature would make it easier for users to split expenses and avoid awkward conversations.

• It would also encourage more

My favourite app is Spotify. I would like to see improvements in the algorithm for personalized playlists.

• Improved algorithm for personalized playlists

• Better integration with social media platforms

• Option to create collaborative playlists with friends

My favourite subject is Computer Science.

• I enjoy programming and problem-solving.

• I find algorithms and data structures fascinating.

• I am interested in artificial intelligence and machine learning.

• I like learning about new technologies and keeping up with industry trends.

I choose NIT Hamirpur because of its excellent academic reputation and beautiful campus.

• NIT Hamirpur has a strong focus on academics and research, which aligns with my career goals.

• The campus is located in a serene and picturesque location, which provides a conducive environment for learning.

• The faculty members are highly experienced and knowledgeable, and are always willing to help students.

• The college has state-of-th...read more