Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
PhoneDirectory
Design a Phone directory -> Recent Calls to old Calls -> Particular Number se Available Number kitna sara calls -> Number -> kon kon sa number pe call gya h //103140459 Recent Calls to old calls => Kon sa DS LIFO => Stack<string>callRecord class phoneDirectory{ stack<string>callRecord;//Storing only dialled Numbers - Receivers map<string,vector<string>>listOfAllDialledNumbers;//sender(key) -> vector<receivers:string> //constructor phoneDirectory() { callRecord.clear(); listOfAllDialledNumbers.clear(); } void makeCall(string sender,string receiver) { callRecord.push(receiver); listOfAllDialledNumbers[sender].push_back(receiver); } vector<string> getDetails() { //top=> Most Recent => Less Recent => LIFO stack<string>tempStack; vector<string>records; //Bottom 1 2 3 4 5 top //vector 5 4 3 2 1 //tempStack 5 4 3 2 1 //callRecord 1 2 3 4 5 => O(N) while(!callRecord.empty()) { string num=callRecord.top(); tempStack.push(callRecord.top()); callRecord.pop(); records.push_back(num); } //records are populated => O(N) while(!tempStack.empty()) { callRecord.push(tempStack.top()); tempStack.pop(); } return records; } vector<string>allDialledNumber(string sender) { return listOfAllDialledNumbers[sender]; } }; /* Key => value 41 => Abhishek pareek map<int,string>mp; map<keydataType,valueDataType>mp; CollegeName=> Rcc Ka sara student naam =>string => vector<> map<string,vector<string>> <Ankit> =>[atindra,sourav,sidhu] num => string <98301>=>["3q4q3","5454"] return u["string:num"] */
run
|
edit
|
history
|
help
0
template example
maximum nights you can accommodate
Full System Specifications
Minimum Vertices to Traverse Directed Graph
TraiectorieIdeala2
Policy based smart pointer
CirclQ
N Qeens problem
Discounting Future Stream
virtual function role