Problem description:

There is a ball in a maze with empty spaces and walls. The ball can go through empty spaces by rolling up, down, left or right, but it won’t stop rolling until hitting a wall. When the ball stops, it could choose the next direction.

Problem description:

There are N workers. The i-th worker has a quality[i] and a minimum wage expectation wage[i].

CSCE 670 :: Information Storage and Retrieval :: Texas A&M University :: Spring 2019

For this part, your goal is to put on your “search engine optimization” hat. Your job is to create a webpage that scores highest for the query: sajfd hfafbjhd — two terms, lower case, no quote. As of today (Jan 24, 2019), there are no hits for this query on either Google
or Bing. Based on our discussions of search engine ranking algorithms, you know that several factors may impact a page’s rank. Your goal is to use this knowledge to promote your own page to the top of the list.

Problem description:

In a row of trees, the i-th tree produces fruit with type tree[i].

Problem description:

Given the root of a binary tree with N nodes, each node in the tree has node.val coins, and there are N coins total.

Problem description:

A subarray A[i], A[i+1], …, A[j] of A is said to be turbulent if and only if:

Problem description:

Given an array of integers A sorted in non-decreasing order, return an array of the squares of each number, also in sorted non-decreasing order.

Problem description:

Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:

Definition:
Information Retrieval: Information retrieval (IR) is finding material (usually documents) of an unstructured nature (usually text) that satisfies an information need from within large collections (usually stored on computers).

Problem description:

A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below).