Summer Camp and Internships

1. INSA Cyber Talent Challenge – 2017 E.C.

Tracks: Cybersecurity | Development | Embedded Systems | Aerospace

Apply: Here

2.iCog Labs AI Internship – 2025 Batch 1

Tracks: AI | ML | Robotics | Bioinformatics | Blockchain

Deadline: July 31

Apply:Here

3. Kuraz Technologies Hybrid Internship

Type: Summer | Unpaid | Hybrid

Deadline: May 31

Apply: Here

4. Tewanay Engineering Summer Internship

Tracks: Front-End | Back-End | Mobile App Development

Deadline: May 31

Apply: Here


@HanixJourney

#Internship

can u solve this question
▎Title: 201. Bitwise AND of Numbers Range

Difficulty: Medium

Denoscription:

Given two integers left and right that represent the range [left, right], return the bitwise AND of all numbers in this range, inclusive.

Example 1:

Input: left = 5, right = 7  
Output: 4

Explanation:

5 = 101
6 = 110
7 = 111

Bitwise AND of all numbers in the range [5, 7] is 4 (binary 100).

Example 2:

Input: left = 0, right = 0  
Output: 0

Example 3:

Input: left = 1, right = 2147483647  
Output: 0

Explanation:
There is no common bit position that stays 1 throughout the range, so the result is 0.

Constraints:

0 <= left <= right <= 2^31 - 1

can u solve this question? with bit manipulation in constant extra space and linear time complexity
▎Title: 137. Single Number II

Difficulty: Medium

Denoscription:

Given an integer array nums where every element appears three times except for one, which appears exactly once, find the single element and return it.

You must implement a solution with a linear runtime complexity and use only constant extra space.

Example 1:
Input: nums = [2,2,3,2]
Output: 3

Example 2:
Input: nums = [0,1,0,1,0,1,99]
Output: 99

Constraints:

• 1 <= nums.length <= 3 * 10^4

• -2^31 <= nums[i] <= 2^31 - 1

• Each element in nums appears exactly three times except for one element which appears once.