Categorize similar transactions

See also questions close to this topic

• suggestions on fulltext search or already existing search algorithms

  Can someone suggest how to solve the below seach problem easily, I mean is there any algorithm, or full text search will be suffice for this?

  There is below classification of items data,

  ItemCategory        ItemCluster     ItemSubCluster      SubCluster  Items
  Vegetable       Root vegetables     Root            WithOutSkin potato, sweet potato, yam
  Vegetable       Root vegetables     Root            WithSkin    onion, garlic, shallot
  Vegetable       Greens          Leafy green     Leaf        lettuce, spinach, silverbeet
  Vegetable       Greens          Cruciferous         Flower      cabbage, cauliflower, Brussels sprouts, broccoli
  Vegetable       Greens          Edible plant stem   Stem        celery, asparagus
  

  The inputs will be some thing like,

  sweet potato, yam Yam, Potato garlik, onion lettuce, spinach, silverbeet lettuce, silverbeet lettuce, silverbeet, spinach

  From the input, I want to get the mapping of the input items those belongs to which ItemCategory, ItemCluster, ItemSubCluster, SubCluster.

  Any help will be much appreciated.
• create string r using string p and q, C++, Data Structures, Strings

  In this question we have given 3 strings and we nee dto count possible number of ways to create string r using string p and q

  
• Writing multithreaded code to generate incremental index

  I want to write a code in following scenario : we want to design an invoice generator.this invoice generator also generates an incremental invoice no .Also note that for some reasons we dont use something like sql Auto Increment here and we want to use C# (I wrote the increment logic). since several users can send requests at a time it means that we dont have to give the same invoice no to them (I used lock for it and I wrote it).

  Now i have written increment logic. and i take care of multiple users requests with lock . and I wrote CRUD for mongodb database.

  My problem is that my increent logic is naive. each time i find maximum and i increment by one which is not scalable. and another problem is that when we delete a record we don't want the invoice no to be repeated and since we find max if the deleted record had the max value then the invoice no would be duplicate and this is something we don't want to have.

  I really don't know how to handle the problem. specially in case of deletion should i store max values in a file or should i change increment logic completely?

  i appreciate any help
• Convert 2D meshgrid into a 3D array in Python

  I have coordinates (lat, lon) in a meshgrid, and data asociated with each "point". I want to export into a .csv and have each point asociated with the data i want to analyze. So far, my code looks like this.

  xx1,yy1=np.meshgrid(xx,yy)
  row_format = np.stack([z.ravel() for z in (xx1, yy1, data['Hs'])], axis=1)
  print(row_format)
  pd.DataFrame(row_format).to_csv('sample.csv')
  

  The data is in a dataframe that has a certain order. But the output is as follows:

  x	y	Hs
  265	19	0
  266	19	1
  267	19	2

  And it should be as follows, in order to make sense with the data order:

  x	y	Hs
  265	19	0
  265	18	1
  265	17	2

  I only need to make the "x" column to be the one with the "still" value while the "y" column goes through its values ("x" will change value once every "y" value has been written). Anyone know how to change that order? Or another way to get my desired output?
• Range Not Found, Google Apps Script for Google Sheets

  I'm trying to build a custom range for this sort function in an Apps Script for Google Sheets but I keep getting the error: "Exception: Range not found; sortProductionLog @ macros.gs:15"

  I'm sure this is something basic but I have searched far and wide and can't seem to find it. Can anyone shed some light?

  Thank you, Ryan

  SORT_ORDER = [
  {column: 118, ascending: true},  // 3 = column number, sorting by descending order
  {column: 119, ascending: true}, // 1 = column number, sort by ascending order 
  {column: 117, ascending: true},
  {column: 25, ascending: true}
  ];
  
  function sortProductionLog(){
    var ss = SpreadsheetApp.getActiveSpreadsheet();
    var sheet = ss.getSheetByName(SHEET_NAME);
    var LastRow_WithValue = sheet.getLastRow();
    var LastColumn_WithValue = sheet.getLastColumn();
    var buildRange = "4,1," + (LastRow_WithValue - 4) + "," + (LastColumn_WithValue - 1);
    var range = sheet.getRange(buildRange);
    ss.toast(buildRange);
    range.sort
  }
  
