HackMan | Let hackman | Generator Utils library

I want to find the total room cost and total stay cost (room and expenses), and display the ones that are above $50 for total cost.

I wrote this query:

I have a similar scenario to what's below. Is there a way to join the items audit table to the users table? I would like the user Id of the user that last audited the items.

Users table:

I am learning how to parse through different files (xml, json, csv) and grabbing specific values in Python. However, I do not know how to go about writing code to find things such as which movie summary has the most characters or the total number of movies. I was wondering if somebody could please point me in the right direction or if there is a video that helps with grabbing info from a json file.

Here's the json file:

Create a function that takes an array of people objects and returns the first found astronaut object from the array.

This is the code that I have created;

I have generated pyspark.sql.dataframe.DataFrame with columns names cast and score.

However, I want to keep the only names in cast column, not the ids associated with them, alongside _score column.

e.g Liam Neeson, 'Dan Stevens, Marina Squerciati, Scott Frank

The structure of datatype in column cast looks like this

Let's say we have 4 nodes:

{id:1, name:"one"} {id:2, name:"two"} {id:3, name:"three"} {id:4, name:"four"}

Suppose node 1 is linked to node 2, node 2 to 3, 3 to 4 so the result would be something like:

(1)-->(2)-->(3)-->(4)

How would I be able to get the shortest path between multiple given nodes in any given order? A few examples:

findShortestPath(2,4,3) should result in: (2)-->(3)-->(4)

findShortestPath(3,1) should result in: (1)-->(2)-->(3)

findShortestPath(4,1) should result in: (1)-->(2)-->(3)-->(4)

findShortestPath(3,2) should result in: (2)-->(3)

I have tried something like this, but I feel like I'm going the wrong way and it's not the most performant solution. Note that my query gets constructed programmatically since it can contain any number and kind of nodes.

If the input would be: (2),(3),(1)

That would result in a double for loop constructing something like this:

match p=allShortestPaths((p2)-[*]-(p3)),allShortestPaths((p2)-[*]-(p1)),allShortestPaths((p3)-[*]-(p1)) where p1.name="Keanu Reeves" and p2.name="Gene Hackman" and p3.name="Clint Eastwood" return p;

My problem is that I can't provide multiple nodes to the allShortestPaths() function. Only 2 nodes with 1 relation is allowed.