emptycup
BAN USER
- 0of 0 votes
AnswersGiven huge database of songs design search data structure and algorithm to search all songs with words starting with the letters entered and words matching the sequence of words entered.
- emptycup in India
Suppose the songs are:
1. Every night in my dreams
2. Listen to my heart
3. Show me the meaning
4. Night in London
5. Night changes
Entering "m" should list 1,2 and 3. "my" should list 1 and 2. "Night" should list 1,4 and 5. "Night in" should list 1 and 4.| Report Duplicate | Flag | PURGE
Flipkart SDE-3 Data Structures - 0of 0 votes
AnswersImplement a meeting organizer
- emptycup in India| Report Duplicate | Flag | PURGE
Flipkart SDE-3 System Design - 1of 1 vote
AnswersGiven a binary tree (not search tree), find the path which adds up to given sum.
- emptycup in India| Report Duplicate | Flag | PURGE
Amazon SDE-2 Algorithm - 0of 0 votes
AnswersGiven a array of numbers, find all the numbers which add up to given sum.
- emptycup in India| Report Duplicate | Flag | PURGE
Amazon SDE-2 Algorithm - 0of 0 votes
AnswersThere are buses taking various routes and each route has some stops. Given a matrix of stops and distances (distance between two stops for connected stops), find all cluster of stops of any size with all stops in a cluster fully connected and are at a distance not greater than D.
- emptycup in India
Assume that the routes are bi-directional.| Report Duplicate | Flag | PURGE
Amazon SDE-2 Algorithm Dynamic Programming
RepShastri Ji is well known hindi and tamil vashikaran specialist. He will give you effective and simple totke to control ...
Do DFS to get all the paths from node1 to node2. Build set of edges for each path. Now this is the famous set cover problem - find the minimum edges covering all paths and remove them.
- emptycup July 09, 2015This is classified DP problem