Programming World👨💻
前往频道在 Telegram
All programming language tutorials,courses and more..! For HTML: @html_web_learn For CSS: @CSS_web_learn For JS: @JavaScript_js_learn For PHP: @learn_php_web For Programming courses @Programmingworld_dev For CEH,Cybersec: @technical_stark
显示更多未指定国家技术与应用34 732
1 412
订阅者
无数据24 小时
-57 天
-1330 天
帖子存档
1 412
⛱️ SUMMER SALE| Get skills and get promoted. Courses starting at ₹430. Ends 7/25, 11:59 p.m. PDT.
3 days left!
https://www.udemy.com/
1 412
Python : Complete Guide to Date and Time Functions
https://www.listendata.com/2019/07/how-to-use-datetime-in-python.html
1 412
One of the best way to learn Programming is by understanding more repositories in GitHub it may be any Programming Language
1 412
TCS NQT Syllabus & Pattern for TCS National Qualifier Test 2020 | Faceprep
TCS has revealed the TCS Ninja exam pattern for TCS Ninja National qualifier test (TCS NQT). TCS NQT pattern for 2020 batch is slightly different from its previous year TCS NQT recruitments.
The TCS Ninja (TCS NQT) test would be of 90 minutes and will have questions from the following categories.
1) English
2) Quantitative Aptitude
3) Programming Logic MCQ’s
4) Coding
TCS NQT Exam Pattern for 2020 passouts
Order of appearance Section Number of questions Duration
1st English 15 10 mins
2nd Quantitative Aptitude 15 30 mins
3rd Programming Concepts 10 20 mins
4th Coding 1 30 mins
1 412
18-07-2019 InfyTQ question:
Question 1:
Input:
N and an Array
Where 0 < N < len(Array)
Example
N = 2
Array = 1, 2, 3, 3, 4, 4
Output:
To find the
Least number of unique elements after deleting N number of elements in the Array
In the above example,
After deleting N = 2 number of elements from the Array
In the above example 1, 2 should be deleted from the array
3, 3, 4, 4 will be remaining
So,
2 unique elements remaining after deleting 2 elements from the array
So, the output should be 2
Question 2:
InfyTQ
Date: 18-07-2019
Input:
N
Array
Maximum number of swaps that you can perform on the given Array = N
Output:
The final answer should be the smallest possible integer that you can get from the given array by performing N swaps