• Which is the best way to represent my data

  I have a following data structure:

  Page0
      Key0
          Text
          Color
          Name
      Key1
          Text
          Color
          Name
  Page1    
      Key0
          Text
          Color
          Name
      Key1
          Text
          Color
          Name
  

  Which is the best data structure to use ?
• looping through an array of objects that contains three key, value pairs

  I have these objects, which could be in an array, like in the example or a database:

  [  
    { "payer": "DANNON", "points": 1000, "timestamp": "2020-11-02T14:00:00Z" }
    { "payer": "UNILEVER", "points": 200, "timestamp": "2020-10-31T11:00:00Z" } 
    { "payer": "DANNON", "points": -200, "timestamp": "2020-10-31T15:00:00Z" } 
    { "payer": "MILLER COORS", "points": 10000, "timestamp": "2020-11-01T14:00:00Z" } 
    { "payer": "DANNON", "points": 300, "timestamp": "2020-10-31T10:00:00Z" }
  ]
  

  I want to subtract a total of { "points": 5000 } as an example from the points values of these objects starting with the oldest points based on timestamp, keep in mind no payer's points to go negative. then I want to return how much each payer's points were used. The expected result looks like this:

  [
    { "payer": "DANNON", "points": -100 },
    { "payer": "UNILEVER", "points": -200 },
    { "payer": "MILLER COORS", "points": -4,700 }
  ]
  

  My initial solution was:

  1. To sort the array based on the oldest timestamp
  2. Create a new object to store the number of points used from each payer
  3. Looping through the sorted array and subtracting the points from each payer and storing the number of points used in that new object.
  4. push all new objects to an array and return it. This solution made sense to me but I couldn't implement it, I kept on having unexpected results until my brain froze and I can't think anymore.

  This is an apprenticeship interview question. I thought it was easy at the beginning, but then after spending hours without solving it, I'm thinking am I an imposter? or is this question a tricky one?

  Thank you for sharing your knowledge and experience and helping me out. I appreciate it!
• Can someone explain why this code is able to get the solution

  So I was practicing questions on Leetcode and came across House Robber, but apparently I had already solved it. When I looked at the code I couldn't for the life of me figure out why it worked. Does anyone know why this works? Here is the question description:

  You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security systems connected and it will automatically contact the police if two adjacent houses were broken into on the same night.

  Given an integer array nums representing the amount of money of each house, return the maximum amount of money you can rob tonight without alerting the police.

      if len(nums) <= 2:
          return max(nums)
    
      sum1 = nums[0]
      sum2 = max(nums[0],nums[1])
      
      for i in range(2,len(nums)):
          sum1, sum2 = sum2, max(sum2, sum1 + nums[i])
      
      return sum2
  
• Longest substring in which the number of occurrences of each letter is equal

  You are given a string S consisting of N lowercase letters of the English alphabet. Find the length of the longest substring of S in which the number of occurrences of each letter is equal.

  For example, given S = "ababbcbc", substrings in which every letter occurs the same number of times are: "a", "b", "c", "ab", "ba", "bb", "bc", "cb", "abab" and "bcbc". The longest among them are "abab" and "bcbc" and their length equals 4.

  Write a function that, given the string S of length N, returns the length of the longest substring in which the number of occurrences of each letter is equal.

  Examples:

  1. Given S = "ababbcbc", the function should return 4, as explained above.
  2. Given S = "aabcde", the function should return 5. The longest substring is "abcde", in which all letters occur once.
  3. Given S = "aaaa", the function should return 4. The longest substring is "aaaa", in which all letters occur four times.
  4. Given S = "daababbd", the function should return 6. The longest substring is "aababb", in which all letters occur three times. Assume that:

  • N is an integer within the range [1..80];
  • string S consists only of lowercase letters (a-z).
