Skip to content

Added few frequently asked array questions. #7

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
karmicharsh wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Added few frequently asked array questions. #7

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
54 changes: 54 additions & 0 deletions ds-and-algo/answers/q10.html
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,54 @@
<html>
<head>
<title>Data Structures And Algorithms | InterQues</title>
</head>
<body>
<div>
<img
src="../../assets/hacktoberfest.png"
height="120px"
alt="Hacktoberfest"
/>
</div>

<div>
<p>
<small>
<a href="../../index.html">Home</a>
&gt;
<a href="../index.html"> Data Structures and Algorithms Questions</a>
&gt;
Merge Intervals
</small>
</p>
</div>

<div>
<div>
<h4>
Merge Intervals
</h4>
</div>

<br />
<br />

<div>
<strong>Answer:</strong>

<p>
def mergeIntervals(intervals):
intervals.sort(key=lambda x: x[0])
merged = []
for interval in intervals:
if not merged or merged[-1][1] < interval[0]:
merged.append(interval)
else:
merged[-1][1] = max(merged[-1][1], interval[1])
return merged

</p>
</div>
</div>
</body>
</html>
52 changes: 52 additions & 0 deletions ds-and-algo/answers/q11.html
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,52 @@
<html>
<head>
<title>Data Structures And Algorithms | InterQues</title>
</head>
<body>
<div>
<img
src="../../assets/hacktoberfest.png"
height="120px"
alt="Hacktoberfest"
/>
</div>

<div>
<p>
<small>
<a href="../../index.html">Home</a>
&gt;
<a href="../index.html"> Data Structures and Algorithms Questions</a>
&gt;
Two Sum
</small>
</p>
</div>

<div>
<div>
<h4>
Two Sum
</h4>
</div>

<br />
<br />

<div>
<strong>Answer:</strong>

<p>
def twoSum(nums, target):
hashmap = {}
for i, num in enumerate(nums):
complement = target - num
if complement in hashmap:
return [hashmap[complement], i]
hashmap[num] = i

</p>
</div>
</div>
</body>
</html>
56 changes: 56 additions & 0 deletions ds-and-algo/answers/q12.html
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,56 @@
<html>
<head>
<title>Data Structures And Algorithms | InterQues</title>
</head>
<body>
<div>
<img
src="../../assets/hacktoberfest.png"
height="120px"
alt="Hacktoberfest"
/>
</div>

<div>
<p>
<small>
<a href="../../index.html">Home</a>
&gt;
<a href="../index.html"> Data Structures and Algorithms Questions</a>
&gt;
Product of Array except self
</small>
</p>
</div>

<div>
<div>
<h4>
Product of array except self:
</h4>
</div>

<br />
<br />

<div>
<strong>Answer:</strong>

<p>
def productExceptSelf(nums):
length = len(nums)
answer = [0] * length
answer[0] = 1
for i in range(1, length):
answer[i] = nums[i - 1] * answer[i - 1]
R = 1
for i in reversed(range(length)):
answer[i] = answer[i] * R
R *= nums[i]
return answer

</p>
</div>
</div>
</body>
</html>
Empty file added ds-and-algo/answers/q13.html
View file
Open in desktop
Empty file.
53 changes: 53 additions & 0 deletions ds-and-algo/answers/q14.html
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,53 @@
<html>
<head>
<title>Data Structures And Algorithms | InterQues</title>
</head>
<body>
<div>
<img
src="../../assets/hacktoberfest.png"
height="120px"
alt="Hacktoberfest"
/>
</div>

<div>
<p>
<small>
<a href="../../index.html">Home</a>
&gt;
<a href="../index.html"> Data Structures and Algorithms Questions</a>
&gt;
Find all duplicates in an array
</small>
</p>
</div>

<div>
<div>
<h4>
Find all duplicates in an array
</h4>
</div>

<br />
<br />

<div>
<strong>Answer:</strong>

<p>
def findDuplicates(nums):
res = []
for num in nums:
if nums[abs(num) - 1] < 0:
res.append(abs(num))
else:
nums[abs(num) - 1] *= -1
return res

</p>
</div>
</div>
</body>
</html>
57 changes: 57 additions & 0 deletions ds-and-algo/answers/q15.html
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,57 @@
<html>
<head>
<title>Data Structures And Algorithms | InterQues</title>
</head>
<body>
<div>
<img
src="../../assets/hacktoberfest.png"
height="120px"
alt="Hacktoberfest"
/>
</div>

<div>
<p>
<small>
<a href="../../index.html">Home</a>
&gt;
<a href="../index.html"> Data Structures and Algorithms Questions</a>
&gt;
Longest Consective Sequence
</small>
</p>
</div>

<div>
<div>
<h4>
Longest Consective Sequence
</h4>
</div>

<br />
<br />

<div>
<strong>Answer:</strong>

<p>
def longestConsecutive(nums):
num_set = set(nums)
longest_streak = 0
for num in num_set:
if num - 1 not in num_set:
current_num = num
current_streak = 1
while current_num + 1 in num_set:
current_num += 1
current_streak += 1
longest_streak = max(longest_streak, current_streak)
return longest_streak

</p>
</div>
</div>
</body>
</html>
49 changes: 49 additions & 0 deletions ds-and-algo/answers/q16.html
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,49 @@
<html>
<head>
<title>Data Structures And Algorithms | InterQues</title>
</head>
<body>
<div>
<img
src="../../assets/hacktoberfest.png"
height="120px"
alt="Hacktoberfest"
/>
</div>

<div>
<p>
<small>
<a href="../../index.html">Home</a>
&gt;
<a href="../index.html"> Data Structures and Algorithms Questions</a>
&gt;
Rotate Array
</small>
</p>
</div>

<div>
<div>
<h4>
Rotate Array
</h4>
</div>

<br />
<br />

<div>
<strong>Answer:</strong>

<p>
def rotate(nums, k):
n = len(nums)
k %= n
nums[:] = nums[-k:] + nums[:-k]

</p>
</div>
</div>
</body>
</html>
52 changes: 52 additions & 0 deletions ds-and-algo/answers/q7.html
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,52 @@
<html>
<head>
<title>Data Structures And Algorithms | InterQues</title>
</head>
<body>
<div>
<img
src="../../assets/hacktoberfest.png"
height="120px"
alt="Hacktoberfest"
/>
</div>

<div>
<p>
<small>
<a href="../../index.html">Home</a>
&gt;
<a href="../index.html"> Data Structures and Algorithms Questions</a>
&gt;
Find the missing number.
</small>
</p>
</div>

<div>
<div>
<h4>
<!-- Your Question Title -->
Given an array containing n distinct numbers taken from 0, 1, 2, ..., n. Find the missing number.
</h4>
</div>

<br />
<br />

<div>
<strong>Answer:</strong>

<p>
<!-- Your Answer -->
def findMissingNumber(arr):
n = len(arr)
total_sum = n * (n + 1) // 2
array_sum = sum(arr)
return total_sum - array_sum

</p>
</div>
</div>
</body>
</html>
Loading