like vim?

like vim?

like codeblocks, visual studio, clion

like codeblocks, visual studio, clion

i'll try clion

Clion is not free and Codeblocks is outdated

codeblocks feels like really outdated rn

still easier to explain than how to set up vim

and so.. buy it?

Clion is not free and Codeblocks is outdated

still easier to explain than how to set up vim

codeblocks feels like really outdated rn

well it is not really recent but it has gcc8 so you are fine with c++17

i don't know what to say now, i was diverted to another route and that's dead end already

I can explain that. Install vim, open .vimrc. :set sets commands. Use Plug to install packages and you can set bindings using map and variables can be set using let

there is some availability to use clang in vs

What I actually meant is why do you choose others if Visual Studio is free and has intelli sense and a better debugger by default

visual studio community then

you think user that failed to set up vsc will be successful with this description?

Or I can create a .vimrc file and you can copy it in your home folder(linux)

Is there any support from compilers/build systems to automatically generate several versions of one code and to add the fallback code?

Then I'll be using already existing iterator

Please what is the wrong with this code and solution

Please what is the wrong with this code and solution

Msvc can do that for intrinsics, replacing them with a function, but I do not know. If you find anything like it I would be mighty interested

Hey dears which ide is good for c programming

Is here anyone

Are these free?

Are these free?

How to install and write code in vs code?

How to install and write code in vs code?

?

?

i have a issue, vec<int> tmp; PeekingIterator it(tmp); // now here you'll first make all calls to hasnext, next, peek and after all calls are done you'll change tmp right? because in the question it is //said don't create a new nums integer. just use the existing one. (and even in the iterator class the next and hasnext function will be written //thinking that the nums vector won't change) // all the modifications to tmp vector or nums will be made here, when all calls are done all this is like this following code where we're changing the vector but after the operations are performed using iterator, which should run fine without any ub #include<iostream> #include<vector> using namespace std; int main() { vector<int> v; v.push_back(0); v.push_back(1); v.push_back(2); v.push_back(3); int *it=&v[0]; int t=4; while(t--) { cout<<*it<<endl; it++; } v.push_back(4); v.push_back(5); }

The question doesn't tell you when the vector passed in to your iterator is populated. So the calling code in Leetcode could be something like. vector<int> nums; PeekingIterator it(nums); nums.assign({1,2,3}); it.peek(); it.next(); it.peek(); .... In such cases, your PeekingIterator may be invalidated which would cause Undefined Behavior.

But if the vector is changed don't you think the answer will change too Like suppose when passed, vector was (1,2,3) Now in the next line you change it to (3,4,5) Now we have calls to peek and next It.peek. 3 It.next. 3 It.next. 4 And in the question it is said that you can't store vector and have to directly manipulate the existing vector In that case we can't produce answers for previous vector that was (1,2,3)

So you mean (1,2,3) now become (1,2,3,3,4,5)?

No. Suppose say the question requires the vector to hold the values 1,2,3. It could be done like this: vector<int> nums{1,2,3}; PeekingIterator it(nums); it.peek(); it.next(); .... or vector<int> nums; PeekingIterator it(nums); nums.assign({1,2,3}); it.peek(); it.next(); .... Your code would most likely fail in the latter case

Yea in 2nd case my code will fail but then how can we write next and hasnext to such a case Because you haven't stored vector and neither you're getting vector as an argument to next and hasnext

You should use Iterator::next and Iterator::hasNext which is the point of the whole exercise. For all you know, the Iterator class implemented by LeetCode stores a reference to the vector and it's methods would work fine.

Where is it said it stores a reference to vector😅

Hai can anyone help me to write a c program To display 10 most common words in a text file

10 MOST COMMON WORDS #include <stdio.h> #include <string.h> #include <stdlib.h> #include<ctype.h> int main() { FILE *file; char *line; size_t len = 0, read; char words[1000][1000], word[20]; int i = 0, j, k, maxCount = 0, count; //Opens file in read mode file = fopen("data.txt","r"); //If file doesn't exist if (file == NULL){ printf("File not found"); exit(EXIT_FAILURE); } //Since, C doesn't provide in-built function, //following code will split content of file into words while ((read = getline(&line, &len, file)) != -1) { for(k=0; line[k]!='\0'; k++){ //Here, i represents row and j represents column of two-dimensional array words if(line[k] != ' ' && line[k] != '\n' && line[k] != ',' && line[k] != '.' ){ words[i][j++] = tolower(line[k]); } else{ words[i][j] = '\0'; //Increment row count to store new word i++; //Set column count to 0 j = 0; } } } int length = i; //Determine the most repeated word in a file for(i = 0; i < length; i++){ count = 1; //Count each word in the file and store it in variable count for(j = i+1; j < length; j++){ if(strcmp(words[i], words[j]) == 0 && (strcmp(words[i]," ") != 0)){ count++; } } //If maxCount is less than count then store value of count in maxCount //and corresponding word to variable word if(count > maxCount){ maxCount = count; strcpy(word, words[i]); } } printf("Most repeated word: %s", word); fclose(file); return 0; }

This code shows only one common word but I need to display 10 common words

Its very urgent please help me

Hey,has anyone used FKTK?

Help me do it correctly

Help me do it correctly

Do it yourself

No one is gonna solve your assignments