• I am struggling to see what is wrong with my quicksort implementation

  I am struggling to see what is wrong with this quicksort implementation...

  /**
   * @param {number[]} nums
   * @return {number[]}
   */
  var sortArray = function(nums) {
      return quicksortWrapper(nums);
  };
  
  let quicksortWrapper = function(nums) {
      quicksort(nums, 0, nums.length - 1);
      return nums;
  }
  
  let quicksort = function(arr, lp, rp) {
      if (lp < rp) {
          let pivot = partition(arr, lp, rp);
          quicksort(arr, lp, pivot - 1);
          quicksort(arr, pivot + 1, rp);
      }
  }
  
  let partition = function(arr, lp, rp) {
      let pivot = rp;
      for (let i = lp; i < rp; i++) {
          if (arr[i] < arr[pivot]) {
              swap(arr, lp, i);
              i++;
              lp++;
          } else {
              i++;
          }
      }
      swap(arr, lp, pivot);
      return lp;
  }
  
  let swap = function(arr, l, r) {
      let temp = arr[l];
      arr[l] = arr[r];
      arr[r] = temp;
  }
  

  With an input of [9,12,2,0], the code outputs [0,9,2,12], but should output [0,2,9,12]. I have figured out that the first faulty iteration is the call to quicksort([0,12,2,9], 1, 3).
• How does Hoare partitioning work in QuickSort?

  Here is the pseudocode straight from the book (CORMEN):

  Partition(A,p,r)
          x=A[p]
          i=p-1
          j=r+1 
          while(TRUE)
              repeat
                  j=j-1
              until A[j]<=x
              repeat
                  i=i+1
              until A[i]>=x
              if i<j
                  SWAP A[i] <=> A[j]
              else return j
  

  Here is code in C++:

  #include<bits/stdc++.h>
  using namespace std;
  
  
  int partition(int a[], int low, int high)
  {
      int pivot = a[low];
      int i = low - 1;
      int j = high + 1;
      while (1)
      {
          do {
              i++;
          } while (a[i] < pivot);
  
          do {
              j--;
          } while (a[j] > pivot);
  
          if (i >= j) {
              cout<<j<<endl;
              return j;
  
          }
  
          swap(a[i], a[j]);
      }
  }
  
  
  /* The main function that implements QuickSort
  arr[] --> Array to be sorted,
  low --> Starting index,
  high --> Ending index */
  void quickSort(int arr[], int low, int high)
  {
      if (low < high)
      {
          /* pi is partitioning index, arr[p] is now
          at right place*/
          int pi = partition(arr, low, high);
  
          // Separately sort elements before
          // partition and after partition
          quickSort(arr, low, pi - 1);
          quickSort(arr, pi + 1, high);
      }
  }
  
  /* Function to print an array */
  void printArray(int arr[], int size)
  {
      int i;
      for (i=0; i < size; i++)
          printf("%d ", arr[i]);
      printf("\n");
  }
  
  // Driver program to test above functions
  int main()
  {
      int arr[] = {7,3,2,6,4,1,3,5};
      int n = sizeof(arr)/sizeof(arr[0]);
      cout<<"partition:\n";
      partition(arr,0,7);
      printArray(arr, n);
  
      quickSort(arr, 0, n-1);
      printf("Sorted array: \n");
      printArray(arr, n);
      return 0;
  }
  

  If I use this array in input:

  [5,3,2,6,4,1,3,7]
  

  everything works logically well because the array returned by the partitioning will be:

  [3,3,2,1,4,6,5,7] 
  

  Termination i=5 and j=4 so my pivot is 4. And all elements to the left of 4 are minor and all to the right are major

  Now if I use this array in input:

  [7,3,2,6,4,1,3,5]
  

  I will have this situation at the end of the partition

  [5,3,2,6,4,1,3,7]
  

  which will return to me as pivot j = 6 that is 3. Now the elements on the left of 3 are not all minor and on the right are major. But how is it possible that this works? Shouldn't I have the elements to the left of the pivot minor and to the right major?
• Quicksort in Python on big input; How do I fix error code: Process finished with exit code -1073741571 (0xC00000FD)?

  I wrote a recursive quicksort algorithm in Python to sort a list of 10,000 ints. I am testing a worst case (pivot is always the low index, and the list is already sorted, so one of the recursive calls to quicksort is always empty, and the other always decreases by 1). I know that means I have to increase the recursion limit with

  sys.setrecursionlimit(10000)

  Now I am getting the error code

  Process finished with exit code -1073741571 (0xC00000FD)

  I read elsewhere that I should use

  threading.stack_size()

  But, I have no idea how to use this function. I tried passing in different values, and I will either get that the size is not valid, or the same error code. Can somebody please help me with this?