Скачать или смотреть Google Coding Interview Question-11 || Difficulty-Easy

#google #googleinterview #googleinterviewquestions
Hello everyone. I am Harsh Kumar Khatri currently a Beta Microsoft student partner and this video is about a google interview question and how I have solved that question.

Question: Given an array A of N positive integers and another number X. Determine whether or not there exists two elements in A whose sum is exactly X.
Input: 6 16
1 4 45 6 10 8
Output: Yes

This will be a complete series of 30 videos where I will be solving google interview questions from various different difficulty levels.

If you want video on any of the topics then you can comment it down below.

More videos related to what I learn will be posted in the coming days so click the subscribe button and press the bell icon to get updated with the videos.

You can connect with me on my socials given below.
Github:- https://github.com/harshkumarkhatri
Linkedin:-   / harsh-kum.  .
Twitter:-   / harshkhatri24  
Instagram:-   / call_me_shhaggy  
Mail:- [email protected]

Read blogs which I post:- https://harshblog.xyz/