Algorithms

You need to guess a word. You are provided with a list of Words with the number of character matches at the right position.

Example

input {{"MOXTE",3} , {"AXCDG",0},{"MOQRT",2},{"FOUSE",4},{"POWER",1}}

return "MOUSE"
Explanation:


MOXTE    MO##E    3 matches
AXCDG    #####    0 matches
MOQRT    MO###    2 matches
FOUSE    #OUSE    4 matches
POWER    #O###    1 match

Result:  MOUSE


I tried using brute force. Max heap is not working. Any leads?

1. What is the correct in-order traversal?
   1. U S T X C P Y R B A I G J F N H V T E D L
   2. U S T X C P Y R B A D E I G J F N H V T L
2. What is the correct post-order traversal?
   1. U T S X P R Y C B D I J G N V T H F E L A
   2. U T S X P R Y C B I J G N V T H F E D L A

Problem:
--------

Category1:
1. Movie1
2. Movie2
3. Movie3
...

Category2:
1. Movie1
2. Movie4
3. Movie5
...

Category3:
1. Movie4
2. Movie6
3. Movie7
...

I have database table object which is:

[Table("TreeViewDb")]
public class TreeViewDb
{
	[Key]
    [DatabaseGenerated(DatabaseGeneratedOption.Identity)]
	public int Id { get; set; }
	public int ParentId { get; set; }
	public string Name { get; set; }	
}

And I have a view model whcih is :

<pre>public class TreeView
{
	public TreeView()
	{
		Children = new List<TreeView>();
	}

	public int Id { get; set; }
	public int ParentId { get; set; }
	public string Name { get; set; }

	// children
	public List<TreeView> Children { get; set; }
}

public bool SaveOrUpdateTreeView(TreeView viewModel)
{
	// Level 1
	var parentModel = new TreeViewDb
	{
		Id = viewModel.Id,
		ParentId = viewModel.ParentId,
		Name = viewModel.Name
	};

	// Save or update object and return primary key
	var parentId = _dataRepository.SaveOrUpdateTreeView(parentModel);

	// Level 2
	foreach (var child in viewModel.Children)
	{
		var childModel = new TreeViewDb
		{
			Id = viewModel.Id,
			ParentId = parentId, // Parent Primary Key
			Name = viewModel.Name
		};

		// Save or update object and return primary key
		var childId = _dataRepository.SaveOrUpdateTreeView(childModel);

		// Level 3
		foreach (var grandChild in child.Children)
		{
			var grandChildModel = new TreeViewDb
			{
				Id = viewModel.Id,
				ParentId = childId, // Child Primary Key
				Name = viewModel.Name
			};

			_dataRepository.SaveOrUpdateTreeView(grandChildModel);
		}

		return true;
	}

	return true;
}

if (player1 > player2)
    player1 wins
else if (player2 > player1)
    player2 wins
else
    tie

Suppose your operations on arrays were constrained as follows:

- .get(i) accesses the element at index position 𝑖 in read-only fashion.

- .length() returns the length of the array.

- .flip(i) flips the array up to index position 𝑖. Thus, the {1,2,3,4}.flip(2) operation changes the array to {3,2,1,4}.

Only these three operations are available to you. Also assume that the three operations are in 𝑂(1).

Develop an algorithm that sorts a given array in 𝑂(𝑛 × 𝑙𝑜𝑔 𝑛).

Suppose you have an array of length 𝑖 + 1. You want to correctly sort the element at position 𝑖. The array is already sorted up to 𝑖 - 1. The correct position of the element at position 𝑖 is index position 𝑗. Find a sequence of flip operations that inserts the element in the correct location.



Problem: I have no idea how to begin

The job is to calculate the degree of discontent of passengers on a bus.
 Passengers get on the bus, all at the same point and say at which point they want to stop (that point is the mileage from the point where they get on the bus to where they want to disembark), but the bus can only make k stops, that is, it is a value  limited number of stops.  The discontent will be calculated as follows (x-y) * 2 where x is the place that each passenger chose to stay and y where the bus stopped. The K will be defined after calculating the discontent of each passenger