Skip to content

0xsakthi/100-Days-of-Code

Repository files navigation

100-days-of-code

100 days of Coding Challenge

Overview

Day Title Description Language Source Link
1 COUNTING SORT ALGO One of the sorting method, less time complexity(O(n)) CPP
2 Number of Good pairs without bruteforce approach(ncr formula applied) PYTHON Leetcode View Code
3 Binary Search algorithm with O(log n) runtime complexity CPP Leetcode View Code
4 Finding the missing char,Codechef Competetion Solved Hashmap implemented solution CPP,Python Codechef View Code
5 Balanced Brackets Stack Method used to analyse the given brackets are balanced or not CPP HackerRank View Code
6 Kadane's Algorithm Given an array Arr[] of N integers. Find the contiguous sub-array(containing at least one number) which has the maximum sum and return its sum. CPP GFG-Practice View Code
7 Strong Password All characters in passwords are in [a-z], [A-Z], [0-9], or [!@#$%^&*()-+ ]. and length should be len>6 Python Hackerrank View Code
8 PALINDROME SUBSTRING First find out substrings of String and return the count of Palindrome in Substrings Python Leetcode View code
9 Pairs Given an array of integers and a target value, determine the number of pairs of array elements that have a difference equal to the target value. Python Hackerrank View code
10 Best Time to Buy and Sell You are given an array prices where prices[i] is the price of a given stock on the ith dayReturn the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0. Python Leetcode View code
11 Pascal Triangle Given an integer numRows, return the first numRows of Pascal's triangle.In Pascal's triangle, each number is the sum of the two numbers Python Leetcode View code
12 Angry Professor Arrival times go from on time () to arrived late ().Given the arrival time of each student and a threshhold number of attendees, determine if the class is cancelled. Python3 Hackerrank View code
13 Binary Tree Preorder Traversal Given the root of a binary tree, return the preorder traversal of its nodes' values CPP Leetcode View code
14 Reverse a String By Dots Given a String S, reverse the string without reversing its individual words. Words are separated by dots. Python3 GeeksForgeeks View code
15 Counting Bits Given an integer n, return an array ans of length n + 1 such that for each i (0 <= i <= n), ans[i] is the number of 1's in the binary representation of i. CPP Leetcode View code
16 Group Anagrams Given an array of strings strs, group the anagrams together. You can return the answer in any order.An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once. Python3 Leetcode View code
17 CodeChef Starters24 Competion Python3 Codechef View code
18 Maximum Product of Word Lengths Given a string array words, return the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. If no such two words exist, return 0. Python3 Leetcode View code
19 Integer To Roman Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. Python3 Leetcode View code
20 Number of Pairs of Strings With Concatenation Equal to Target Given an array of digit strings nums and a digit string target, return the number of pairs of indices (i, j) (where i != j) such that the concatenation of nums[i] + nums[j] equals target. CPP Leetcode View code
21 Longest Consecutive Sequence Given an unsorted array of integers nums, return the length of the longest consecutive elements sequence.You must write an algorithm that runs in O(n) time. Python3 Leetcode View code
22 Rotate The Array Given an array, rotate the array to the right by k steps, where k is non-negative. CPP Leetcode View code
23 Is Subsequence-Leetcode A subsequence of a string is a new string that is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (i.e., "ace" is a subsequence of "abcde" while "aec" is not). Python3 Leetcode View code
24 String Reverse(n) Minimum number of ways to reverse the String CPP Codechef View code
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published