New Delhi, India – The Ministry of Education has issued an invitation to apply for the National Awards to Teachers 2022. Teachers from all around the country can apply and register online for self-nomination at nationalawardstoteachers.education.gov.in. The registration deadline for NAT 2022 is June 20.Confused About Which Career Path to Take? Here’s How to Determine […]
In preparation for teacher constituency elections, the Karnataka government has scheduled a vacation for schools and institutions in Vijayapura, Bagalkote, Mysore, Belgaum, Chamrajnagar, Mandya, Hassan, Dharwad, Haveri, Gadag, and Uttar Kannada on Monday, June 13, 2022. The notification applies to all government institutions, including assisted and unaided. The incumbent Bharatiya Janata Party (BJP) and the
The Karnataka government has declared June 13 as a holiday for schools and institutions. Read More »
PUNE: Students at Savitribai Phule Pune University (SPPU) and its associated institutions preparing for semester examinations in June have asked that the university deliver the promised question bank.“The education department had promised pupils a question bank to help them study for the test,” Yuva Sena state secretary Kalpesh Yadav said. However, it has yet to
SPPU students in Pune seek a question bank and early results. Read More »
Offline SPPU examinations with 15 minutes of additional time per hourSavitribai Phule Pune University (SPPU) has announced that the summer exams would be done in the usual offline format beginning June 20.After a few student activists filed the Bombay high court, demanding universality among all universities and suggested that the test be held offline in
Offline SPPU examinations with 15 minutes of additional time per hour Read More »
Given an array of integers nums containing n + 1 integers where each integer is in the range [1, n] inclusive. There is only one repeated number in nums, return this repeated number. You must solve the problem without modifying the array nums and uses only constant extra space. Example 1: Input: nums = [1,3,4,2,2] Output: 2 Example 2: Input: nums = [3,1,3,4,2] Output: 3 Constraints: 1 <= n <= 105
Leet Code : Find the Duplicate Number / Element C++ ,Java , Python Solution: Read More »
Given an array, rotate the array to the right by k steps, where k is non-negative. Example 1: Input: nums = [1,2,3,4,5,6,7], k = 3 Output: [5,6,7,1,2,3,4] Explanation: rotate 1 steps to the right: [7,1,2,3,4,5,6] rotate 2 steps to the right: [6,7,1,2,3,4,5] rotate 3 steps to the right: [5,6,7,1,2,3,4] Example 2: Input: nums = [-1,-100,3,99], k = 2 Output:
Leet Code: Rotate Array C++ Python || JavaScript || Java solution: Read More »
You are given an array of k linked-lists lists, each linked-list is sorted in ascending order. Merge all the linked-lists into one sorted linked-list and return it. Example 1: Input: lists = [[1,4,5],[1,3,4],[2,6]] Output: [1,1,2,3,4,4,5,6] Explanation: The linked-lists are: [ 1->4->5, 1->3->4, 2->6 ] merging them into one sorted list: 1->1->2->3->4->4->5->6 Example 2: Input: lists = [] Output:
Leet Code : Merge k Sorted Lists C++ , Java , Python solution Read More »
Given the head of a linked list, reverse the nodes of the list k at a time, and return the modified list. k is a positive integer and is less than or equal to the length of the linked list. If the number of nodes is not a multiple of k then left-out nodes, in the end, should remain as it is. You
Leet Code : Reverse Nodes in k-Group Java, Python ,C++ JavaScript Solution Read More »
Write a function to find the longest common prefix string amongst an array of strings. If there is no common prefix, return an empty string “”. Example 1: Input: strs = [“flower”,”flow”,”flight”] Output: “fl” Example 2: Input: strs = [“dog”,”racecar”,”car”] Output: “” Explanation: There is no common prefix among the input strings. Java Solution C++ solution
Leet Code : longest common prefix string C++ ,java , Python Solution Read More »
The string “PAYPALISHIRING” is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility) P A H N A P L S I I G Y I R And then read line by line: “PAHNAPLSIIGYIR” Write the code that will take
