Live Mock Interview | C++ Fundamentals and DSA Round

Live Mock Interview | C++ Fundamentals and DSA Round

GeeksforGeeks

3 года назад

25,195 Просмотров

Ссылки и html тэги не поддерживаются


Комментарии:

20BCS067 Shahbaz
20BCS067 Shahbaz - 06.09.2023 01:05

Itne easy question 😁

Ответить
Itech Innovations
Itech Innovations - 25.02.2023 14:00

Using a map for the setting the frequencies of each char in str1 and then finding the one who is added in str2 will be a good approach??

Ответить
Vignesh Chandran
Vignesh Chandran - 22.01.2023 11:21

Please make this mock interview video in english

Ответить
Sahil Shile
Sahil Shile - 02.11.2022 21:13

For the first Question :
1) Brute force: Running two loops and checking which is not in other string
2) sort both string
Then traverse cheak every char is equal or not if not then return
3) creating bool array
Mark ascii number of first string each char as true then traverse second string cheak which char give false ans then return
4) same as 3 rd one but of extra stack space : Creating map instead of visited bool array

Ответить
Ashu Kushwaha
Ashu Kushwaha - 19.09.2022 15:11

Iiterate modified string as s.find(c)
Which return false that char is ans

Ответить
65 Sahil Shah
65 Sahil Shah - 06.09.2022 18:24

she doesn't know how to code , and that's all.

Ответить
Aditya Mishra
Aditya Mishra - 09.08.2022 20:31

Kya chutiyaap chal raha tha yahan pe ???
Ye geeksforgeeks hai.... waaah , yehi banayenge general AI ya time machine...
( and i am talking about the guys taking the interview )

Ответить
smita patil
smita patil - 06.05.2022 21:01

Nice job sir

Ответить
divyaja athota
divyaja athota - 23.04.2022 09:54

Could you please provide experienced questions in C++?

Ответить
ADARSH SHARMA
ADARSH SHARMA - 15.06.2021 15:47

First question can be solved in O(n) time and O(1) space if we count the sum of all elements ascii value in s1 string and same done for s2 string as well and then subtract it you will get your answer in c++.

Ответить
Vijay Kumar
Vijay Kumar - 10.06.2021 14:22

How to delete last node from sll, with that particular node(last node) address only

Ответить
Code N Chill
Code N Chill - 09.06.2021 17:19

how can i apply for the interview

Ответить
Aditya Jha
Aditya Jha - 09.06.2021 04:10

Add ord(character) of each string separately and subtract them you are done for the first question....

Ответить
collen gura
collen gura - 08.06.2021 20:45

She is clearer now: English. My apology

Ответить
collen gura
collen gura - 08.06.2021 20:44

Good program. I am failing to follow her. Is she speaking in English?

Ответить
tanki pro
tanki pro - 08.06.2021 20:24

First question just count the freq of each character in both the string and compare the freq whichever dont match thats the ans
OR
sort both the strings and then iterate with the shorter one wherever it doesn't match is the ans

Ответить
Prashant Dhok
Prashant Dhok - 08.06.2021 19:30

Please try to make videos or another channel on SAP technical and financial configuration

Ответить
AkaSh RawAt
AkaSh RawAt - 08.06.2021 19:24

Sir for two strings S1,S2 we will check every characters of S1 string with S2 string's character and which are present in both we will put them in another string S3 & at last we will compare S2 & S3 that which character is missing from S3.
The character which is missing from S3 will be our answer (i.e the character which is added into S2).


Using loop
S1= ab
S2=ab after adding a character in S2 then S2=abc

Now using loop we will check that S1
for(i=0;i<S1.length;i++)
{
char x=S1[i];
for(j=0;j<S2.length;j++)
{
char y=S2[j]
if(y==x)
S3=S2[j]
}
}
now check which character is different is missing in S3

Ответить
Mandhe_idhiantha....
Mandhe_idhiantha.... - 08.06.2021 18:48

Why u guys always making interviews in c++,?why not python..?🙄

Ответить