A hint is sufficient 😅 I want to finish the thing on my own

n <= 9. So we expect at least exponential complexity. Brute force (factorial complexity (n * n!)) is good enough. You can try dynamic programming.

I have been told that the ideal time complexity is O(n^2 * 2^n) and that's what I'm aiming for Although brute force works well, I'm looking to optimize it

Yeah. Try dynamic programming.

Anything in particular I should look for?

Anything in particular I should look for?

You can also see https://www.geeksforgeeks.org/bitmasking-and-dynamic-programming-set-1-count-ways-to-assign-unique-cap-to-every-person/

https://gist.github.com/4a0189d3ce69026a630e5f9807d6c8da would this be correct for a copy/move constructor dealing with memory allocation?

BTW this problem is in a way a modification of the Travelling Salesman Problem 😃

if (s.contains(val) && val == (int) s.toArray()[s.size() - 1])

Why is ">c99 -Wall..." returning "invalid argument `all' to -W" in macos terminal ?

What are the pre requisite for this to work properly

The array is passed to a function

Can you provide the code?

vector<Long Long> findMissing (Long Long A[], Long Long B[],int N, int M) unordered_map<int, int> sandy; vector<Long Long> ans; for (auto x:A) { sandy[x]++; } for (auto y:B) { if(!sandy[y]) { ans.push_back(y); } } return ans; } };

Ok, in this case A can't be used in ranged for loop directly because it doesn't have begin() and end() methods, what you can do is wrap it in std::span (if you use C++20).

https://gist.github.com/7ca07290c4eb4b74721e12c97655a712 how is this any different from what new does?

https://gist.github.com/7ca07290c4eb4b74721e12c97655a712 how is this any different from what new does?

Also I'm not sure about whether will this code satisfy alignment rules for any structures (not an expert in this topic)

malloc() should do the minimum alignment required for it.

I'm not sure if this work as you expect data[i].T(); You probably need placement new here, something like new (data[i]) T();

I haven't tested it, but questions from me. This expression data[i].T();. What function to be called? A function named T? Or the templated object's constructor? How is the semantic rule for that?

Does this new expression require to be delete'ed?

templated object's constructor

Depends on whether it normal new or placement new. For placement new you can do it in this order malloc placement new // have a normal object here explicit destructor call free

#include<iostream> using namespace std; int main() {  int eid; char ename[100];  float basicSalary, hra, da, i_tax, net_salary;  cout<<"\n Enter Employee Id : ";  cin>>eid;  cout<<"\n Enter Employee Name : ";  cin>>ename;  cout<<"\n Enter Basic Salary : ";  cin>>basicSalary;  hra = 800;  da = 0.25 * basicSalary;  i_tax = 0.15 * basicSalary;  net_salary = basicSalary + da + hra - i_tax;           cout<<"\n ----------------------- ";  cout<<"\n Employee Id    : "<<eid;  cout<<"\n Employee Name  : "<<ename;  cout<<"\n Basic Salary   : "<<basicSalary; cout<<"\n HRA            : "<<hra;  cout<<"\n DA             : "<<da; cout<<"\n I-Tax          : "<<i_tax;  cout<<"\n Net Salary     : "<<net_salary;                  return 0; }

can anyone tell me whats the issue in this

What's your concern?

its been compiling since 2 hrs.

It compiles just fine on Godbolt. https://godbolt.org/z/8zaM9MYr3

https://play.google.com/store/apps/details?id=com.kvassyu.coding.cpp

Use widely used compiler. Your code is totally fine with respect to "can be compiled".

which compiler i must use then for android

For Android, I recommend you to install Termux, then install clang inside the Termux. So you can have full control over your compiler flags and command line. It's great.

For Android, I recommend you to install Termux, then install clang inside the Termux. So you can have full control over your compiler flags and command line. It's great.

How to install clang inside it

apt-get update -y; apt-get install clang;

Yup 😁

Ahh I gave that problem a lot of thought. Can't figure it out. Can you help me a little more 😭

Where you cannot figure it out?

I mean I thought about it along the lines of DP and the g4g thing but can't figure out an algo for the problem which I sent 😣

class Node { public: int data; Node *prev; Node *next; Node(int data) { this->data=data; prev=NULL; next=NULL; } }; whats the problem with this code, it says NULL wasn't declared in this scope. i have underlined the error line

class Node { public: int data; Node *prev; Node *next; Node(int data) { this->data=data; prev=NULL; next=NULL; } }; whats the problem with this code, it says NULL wasn't declared in this scope. i have underlined the error line

it worked now

class Node { public: int data; Node *prev; Node *next; Node(int data) { this->data=data; prev=NULL; next=NULL; } }; whats the problem with this code, it says NULL wasn't declared in this scope. i have underlined the error line

further, i would suggest using std::unique_ptr instead of a normal pointer since no two lists should own the exact same node

It cant be a unique_ptr because it is a doubly linked list

class Node { public: int data; Node *prev; Node *next; Node(int data) { this->data=data; prev=NULL; next=NULL; } }; whats the problem with this code, it says NULL wasn't declared in this scope. i have underlined the error line

std::shared_ptr for next and std::weak_ptr for prev

What are these

can auto recognize custom data types in C++ ?

You just need to write a recursive brute force algorithm with bitmasking mind. Then cache it to get O(2^n * n * n) time complexity. You have a set of n integers 1, 2, 3, .., n initially. The basic idea is 1. First, you pick a integer and remove it from the set. 2. repeat step 1 until the set get empty. Obviously, you have n! possibility of choice. The recursive solution is to emulate the process. Each step, you execute this function int cheapest_permutation(int set, int prev); where set is the set of the remain integers, prev is the integer you picked last time. In the function, you picked a integer i from set, try to minimize cheapest_permutation(set ^ (1 << i), i) + A[prev][i] where 1 <= i <= n and set & (1 << i) == 1.