word-search | Solves word search puzzles | Game Engine library

I am trying to implement a word search game for my project. I have created the word search letterbox using the grid and label (using this blog). Each letterbox has some words and that words are listed under the letterbox. I need to select the word hidden in the letterbox by dragging the labels. When start dragging the background color changed to orange. If the dragged word is in the words list, change the background color to green. Also, I need to capture the total, right and wrong attempts.

Please watch this video for getting a clear idea. I have also added a sample project here for the reference. I need to do the below things:

1. Dragging event for labels inside the grid.

2. Change the background color to orange(when starts dragging) and green(when the word is in the list).

3. A tickmark for found words.

4. Capture the total attempts, wrong attempts, and correct attempts.

Question link : https://leetcode.com/problems/word-search/

Given a 2D board and a word, find if the word exists in the grid.

The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically neighbouring. The same letter cell may not be used more than once.

We are not supposed to use one character twice.

Example :

I'm quite new to Azure Cognitive Search, and have succeded to configure my index in order to have autocompletion (using partial search thanks to this article).

But now I have another use case where I have many files stored in an Azure Blob Container with metadata:

One of the metadata field (of each file) is called partnumbers and its value is a string of products SKU separated with a comma (like "123456,78901,102938,09876"). I've built my index in order to store this info as a Edm.String, as you can see below:

I've been trying to separate all numbers in a text file from the words, then run them through a formula in excel and batch replace them using a method similar to this in Notepad++.

In my situation, this doesn't work, as recurring numbers occur throughout the text and as such the search and replace gets stuck in an infinite loop no matter what I try to do. Especially when there are decimals AND integers involved, as Notepad++ cannot logically distinguish between 1.14, 1 and 14, so it gets messy.

Is there any way to do this directly in Notepad++ or somewhere online? Or, alternatively, is there a way to extract numbers from text, maintaining their space within the text, being able to edit all the values and then plug them back into their original positions in the document?

Edit:

I want to turn:

Into:

Where integers remain integers, getting rounded to the nearest whole number if necessary (i.e. 1 remains 1), while decimals get altered just as Toto's python code does (i.e. 1.0 becomes 0.5).

I am writing a function to solve the word search problem. However, I run into a predicament of how to correctly get return value from my dfs recursive function. Here is the problem: if I use the keyword return in the last line of the code, it prematurely ends for direction in [[0,1],[0,-1],[1,0],[-1,0]] loop once the return is hit. However, if I remove the return in the last line, the recursive function will work fines, but it will never return True from if len(word)==0:print("TRUE") return True statement even when the statement is met. I basically understand that once the program hits return it will ignore all codes after it. Could you please explain how to get out of this trap?

I am solving Word Search question on LeetCode.com:

Given a 2D board and a word, find if the word exists in the grid.

The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically neighboring. The same letter cell may not be used more than once.

The solution which I wrote with online help is as follows:

I have a paragraphObjects of Word's paragraph objects. I have keywordRanges of indexes of some paragraphs and keywords. I have another array of keywords that I want to search and highlight in the document.

The issue is - the keyword search is linear. I have to load and sync the search result of each keyword. So if one keyword search takes ~300 ms, 15 search would take ~4500 seconds. I want to execute all keyword-search load-sync operations in parallel, so I get all the results in ~300 ms, independent of the size of the keywords array.

The code sample is below:

Java Code for one keyword-search

I'm comparing Azure Search and ElasticSearch for features and performance.
I'm looking to see if I can have multiple analyzers per field.
In ElasticSearch I can do this