A Teacher of California institute of Technology takes people on yearly trips to museums of science and development for a mind refreshing tour. Total of children depend on their passing percentage and people appearing for the exam. For every section of the museum, the teacher always stands in line and checks if anyone is missing from the queue. All students will be standing in no order in the queue.

Write a code to find the missing child from the queue

Total Students:

Jina, Jeniffer, John, Ronald, Jacob, Joe, Ralph, Surya, Scully, Nina, Scarlet

In Applied science queue standing people

Ronald, Ralph, Scully, Scarlet, Jina, Jeniffer, Joe, Nina, Surya, Jacob

Remove duplicates from a sorted non-decreasing Array

input: [1,2,3,3,4,5,5,6]
output: [1,2,3,4,5,6]

These are some questions I faced in my recent interviews. If you're getting ready for a frontend interview, make sure to review and practice these questions. I'll be sharing more questions over the next few days.

What is the output?

console.log(1);
setTimeout(()=>{console.log('setTimeOut')}, 0);
Promise.resolve().then(()=>{
console.log('P1');
}).then(()=>{
console.log('P2');
}).then(()=>{
console.log('P3');
});
console.log(2);

What is the output?

(function(){
var a = b = 1;
})();
console.log('b', b);
console.log('a', a);

What is the output?

console.log(test3);
console.log(test3());
var test3 = function(){return 3;}

Back with the Node.js series 💻
Join me and learn step by step

https://www.youtube.com/playlist?list=PL_6klLfS1WqHJ9c4KBJNw3qKV0zYilwIk

I have completed my Node.js series where I have covered all the essential Node.js topics, including:

* Node.js Fundamentals
* Modules
* File System (FS)
* HTTP Module
* Event Loop
* Streams & Buffers
* Express.js
* Routing
* Middleware
* REST APIs
* MongoDB & Mongoose
* Authentication & JWT
* File Uploads
* Error Handling
* Environment Variables
* MVC Architecture
* Deployment
* And much more.

Join me and learn step by step
https://www.youtube.com/playlist?list=PL_6klLfS1WqHJ9c4KBJNw3qKV0zYilwIk

🔥 The DSA journey starts NOW!

I’ve started a brand-new Data Structures & Algorithms series! 🚀

And we’re starting with the most important foundation — BIG O NOTATION.

If you’ve ever wondered:
❓ Why is one solution better than another?
❓ How do we measure code efficiency?
❓ What does O(n), O(log n) or O(n²) actually mean?

This first video will make it simple. 💯

🎬 DSA Series — Episode 1: Big O Notation

👉 Watch here: https://youtu.be/XifeSvLhKtk?si=nRVA3uaBdDzVE6mg

More DSA topics coming soon. Stay tuned! 🚀🔥