Geeky Codes | AI Engineering, Data Engineering & Machine Learning Tutorials
We define a magic square to be an n*n matrix of distinct positive integers from 1 to n^2 where the sum of any row, column, or diagonal of length n is always equal to the same number: the magic constant. You will be given a 3*3 matrix  of integers in the inclusive range [1,9]. We can convert any digit a to any other digit b in the range [1,9] at cost of [a,b]. Given s, convert it into … Read more
Two cats and a mouse are at various positions on a line. You will be given their starting positions. Your task is to determine which cat will reach the mouse first, assuming the mouse does not move and the cats travel at equal speed. If the cats arrive at the same time, the mouse will … Read more
When working with arrays, solving problems like finding two elements that sum up to a target or three elements with a specific sum is quite common. In this blog post, we’ll explore simple implementations in C for both the two-sum and three-sum problems using both iterative and recursive methods. Two Sum Problem Iterative Approach The … Read more
Step 1 : Download mongo-c-driver
Step 2 : Updated GCC and G++ compiler after version 5 .current version 7 in system .
Step 3 : Mongo-c-driver Version(1.15.x) version is same version and with mongo-cxx-driver (3.5.x)
Step 4 : Updated CMake 3.2 or later.
Step 5 : Install Mongo-cxx-driver