abh - HTMLify profile

abh's Profile Picture

abh

428 Files

60285 Views

Latest files of abh

1. LeetCode - Get Maximum in Generated Array - Go | Owner: abh | Views: 1 | Comments: 0 | Open/ Source 342 B

func getMaximumGenerated(n int) int { if n == 0 { return 0 } arr := []int{0, 1} for len(arr) < n + 1 { l := len(ar

2. LeetCode - Semi-Ordered Permutation - Go | Owner: abh | Views: 2 | Comments: 0 | Open/ Source 317 B

func SliceFind(arr []int, target int) int { for i, v := range arr { if v == target { return i } } return -1 }

3. notes.lua | Owner: abh | Views: 5 | Comments: 0 | Open/ Source 2.49 KB

-- [[ notes ]] -- local lfs = require("lfs") local notes_dir = os.getenv("HOME") .. "/.local/share/nvim/notes/" local attr =

4. telescope.lua | Owner: abh | Views: 2 | Comments: 0 | Open/ Source 126 B

return { "nvim-telescope/telescope.nvim", tag = "1.8.0", dependencies = { "nvim-lua/plenary.nvim" } }

5. luarocks.lua | Owner: abh | Views: 2 | Comments: 0 | Open/ Source 1.01 KB

-- [ LuaRock Managment ] -- local M = {} function M.list() local out = io.popen("luarocks list"):read("*a") local inst

6. LeetCode - Valid Perfect Square - Go | Owner: abh | Views: 3 | Comments: 0 | Open/ Source 165 B

func isPerfectSquare(num int) bool { n := 1 for { s := n * n if s == num { return true } if s > num { br

7. yankbin.lua | Owner: abh | Views: 33 | Comments: 0 | Open/ Source 4.73 KB

-- [ Yank Bin ] -- local lfs = require("lfs") local pickers = require("telescope.pickers") local finders = require("telescope.

8. LeetCode - Design Browser History - Go | Owner: abh | Views: 4 | Comments: 0 | Open/ Source 1.21 KB

// @leet start type BrowserHistoryNode struct { Url string Back *BrowserHistoryNode Forward *BrowserHistoryNode } t

9. LeetCode - Next Greater Node In Linked List - Go | Owner: abh | Views: 6 | Comments: 0 | Open/ Source 432 B

// @leet start /** * Definition for singly-linked list. * type ListNode struct { * Val int * Next *ListNode *

10. logger.lua | Owner: abh | Views: 25 | Comments: 0 | Open/ Source 1.11 KB

-- [[ logger.lua ]] -- local M = {} function M.log() local cr, cc = unpack(vim.api.nvim_win_get_cursor(0)) vim.cmd(":

11. init.lua | Owner: abh | Views: 7 | Comments: 0 | Open/ Source 102 B

-- [[ helpers funcitons and functnalitis ]] -- local luarocks = require("luarocks") local helpers = { { "run-code" },

12. run-code.lua | Owner: abh | Views: 5 | Comments: 0 | Open/ Source 609 B

-- [[ run-code.lua ]] -- local M = {} function M.run_code() local filetype = vim.bo.filetype; if filetype == "text" th

13. indent_line.lua | Owner: abh | Views: 10 | Comments: 0 | Open/ Source 264 B

return { { "Yggdroot/indentLine", config = function () vim.g.indentLine_char = "│" -

14. fzf.lua | Owner: abh | Views: 4 | Comments: 0 | Open/ Source 630 B

return { { "junegunn/fzf.vim", dependencies = { "junegunn/fzf" }, init = function() -- S

15. lsp_config.lua | Owner: abh | Views: 6 | Comments: 0 | Open/ Source 2.35 KB

return { { 'neovim/nvim-lspconfig', dependencies = { 'saghen/blink.cmp' }, opts = { serv

16. leetcode.lua | Owner: abh | Views: 9 | Comments: 0 | Open/ Source 422 B

return { { "kawre/leetcode.nvim", build = ":TSUpdate html", -- if you have `nvim-treesitter` installed

17. nerdtree.lua | Owner: abh | Views: 5 | Comments: 0 | Open/ Source 166 B

return { { "scrooloose/nerdtree", keys = { { "<F2>", ":NERDTreeToggle<CR>", mode = "n", desc = "

18. treesitter.lua | Owner: abh | Views: 5 | Comments: 0 | Open/ Source 304 B

return { { "nvim-treesitter/nvim-treesitter", build = ":TSUpdate", config = function() require("nvim-treesit

19. blink.lua | Owner: abh | Views: 7 | Comments: 0 | Open/ Source 1.69 KB

return { { 'saghen/blink.cmp', -- optional: provides snippets for the snippet source -- dependencies

20. mappings.lua | Owner: abh | Views: 4 | Comments: 0 | Open/ Source 1.25 KB

--[[ Keymappings ]]-- local ntst = { noremap=true, silent=true } -- Leader keys vim.g.mapleader = " " vim.g.maplocalleader = "

21. options.lua | Owner: abh | Views: 7 | Comments: 0 | Open/ Source 475 B

-- Options -- Block Cursor vim.opt.guicursor = "" -- Line numbers vim.opt.number = true vim.opt.relativenumber = true -- Ind

22. lazy-lock.json | Owner: abh | Views: 6 | Comments: 0 | Open/ Source 2.5 KB

{ "SimpylFold": { "branch": "master", "commit": "ff4c85197c5555715093c08a8d4f9d493c4d80cd" }, "Zenburn": { "branch": "master

23. init.lua | Owner: abh | Views: 10 | Comments: 0 | Open/ Source 1.98 KB

--[[ init.lua ]]-- vim.cmd.colorscheme("zaibatsu") -- Error Mesages and wornigs vim.diagnostic.config({ virtual_text = {

24. LeetCode - Add Two Numbers II - Go | Owner: abh | Views: 10 | Comments: 0 | Open/ Source 1.18 KB

// @leet start /** * Definition for singly-linked list. * type ListNode struct { * Val int * Next *ListNode *

25. LeetCode - Design Linked List - Go | Owner: abh | Views: 13 | Comments: 0 | Open/ Source 2.03 KB

// LinkedList // import "fmt" // type ListNode struct { // Val int // Next *ListNode // } type MyLinkedList struct {

26. LeetCode - Delete Node in a Linked List - Go | Owner: abh | Views: 20 | Comments: 0 | Open/ Source 330 B

// @leet start /** * Definition for singly-linked list. * type ListNode struct { * Val int * Next *ListNode *

27. LeetCode - Double a Number Represented as a Linked List - Go | Owner: abh | Views: 9 | Comments: 0 | Open/ Source 801 B

// @leet start /** * Definition for singly-linked list. * type ListNode struct { * Val int * Next *ListNode *

28. LeetCode - Linked List Cycle - Ruby | Owner: abh | Views: 12 | Comments: 0 | Open/ Source 414 B

# Definition for singly-linked list. # class ListNode # attr_accessor :val, :next # def initialize(val) # @v

29. LeetCode - Linked List Cycle - Go | Owner: abh | Views: 12 | Comments: 0 | Open/ Source 499 B

/** * Definition for singly-linked list. * type ListNode struct { * Val int * Next *ListNode * } */ func

30. LeetCode - Remove Linked List Elements - Go | Owner: abh | Views: 12 | Comments: 0 | Open/ Source 424 B

/** * Definition for singly-linked list. * type ListNode struct { * Val int * Next *ListNode * } */ func re

31. LeetCode - Remove Nth Node From End of List - Ruby | Owner: abh | Views: 15 | Comments: 0 | Open/ Source 404 B

def remove_nth_from_end(head, n) if not head or not head.next then return nil end len = 0 th = head while

32. LeetCode - Reverse Linked List - Go | Owner: abh | Views: 22 | Comments: 0 | Open/ Source 383 B

// @leet start /** * Definition for singly-linked list. * type ListNode struct { * Val int * Next *ListNode *

33. LeetCode - Check if Numbers Are Ascending in a Sentence - Go | Owner: abh | Views: 15 | Comments: 0 | Open/ Source 561 B

func atoi(s string) int { var n int for _, c := range s { n = (n*10) + int(c-48) } return n } func is_number(s stri

34. LeetCode - Longest Substring Without Repeating Characters - Go | Owner: abh | Views: 17 | Comments: 0 | Open/ Source 505 B

func contain_duplicate(s string) bool { for _, c := range s { var count int for _, cc := range s { if c == cc {

35. LeetCode - Excel Sheet Column Number - Go | Owner: abh | Views: 20 | Comments: 0 | Open/ Source 179 B

func titleToNumber(columnTitle string) int { p := 1 var n int for i:=len(columnTitle)-1; i>=0; i++ { c = columnTitle[i]

36. LeetCode - Sqrt(x) - Go | Owner: abh | Views: 27 | Comments: 0 | Open/ Source 122 B

func mySqrt(x int) int { for n := range x+1 { if n*n >= x || (n+1)*(n+1) > x { return n } } return 0 }

37. LeetCode - Robot Bounded In Circle - Dart | Owner: abh | Views: 10 | Comments: 0 | Open/ Source 2.19 KB

class Solution { bool isRobotBounded(String instructions) { List<int> direction = [0, 1], cordinates = [0, 0];

38. Leetcode - Remove Duplicates from Sorted List - Dart | Owner: abh | Views: 26 | Comments: 1 | Open/ Source 651 B

/** * Definition for singly-linked list. * class ListNode { * int val; * ListNode? next; * ListNode([this.val =

39. LeetCode - Rotate List - Go | Owner: abh | Views: 19 | Comments: 0 | Open/ Source 540 B

/** * Definition for singly-linked list. * type ListNode struct { * Val int * Next *ListNode * } */ func ro

40. LeetCode - Middle of the Linked List - Go | Owner: abh | Views: 24 | Comments: 0 | Open/ Source 379 B

/** * Definition for singly-linked list. * type ListNode struct { * Val int * Next *ListNode * } */ func mi

41. LeetCode - Convert Binary Number in a Linked List to Integer - Go | Owner: abh | Views: 28 | Comments: 0 | Open/ Source 409 B

/** * Definition for singly-linked list. * type ListNode struct { * Val int * Next *ListNode * } */ func ge

42. LeetCode - Number of Unequal Triplets in Array - Go | Owner: abh | Views: 38 | Comments: 0 | Open/ Source 299 B

func unequalTriplets(nums []int) int { l := len(nums) var count int for i:=0; i<l-2; i++ { for j:=i+1; j<l-1; j++ {

43. drinking-guy.jpg | Owner: abh | Views: 57 | Comments: 0 | Open/ Source 50.87 KB

44. gentle-boy.png | Owner: abh | Views: 134 | Comments: 0 | Open/ Source 41.58 KB

45. kutta.png | Owner: abh | Views: 141 | Comments: 0 | Open/ Source 40.89 KB

46. tb.gif | Owner: abh | Views: 157 | Comments: 0 | Open/ Source 2.7 MB

47. tea-serve.gif | Owner: abh | Views: 146 | Comments: 0 | Open/ Source 2.95 MB

48. tea-mix.gif | Owner: abh | Views: 136 | Comments: 0 | Open/ Source 250.11 KB

49. tea-pour.gif | Owner: abh | Views: 139 | Comments: 0 | Open/ Source 643.01 KB

50. index.html | Owner: abh | Views: 186 | Comments: 0 | Open/ Source 6.31 KB

<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8"> <meta name="viewport" content="width=device-width, in

51. precious-memories-chosic.com.mp3 | Owner: abh | Views: 348 | Comments: 0 | Open/ Source 2.41 MB

52. LeetCode - Number of Valid Words in a Sentence - Go | Owner: abh | Views: 30 | Comments: 0 | Open/ Source 1.49 KB

import "fmt" func split_words(sentence string) []string { var words []string l, i := 0, 0 for ; i<len(sentence); i++ {

53. LeetCode - Design Parking System - Go | Owner: abh | Views: 29 | Comments: 0 | Open/ Source 760 B

type ParkingSystem struct { big int medium int small int } func Constructor(big int, medium int, small int) Parki

54. LeetCode - Number of Recent Calls - Go | Owner: abh | Views: 41 | Comments: 0 | Open/ Source 471 B

type RecentCounter struct { pings []int } func Constructor() RecentCounter { var rc RecentCounter return rc }

55. LeetCode - Richest Customer Wealth - Go | Owner: abh | Views: 36 | Comments: 0 | Open/ Source 322 B

func maximumWealth(accounts [][]int) int { var max_wealth int for _, customer := range accounts { var wealth

56. LeetCode - Next Greater Element I - Go | Owner: abh | Views: 29 | Comments: 0 | Open/ Source 291 B

func nextGreaterElement(nums1 []int, nums2 []int) []int { var ans []int for _, n := range nums1 { f := false g := -

57. LeetCode - N-ary Tree Postorder Traversal - Go | Owner: abh | Views: 36 | Comments: 0 | Open/ Source 342 B

/** * Definition for a Node. * type Node struct { * Val int * Children []*Node * } */ func postorder(root

58. LeetCode - N-ary Tree Preorder Traversal - Go | Owner: abh | Views: 45 | Comments: 0 | Open/ Source 340 B

/** * Definition for a Node. * type Node struct { * Val int * Children []*Node * } */ func preorder(root

59. LeetCode - Palindrome Linked List - Go | Owner: abh | Views: 45 | Comments: 0 | Open/ Source 1022 B

/** * Definition for singly-linked list. * type ListNode struct { * Val int * Next *ListNode * } */ /* St

60. LeetCode - Implement Queue using Stacks - Go | Owner: abh | Views: 34 | Comments: 0 | Open/ Source 1.21 KB

// Stack implimentatin type MyStack struct { values []int len int } func (this *MyStack) Push(x int) { this.va

61. LeetCode - Implement Stack using Queues - Go | Owner: abh | Views: 49 | Comments: 0 | Open/ Source 715 B

type MyStack struct { values []int len int } func Constructor() MyStack { var stack MyStack return stack }

62. LeetCode - Maximum Nesting Depth of the Parentheses - Go | Owner: abh | Views: 40 | Comments: 0 | Open/ Source 302 B

func maxDepth(s string) int { var depth, max_depth int for _, c := range s { if c == '(' { depth

63. LeetCode - Crawler Log Folder - Go | Owner: abh | Views: 31 | Comments: 0 | Open/ Source 313 B

func minOperations(logs []string) int { depth := 0 for _, o := range logs { if o == "../" { if d

64. LeetCode - Binary Tree Postorder Traversal - Go | Owner: abh | Views: 28 | Comments: 0 | Open/ Source 446 B

/** * Definition for a binary tree node. * type TreeNode struct { * Val int * Left *TreeNode * Right *Tree

65. LeetCode - Baseball Game - Go | Owner: abh | Views: 33 | Comments: 0 | Open/ Source 1.25 KB

import "fmt" type Stack struct { values []int } func (stack *Stack) push(n int) { stack.values = append(stack.value

66. LeetCode - Number of Students Unable to Eat Lunch - Go | Owner: abh | Views: 31 | Comments: 0 | Open/ Source 576 B

func all_same(arr []int) bool { for _, v := range arr { if v != arr[0] { return false }

67. LeetCode - Binary Tree Inorder Traversal - Go | Owner: abh | Views: 25 | Comments: 0 | Open/ Source 439 B

/** * Definition for a binary tree node. * type TreeNode struct { * Val int * Left *TreeNode * Right *Tree

68. LeetCode - Make The String Great - Go | Owner: abh | Views: 39 | Comments: 0 | Open/ Source 400 B

func abs(n int) int { if n < 0 { return -n } return n } func makeGood(s string) string { var stac

69. LeetCode - Remove All Adjacent Duplicates In String - Go | Owner: abh | Views: 40 | Comments: 0 | Open/ Source 449 B

func removeDuplicates(s string) string { var stack []rune for _, c := range s { if len(stack) > 0 && stack[le

70. LeetCode - Reverse Prefix of Word - Go | Owner: abh | Views: 40 | Comments: 0 | Open/ Source 365 B

func reversePrefix(word string, ch byte) string { var stack []rune for _i, c := range word { stack = append(s

71. LeetCode - Binary Tree Preorder Traversal - Go | Owner: abh | Views: 25 | Comments: 0 | Open/ Source 120 B

https://leetcode.com/problems/binary-tree-preorder-traversal/submissions/1579203892/?envType=problem-list-v2&envId=stack

72. LeetCode - Remove Outermost Parentheses - Go | Owner: abh | Views: 56 | Comments: 0 | Open/ Source 638 B

func valid(stack []rune) bool { var _s []rune for _, p := range stack { if p == '(' { _s = appen

73. LeetCode - Set Mismatch - Go | Owner: abh | Views: 48 | Comments: 0 | Open/ Source 439 B

func count(target int, arr []int) int { var count int for _, n := range arr { if n == target { c

74. LeetCode - Divide Array Into Equal Pairs - Go | Owner: abh | Views: 45 | Comments: 0 | Open/ Source 348 B

func divideArray(nums []int) bool { pairs := make(map[int]int) for _, n := range nums { c, f := pairs[n]

75. LeetCode - Number of Lines To Write String - Go | Owner: abh | Views: 35 | Comments: 0 | Open/ Source 273 B

func numberOfLines(widths []int, s string) []int { var line, lw int line = 1 for _, c := range s { w :=

76. LeetCode - Apply Discount Every n Orders - Go | Owner: abh | Views: 27 | Comments: 0 | Open/ Source 1.09 KB

type Cashier struct { customers_done int n int discount int products []int prices []int } func Co

77. LeetCode - Maximum Sum of an Hourglass - Go | Owner: abh | Views: 23 | Comments: 0 | Open/ Source 493 B

func hg_sum(x int, y int, mat [][]int) int { var sum int sum += (mat[y-1][x-1] + mat[y-1][x] + mat[y+1][x-1]) sum

78. LeetCode - Unique Morse Code Words - Go | Owner: abh | Views: 41 | Comments: 0 | Open/ Source 804 B

func char_to_morse(char rune) string { codes := []string{ ".-","-...","-.-.","-..",".","..-.","--.", "...

79. LeetCode - Maximum Value of a String in an Array - Go | Owner: abh | Views: 43 | Comments: 0 | Open/ Source 541 B

func tpow(x int) int { p := 1 for ;x>1; x-- { p *= 10 } return p } func maximumValue(strs []strin

80. LeetCode - Intersection of Two Arrays - Go | Owner: abh | Views: 42 | Comments: 0 | Open/ Source 387 B

func contain(target int, arr []int) bool { for _, v := range arr { if v == target { return true

81. LeetCode - Search Insert Position - Go | Owner: abh | Views: 35 | Comments: 1 | Open/ Source 168 B

func searchInsert(nums []int, target int) int { for i, v := range nums { if target <= v { return i

82. LeetCode - Longest Strictly Increasing or Strictly Decreasing Subarray - Go | Owner: abh | Views: 41 | Comments: 0 | Open/ Source 524 B

func longestMonotonicSubarray(nums []int) int { l := 0 le := 0 ci := 0 for _, v := range nums { i

83. LeetCode - Contains Duplicate II - Go | Owner: abh | Views: 35 | Comments: 0 | Open/ Source 258 B

func containsNearbyDuplicate(nums []int, k int) bool { for i:=0; i<len(nums); i++ { for j:=1; j<=k && i+j<len(nums

84. LeetCode - Maximum Strong Pair XOR I - Go | Owner: abh | Views: 42 | Comments: 0 | Open/ Source 458 B

func abs(n int) int { if n < 0 { return n*-1 } return n } func maximumStrongPairXor(nums []int) int {

85. LeetCode - Find the Largest Almost Missing Integer - Go | Owner: abh | Views: 32 | Comments: 0 | Open/ Source 795 B

func contain(target int, array []int) bool { for _, v := range array { if v == target { return true

86. LeetCode - Number of Employees Who Met the Target - Go | Owner: abh | Views: 40 | Comments: 0 | Open/ Source 201 B

func numberOfEmployeesWhoMetTarget(hours []int, target int) int { var ans int for _, hour := range hours { if

87. LeetCode - Find Missing and Repeated Values - Go | Owner: abh | Views: 34 | Comments: 0 | Open/ Source 978 B

func sort(list []int) []int { for i:=0; i<len(list); i++ { for j:=i; j<len(list); j++ { if list[j] <

88. LeetCode - Strictly Palindromic Number - Go | Owner: abh | Views: 33 | Comments: 0 | Open/ Source 61 B

func isStrictlyPalindromic(n int) bool { return false }

89. LeetCode - Minimum Recolors to Get K Consecutive Black Blocks - Go | Owner: abh | Views: 47 | Comments: 0 | Open/ Source 314 B

func minimumRecolors(blocks string, k int) int { m := len(blocks) for i:=0; i<len(blocks)-k+1; i++ { c := 0

90. LeetCode - Faulty Keyboard - Go | Owner: abh | Views: 35 | Comments: 0 | Open/ Source 374 B

func reverse(s string) string { var rev string for i:=len(s)-1; i>=0; i-- { rev += string(s[i]) } r

91. LeetCode - Count Total Number of Colored Cells - Go | Owner: abh | Views: 36 | Comments: 0 | Open/ Source 209 B

func coloredCells(n int) int64 { var ans int for i:=1; i<=n; i++ { if i == 1 { ans += 1

92. LeetCode - Check if a String Is an Acronym of Words - Go | Owner: abh | Views: 33 | Comments: 0 | Open/ Source 235 B

func isAcronym(words []string, s string) bool { if len(words) != len(s) { return false } for i, c := ran

93. LeetCode - Spacial Array I - Go | Owner: abh | Views: 36 | Comments: 0 | Open/ Source 199 B

func isArraySpecial(nums []int) bool { for i:=0; i<len(nums)-1; i++ { f, s := nums[i]%2, nums[i+1]%2 if f

94. LeetCode - Transform Array by Parity - Go | Owner: abh | Views: 40 | Comments: 0 | Open/ Source 342 B

func transformArray(nums []int) []int { o, e := 0, 0 for _, n := range nums { if n%2==1 { o++

95. LeetCode - Root Equals Sum of Children - Go | Owner: abh | Views: 44 | Comments: 0 | Open/ Source 240 B

/** * Definition for a binary tree node. * type TreeNode struct { * Val int * Left *TreeNode * Right *Tree

96. LeetCode - Guess Number Higher or Lower - Go | Owner: abh | Views: 51 | Comments: 0 | Open/ Source 543 B

/** * Forward declaration of guess API. * @param num your guess * @return -1 if num is higher than the picked nu

97. LeetCode - Unique Number of Occurrences - Go | Owner: abh | Views: 37 | Comments: 0 | Open/ Source 630 B

func contain(target int, array []int) bool { for _, v := range array { if v == target { return true

98. LeetCode - Find the Difference of Two Arrays - Go | Owner: abh | Views: 33 | Comments: 0 | Open/ Source 660 B

func contain(target int, array []int) bool { for _, item := range array { if item == target { return

99. LeetCode - Find Pivot Index - Go | Owner: abh | Views: 41 | Comments: 0 | Open/ Source 263 B

func pivotIndex(nums []int) int { var sum int for _, n := range nums { sum += n } var ls int = 0

100. LeetCode - Defanging an IP Address - Go | Owner: abh | Views: 48 | Comments: 0 | Open/ Source 249 B

func defangIPaddr(address string) string { var defanged string for _, c := range address { if c == '.' {

101. LeetCode - Check If Digits Are Equal in String After Operations I - Go | Owner: abh | Views: 46 | Comments: 0 | Open/ Source 272 B

func hasSameDigits(s string) bool { for ;len(s)!=2; { var t string for i:=0; i<len(s)-1; i++ {

102. LeetCode - Move Zeros - Go | Owner: abh | Views: 40 | Comments: 0 | Open/ Source 247 B

func moveZeroes(nums []int) { for i, j := 0, 0; i<len(nums); i++ { for;j<len(nums)&&nums[j]==0;j++{} if

103. LeetCode - Find the Number of Good Pairs - Go | Owner: abh | Views: 44 | Comments: 0 | Open/ Source 254 B

func numberOfPairs(nums1 []int, nums2 []int, k int) int { var count int for _, i := range nums1 { for _, j :=

104. LeetCode - Merge Strings Alternately - Go | Owner: abh | Views: 42 | Comments: 0 | Open/ Source 374 B

func mergeAlternately(word1 string, word2 string) string { var merged string m := min(len(word1), len(word2)) for

105. LeetCode - Word Pattern - Go | Owner: abh | Views: 41 | Comments: 0 | Open/ Source 838 B

func wordPattern(pattern string, s string) bool { var words []string mapping := make(map[rune]string) var lb int

106. LeetCode - Sum of Values at Indices With K Set Bits - Go | Owner: abh | Views: 42 | Comments: 0 | Open/ Source 381 B

func count_set_bit(n int) int { var count int for ;n>0; { if n % 2 == 1 { n-- count

107. LeetCode - Sum of Good Numbers - Go | Owner: abh | Views: 57 | Comments: 0 | Open/ Source 450 B

func sumOfGoodNumbers(nums []int, k int) int { var sum int for i, _ := range nums { var good bool = true

108. LeetCode - Two Out of Three - Go | Owner: abh | Views: 41 | Comments: 0 | Open/ Source 829 B

func contain(nums []int, target int) bool { for _, n := range nums { if n == target { return true

109. LeetCode - Hash Divided String - Go | Owner: abh | Views: 37 | Comments: 0 | Open/ Source 422 B

func stringHash(s string, k int) string { var result string var chunk string for _, c := range s { chunk

110. LeetCode - Sort the Students by Their Kth Score - Go | Owner: abh | Views: 48 | Comments: 0 | Open/ Source 281 B

func sortTheStudents(score [][]int, k int) [][]int { for i:=0; i<len(score); i++ { for j:=i; j<len(score); j++ {

111. LeetCode - Create Hello World Function - JavaScript | Owner: abh | Views: 27 | Comments: 0 | Open/ Source 219 B

/** * @return {Function} */ var createHelloWorld = function() { return function(...args) { return "Hello

112. LeetCode - Display the First Three Rows - Python | Owner: abh | Views: 35 | Comments: 0 | Open/ Source 110 B

import pandas as pd def selectFirstRows(employees: pd.DataFrame) -> pd.DataFrame: return employees[:3]

113. LeetCode - Check Distances Between Same Letters - Python | Owner: abh | Views: 44 | Comments: 0 | Open/ Source 235 B

class Solution: def checkDistances(self, s: str, distance: List[int]) -> bool: for l in sorted(set(s)):

114. LeetCode - Permutations II - Python | Owner: abh | Views: 51 | Comments: 0 | Open/ Source 686 B

class Solution: def permuteUnique(self, nums: List[int]) -> List[List[int]]: combs = [] if len(nums) == 1

115. LeetCode - Max Sum of a Pair With Equal Sum of Digits - Python | Owner: abh | Views: 54 | Comments: 0 | Open/ Source 704 B

class Solution: def digit_sum(self, num) -> int: s = 0 for d in str(num): s += int(d)

116. LeetCode - Count Elements With Maximum Frequency - Python | Owner: abh | Views: 46 | Comments: 0 | Open/ Source 348 B

class Solution: def maxFrequencyElements(self, nums: List[int]) -> int: freq = {} h = 0 for n in

117. LeetCode - Find Center of Star Graph - Python | Owner: abh | Views: 50 | Comments: 0 | Open/ Source 409 B

class Solution: def findCenter(self, edges: List[List[int]]) -> int: flat = set() for l in edges[:3]:

118. LeetCode - Remove All Occurrences of a Substring - Python | Owner: abh | Views: 36 | Comments: 0 | Open/ Source 181 B

class Solution: def removeOccurrences(self, s: str, part: str) -> str: while part in s: s = s.replace

119. LeetCode - Truncate Sentence - Python | Owner: abh | Views: 52 | Comments: 0 | Open/ Source 68 B

class Solution:truncateSentence=lambda _,s,k:" ".join(s.split()[:k])

120. LeetCode - Remove Duplicates from Sorted Array - Go | Owner: abh | Views: 45 | Comments: 0 | Open/ Source 279 B

func removeDuplicates(nums []int) int { l := len(nums) for i:=0; i<l-1; i++ { if nums[i] == nums[i+1] {

121. LeetCode - Divide an Array Into Subarrays With Minimum Cost I - Python | Owner: abh | Views: 50 | Comments: 0 | Open/ Source 211 B

class Solution: def minimumCost(self, nums: List[int]) -> int: c = nums[0] nums = nums[1:] s = m

122. Execute!! | Owner: abh | Views: 76 | Comments: 0 | Open/ Source 208 B

s = 'Zft!zpv!dbo!fyfdvuf!opx"\x0b\x0bDvssfoumz!mjnjufe!up!gfx!mbohvbhft-!tvqqpsu!gps!npsf!mbohvbhft!xjmm!cf!beefe\x0bbmtf!offe!u

123. LeetCode - Count Largest Group - Python | Owner: abh | Views: 55 | Comments: 0 | Open/ Source 526 B

class Solution: def countLargestGroup(self, n: int) -> int: groups = {} l = 0 for i in range(1,

124. LeetCode - Longest Common Prefix - Python | Owner: abh | Views: 53 | Comments: 0 | Open/ Source 477 B

class Solution: def longestCommonPrefix(self, strs: List[str]) -> str: p = "" i = 0 while True:

125. LeetCode - Clear Digits - Python | Owner: abh | Views: 50 | Comments: 0 | Open/ Source 574 B

class Solution: def clearDigits(self, s: str) -> str: ns = "01234567890" s = list(s[::-1]) tl =

126. LeetCode - Running Sum of 1d Array - Go | Owner: abh | Views: 57 | Comments: 0 | Open/ Source 197 B

func runningSum(nums []int) []int { var sum int var sumarray []int for _, n := range nums { sum += n

127. LeetCode - Count the Digits That Divide a Number - Python | Owner: abh | Views: 49 | Comments: 0 | Open/ Source 140 B

class Solution: def countDigits(self, num: int) -> int: return len(list(filter(lambda n:not num%n,[int(n)for n in

128. LeetCode - Excel Sheet Column Title - Go | Owner: abh | Views: 52 | Comments: 0 | Open/ Source 383 B

func convertToTitle(columnNumber int) string { var bs []int for ;columnNumber!=0; { d := columnNumber%26

129. LeetCode - Check if Array Is Sorted and Rotated - Python | Owner: abh | Views: 54 | Comments: 0 | Open/ Source 462 B

class Solution: def check(self, nums: List[int]) -> bool: if len(nums) == 1: return True s =

130. Dudidam Mambo | Owner: abh | Views: 83 | Comments: 0 | Open/ Source 247.73 KB

131. LeetCode - Minimum Average of Smallest and Largest Elements - Python | Owner: abh | Views: 56 | Comments: 0 | Open/ Source 269 B

class Solution: def minimumAverage(self, nums: List[int]) -> float: avgs = [] while nums: s,

132. LeetCode - Reverse Bits - Go | Owner: abh | Views: 51 | Comments: 0 | Open/ Source 521 B

func uint32_to_bin_s(n uint32) string { var b string for ;n!=0; { if n%2==1 { n-- b

133. LeetCode - Number of 1 Bits - Go | Owner: abh | Views: 69 | Comments: 0 | Open/ Source 192 B

func hammingWeight(n int) int { var w int for ;n!=0; { if n%2==1 { w++ n--

134. LeetCode - Find the Encrypted String - Python | Owner: abh | Views: 50 | Comments: 0 | Open/ Source 139 B

class Solution: def getEncryptedString(self, s: str, k: int) -> str: return "".join([s[(i+k)%len(s)] for i in rang

135. LeetCode - Hand of Straights - Python | Owner: abh | Views: 49 | Comments: 0 | Open/ Source 410 B

class Solution: def isNStraightHand(self, hand: List[int], groupSize: int) -> bool: if len(hand) % groupSize != 0:

136. LeetCode - Max Consecutive Ones - Go | Owner: abh | Views: 41 | Comments: 0 | Open/ Source 264 B

func findMaxConsecutiveOnes(nums []int) int { m := 0 cc := 0 for _, n := range nums { if n != 1 {

137. LeetCode - Max Consecutive Ones - Python | Owner: abh | Views: 44 | Comments: 0 | Open/ Source 294 B

class Solution: def findMaxConsecutiveOnes(self, nums: List[int]) -> int: m = 0 cc = 0 for n in

138. LeetCode - Valid Word - Python | Owner: abh | Views: 50 | Comments: 0 | Open/ Source 244 B

class Solution: def isValid(self, w: str, vo="aoeuiAOEUI", co="pyfgcrldhtnsqjkxbmwvzPYFGCRLDHTNSQJKXBMWVZ", n="7531902468")

139. LeetCode - Find N Unique Integers Sum up to Zero - Go | Owner: abh | Views: 53 | Comments: 0 | Open/ Source 220 B

func sumZero(n int) []int { var ans []int if n%2==1 { ans = append(ans, 0) } for i:=1;len(ans)!=n;i

140. LeetCode - Counting Bits - Go | Owner: abh | Views: 54 | Comments: 0 | Open/ Source 303 B

func one_count(n int) int { var count int for ;n!=0; { if n%2==1 { count++ } n

141. LeetCode - Valid Anagram - Python | Owner: abh | Views: 55 | Comments: 0 | Open/ Source 104 B

class Solution: def isAnagram(self, s: str, t: str) -> bool: return sorted(s) == sorted(t)

142. LeetCode - Two Sum II - Input Array Is Sorted - Go | Owner: abh | Views: 49 | Comments: 0 | Open/ Source 486 B

func twoSum(numbers []int, target int) []int { var last_i int for i:=0;i<len(numbers)-1;i++ { if i!=0 && last

143. LeetCode - Two Sum II - Input Array Is Sorted - Python | Owner: abh | Views: 46 | Comments: 0 | Open/ Source 472 B

class Solution: def twoSum(self, numbers: List[int], target: int) -> List[int]: last_i = None for i in ra

144. LeetCode - Reverse Integer - Python | Owner: abh | Views: 63 | Comments: 0 | Open/ Source 332 B

class Solution: def reverse(self, x): if x < 0: n = -1; x = x * (-1) else: n = 1 r = 0

145. LeetCode - Reverse Integer - Go | Owner: abh | Views: 68 | Comments: 1 | Open/ Source 750 B

func int_to_str(n int) string { s := "" if n < 0 { s += "-" n *= -1 } for ;n!=0; {

146. Snake Game in Go lang | Owner: abh | Views: 88 | Comments: 0 | Open/ Source 5.16 KB

// Snake game package main import ( "fmt" "math/rand" "time" "github.com/eiannone/keyboard" "strconv" ) t

147. go.mod | Owner: abh | Views: 36 | Comments: 0 | Open/ Source 198 B

148. go.sum | Owner: abh | Views: 34 | Comments: 0 | Open/ Source 438 B

149. LeetCode - Keep Multiplying Found Values by Two - Go | Owner: abh | Views: 58 | Comments: 0 | Open/ Source 462 B

func findFinalValue(nums []int, original int) int { for ;true; { f := false for _, n := range nums {

150. LeetCode - Hamming Distance - Go | Owner: abh | Views: 55 | Comments: 0 | Open/ Source 803 B

func int_to_binary(n int) string { var b string = "" for ;n!=0; { if n % 2 == 0 { b = "0" + b

151. First Fortran Program | Owner: abh | Views: 55 | Comments: 0 | Open/ Source 55 B

program test print '(A)', "hi" end program test

152. LeetCode - Sum of Unique Elements - Go | Owner: abh | Views: 67 | Comments: 0 | Open/ Source 461 B

func sumOfUnique(nums []int) int { var sum int = 0; for i := 0; i < len(nums); i++ { var u bool = true

153. Hello World in Golang | Owner: abh | Views: 97 | Comments: 1 | Open/ Source 96 B

// hellow world package main import ("fmt") func main() { fmt.Println("woring ?") }

154. LeetCode - Reverse String - Python | Owner: abh | Views: 48 | Comments: 0 | Open/ Source 231 B

class Solution: def reverseString(self, s: List[str]) -> None: """ Do not return anything, modify s in-pl

155. LeetCode - Permutations - Python | Owner: abh | Views: 94 | Comments: 0 | Open/ Source 368 B

class Solution: def permute(self, nums: List[int]) -> List[List[int]]: if len(nums) == 1: return [[nums[0]]]

156. LeetCode - Valid Palindrome - Python | Owner: abh | Views: 86 | Comments: 0 | Open/ Source 189 B

class Solution: def isPalindrome(self, s: str) -> bool: fls = "".join([c for c in s.lower() if c in "pyfgcrlaoeuid

157. LeetCode - Merge k Sorted Lists - Python | Owner: abh | Views: 57 | Comments: 0 | Open/ Source 880 B

# Definition for singly-linked list. # class ListNode: # def __init__(self, val=0, next=None): # self.val = val

158. LeetCode - Single Number - Python | Owner: abh | Views: 60 | Comments: 0 | Open/ Source 128 B

class Solution: def singleNumber(self, nums: List[int]) -> int: return sorted(nums, key=lambda e:nums.count(e))[0]

159. LeetCode - Merge Two Sorted Lists - Python | Owner: abh | Views: 77 | Comments: 0 | Open/ Source 1.01 KB

# Definition for singly-linked list. # class ListNode: # def __init__(self, val=0, next=None): # self.val = val

160. LeetCode - Print FooBar Alternately - Python | Owner: abh | Views: 54 | Comments: 0 | Open/ Source 728 B

from time import sleep class FooBar: def __init__(self, n): self.n = n self.next = "foo" def

161. LeetCode - Print in Order - Python | Owner: abh | Views: 62 | Comments: 0 | Open/ Source 867 B

from time import sleep class Foo: def __init__(self): self.last_print = 0 def first(self, printFirst:

162. LeetCode - Validate IP Address - Python | Owner: abh | Views: 53 | Comments: 0 | Open/ Source 1.07 KB

class Solution: def validIPAddress(self, queryIP: str) -> str: if "." in queryIP: try:

163. LeetCode - Construct K Palindrome Strings - Python | Owner: abh | Views: 57 | Comments: 0 | Open/ Source 307 B

class Solution: def canConstruct(self, s: str, k: int) -> bool: if len(s) < k: return False m = {}

164. LeetCode - String Matching in an Array - Python | Owner: abh | Views: 80 | Comments: 0 | Open/ Source 341 B

class Solution: def stringMatching(self, words: List[str]) -> List[str]: ans = [] for word in words:

165. LeetCode - Add Two Numbers - Python | Owner: abh | Views: 64 | Comments: 1 | Open/ Source 902 B

# Definition for singly-linked list. # class ListNode: # def __init__(self, val=0, next=None): # self.val = val

166. LeetCode - Words Subsets - Python | Owner: abh | Views: 0 | Comments: 0 | Open/ Source 492 B

class Solution: def wordSubsets(self, words1: List[str], words2: List[str]) -> List[str]: uniwords = [] f

167. LeetCode - Number of Even and Odd Bits - Python | Owner: abh | Views: 54 | Comments: 0 | Open/ Source 305 B

class Solution: def evenOddBit(self, n: int) -> List[int]: ans = [0, 0] for i, v in enumerate(bin(n)[2:][

168. LeetCode - Remove Element - Python | Owner: abh | Views: 60 | Comments: 0 | Open/ Source 163 B

class Solution: def removeElement(self, nums: List[int], val: int) -> int: while val in nums: nums.re

169. LeetCode - Counting Words With a Given Prefix - Python | Owner: abh | Views: 62 | Comments: 0 | Open/ Source 149 B

class Solution: def prefixCount(self, words: List[str], pref: str) -> int: return len(list(filter(lambda e:e.start

170. LeetCode - Kth Largest Element in a Stream - Python | Owner: abh | Views: 62 | Comments: 0 | Open/ Source 711 B

class KthLargest: def __init__(self, k: int, nums: List[int]): self.values = sorted(nums) self.k = k

171. LeetCode - Valid Parentheses - Python | Owner: abh | Views: 88 | Comments: 0 | Open/ Source 467 B

class Solution: def isValid(self, s: str) -> bool: stack = [] m = { ')': '(', '

172. LeetCode - Count Prefix and Suffix Pairs I - Python | Owner: abh | Views: 93 | Comments: 0 | Open/ Source 407 B

class Solution: def isPrefixAndSuffix(self, str1: str, str2: str): return str2.startswith(str1) and str2.endswith(

173. LeetCode - Kids With the Greatest Number of Candies - Python | Owner: abh | Views: 62 | Comments: 0 | Open/ Source 168 B

class Solution: def kidsWithCandies(self, candies: List[int], extraCandies: int) -> List[bool]: return [c + extraC

174. LeetCode - Convert Date to Binary - Python | Owner: abh | Views: 63 | Comments: 0 | Open/ Source 138 B

class Solution: def convertDateToBinary(self, date: str) -> str: return "-".join([bin(int(e))[2:] for e in date.sp

175. LeetCode - Sorting the Sentence - Python | Owner: abh | Views: 94 | Comments: 0 | Open/ Source 146 B

class Solution: def sortSentence(self, s: str) -> str: return " ".join([w[:-1] for w in sorted(s.split(), key=lamb

176. LeetCode - Find the Index of the First Occurrence in a String - Python | Owner: abh | Views: 72 | Comments: 0 | Open/ Source 153 B

class Solution: def findKthNumber(self, n: int, k: int) -> int: l = sorted(map(lambda e:str(e), range(1, n+1)))

177. LUKA_SP.png | Owner: abh | Views: 130 | Comments: 0 | Open/ Source 113.35 KB

178. LeetCode - Number of Segments in a String - Python | Owner: abh | Views: 67 | Comments: 0 | Open/ Source 289 B

class Solution: def countSegments(self, s: str) -> int: n = 0 f = True for c in s+" ":

179. LeetCode - Reformat Date - Python | Owner: abh | Views: 68 | Comments: 0 | Open/ Source 626 B

class Solution: def reformatDate(self, date: str) -> str: days = [ "1st", "2nd", "3rd", "4th", "5th",

180. LeetCode - Number of Ways to Split Array - Python | Owner: abh | Views: 126 | Comments: 0 | Open/ Source 300 B

class Solution: def waysToSplitArray(self, nums: List[int]) -> int: c = 0 ls = 0 rs = sum(nums)

181. LootCode - Letter Combinations of a Phone Number - Python | Owner: abh | Views: 73 | Comments: 0 | Open/ Source 626 B

class Solution: def letterCombinations(self, digits: str) -> List[str]: pad = { "2": "abc",

182. LeetCode - Maximum Score After Splitting a String - Python | Owner: abh | Views: 64 | Comments: 0 | Open/ Source 301 B

class Solution: def maxScore(self, s: str) -> int: maxscore = 0 for i in range(1, len(s)): l

183. LootCode - Minimum Bit Flips to Convert Number - Python | Owner: abh | Views: 67 | Comments: 0 | Open/ Source 315 B

class Solution: def minBitFlips(self, start: int, goal: int) -> int: bb = len(bin(max([start, goal]))) - 2

184. LeetCode - Shuffle an Array - Python | Owner: abh | Views: 74 | Comments: 0 | Open/ Source 495 B

from random import shuffle class Solution: def __init__(self, nums: List[int]): self.list = nums sel

185. LeetCode - Number Complement - Python | Owner: abh | Views: 64 | Comments: 0 | Open/ Source 214 B

class Solution: def findComplement(self, num: int) -> int: b = bin(num)[2:] b = b.replace("0", "2")

186. LeetCode - Apply Operations to an Array - Python | Owner: abh | Views: 77 | Comments: 0 | Open/ Source 285 B

class Solution: def applyOperations(self, nums: List[int]) -> List[int]: for i in range(len(nums)-1):

187. LeetCode - Count the Number of Consistent Strings - Python | Owner: abh | Views: 121 | Comments: 0 | Open/ Source 164 B

class Solution: def countConsistentStrings(self, allowed: str, words: List[str]) -> int: return len(list(filter(la

188. LeetCode - Sort Array by Increasing Frequency - Python | Owner: abh | Views: 95 | Comments: 0 | Open/ Source 465 B

class Solution: def frequencySort(self, nums: List[int]) -> List[int]: freq = [] for n in set(nums):

189. LeetCode - Kth Distinct String in an Array - Python | Owner: abh | Views: 74 | Comments: 0 | Open/ Source 335 B

class Solution: def kthDistinct(self, arr: List[str], k: int) -> str: distinct = [] for c in arr:

190. LeetCode - Sort the People - Python | Owner: abh | Views: 98 | Comments: 0 | Open/ Source 174 B

class Solution: def sortPeople(self, names: List[str], heights: List[int]) -> List[str]: return [names[heights.ind

191. LeetCode - Make Two Arrays Equal by Reversing Subarrays - Python | Owner: abh | Views: 77 | Comments: 0 | Open/ Source 131 B

class Solution: def canBeEqual(self, target: List[int], arr: List[int]) -> bool: return sorted(target) == sorted(a

192. LeetCode - Uncommon Words from Two Sentences - Python | Owner: abh | Views: 63 | Comments: 0 | Open/ Source 446 B

class Solution: def uncommonFromSentences(self, s1: str, s2: str) -> List[str]: uncommon_words = [] s1 =

193. LeetCode - Circular Sentence - Python | Owner: abh | Views: 92 | Comments: 0 | Open/ Source 333 B

class Solution: def isCircularSentence(self, sentence: str) -> bool: sentence = sentence.split(" ") if se

194. LeetCode - Check if All Characters Have Equal Number of Occurrences - Python | Owner: abh | Views: 118 | Comments: 0 | Open/ Source 206 B

class Solution: def areOccurrencesEqual(self, s: str) -> bool: fa = s.count(s[0]) for c in set(s):

195. LeetCode - Sum of Digits of String After Convert - Python | Owner: abh | Views: 74 | Comments: 0 | Open/ Source 283 B

class Solution: def getLucky(self, s: str, k: int) -> int: n = "" for c in s: n += str(ord(c

196. LeetCode - Number of Senior Citizens - Python | Owner: abh | Views: 106 | Comments: 0 | Open/ Source 155 B

class Solution: def countSeniors(self, details: List[str]) -> int: return len(list(filter(lambda p: p>60, [int(p[1

197. LeetCode - Reverse Odd Levels of Binary Tree - Python | Owner: abh | Views: 152 | Comments: 0 | Open/ Source 1.07 KB

# Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self

198. LeetCode - Minimum String Length After Removing Substrings - Python | Owner: abh | Views: 85 | Comments: 0 | Open/ Source 192 B

class Solution: def minLength(self, s: str) -> int: while "AB" in s or "CD" in s: s = s.replace("AB",

199. LeetCode - Delete Characters to Make Fancy String - Python | Owner: abh | Views: 75 | Comments: 0 | Open/ Source 176 B

class Solution: def makeFancyString(self, s: str) -> str: for c in set(s): while c*3 in s:

200. LeetCode - Find the Maximum Achievable Number - Python | Owner: abh | Views: 74 | Comments: 0 | Open/ Source 106 B

class Solution: def theMaximumAchievableX(self, num: int, t: int) -> int: return num + (t*2)

201. LootCode - Score of a String - Python | Owner: abh | Views: 82 | Comments: 0 | Open/ Source 269 B

class Solution: def scoreOfString(self, s: str) -> int: values = [] for c in s: values.appen

202. LeetCode - Check If N and Its Double Exist - Python | Owner: abh | Views: 81 | Comments: 0 | Open/ Source 297 B

class Solution: def checkIfExist(self, arr: List[int]) -> bool: for i in range(len(arr)): for j in ra

203. LeetCode - Final Prices With a Special Discount in a Shop - Python | Owner: abh | Views: 92 | Comments: 0 | Open/ Source 300 B

class Solution: def finalPrices(self, prices: List[int]) -> List[int]: for i in range(len(prices)-1):

204. LeetCode - Lemonade Change - Python | Owner: abh | Views: 117 | Comments: 0 | Open/ Source 744 B

class Solution: def lemonadeChange(self, bills: List[int]) -> bool: galla = [] for bill in bills:

205. LeeCode - Rotate String - Python | Owner: abh | Views: 105 | Comments: 0 | Open/ Source 234 B

class Solution: def rotateString(self, s: str, goal: str) -> bool: for _ in range(len(s)): s = s[1:]

206. LeetCode - Final Array State After K Multiplication Operations I - Python | Owner: abh | Views: 70 | Comments: 0 | Open/ Source 316 B

class Solution: def getFinalState(self, nums: List[int], k: int, multiplier: int) -> List[int]: for _ in range(k):

207. LeetCode - Random Pick Index - Python | Owner: abh | Views: 77 | Comments: 0 | Open/ Source 438 B

from random import choice class Solution: def __init__(self, nums: List[int]): self.nums = nums def pi

208. LeetCode - Linked List Random Node - Python | Owner: abh | Views: 76 | Comments: 0 | Open/ Source 920 B

# Definition for singly-linked list. # class ListNode: # def __init__(self, val=0, next=None): # self.val = val

209. LeetCode - Check If a Word Occurs As a Prefix of Any Word in a Sentence - Python | Owner: abh | Views: 100 | Comments: 0 | Open/ Source 251 B

class Solution: def isPrefixOfWord(self, sentence: str, searchWord: str) -> int: for word in sentence.split(" "):

210. LeetCode - Majority Element - Python | Owner: abh | Views: 93 | Comments: 0 | Open/ Source 191 B

class Solution: def majorityElement(self, nums: List[int]) -> int: f = int(len(nums)/2) for n in set(nums

211. LeetCode - Take Gifts From the Richest Pile - Python | Owner: abh | Views: 107 | Comments: 0 | Open/ Source 208 B

class Solution: def pickGifts(self, gifts: List[int], k: int) -> int: for _ in range(k): m = max(gift

212. AI_Megpoid_GUMI_transparent.png | Owner: abh | Views: 1241 | Comments: 0 | Open/ Source 155.96 KB

213. kyu-nahi-ja-rahe-bunk-pe.png | Owner: abh | Views: 100 | Comments: 0 | Open/ Source 181.16 KB

214. Bunk pr chaloge? | Owner: abh | Views: 387 | Comments: 0 | Open/ Source 3.24 KB

<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8"> <meta name="viewport" content="width=device-width, in

215. setup.bat | Owner: abh | Views: 77 | Comments: 0 | Open/ Source 2.32 KB

@ECHO OFF REM.-- Prepare the Command Processor SETLOCAL ENABLEEXTENSIONS SETLOCAL ENABLEDELAYEDEXPANSION cd /d "%~dp0" ::

218. LeetCode | Reverse Vowels of a String | Python | Owner: abh | Views: 122 | Comments: 0 | Open/ Source 371 B

class Solution: def reverseVowels(self, s: str) -> str: rvs = "" for c in s[::-1]: if c in "

220. Heart in Box | Owner: abh | Views: 155 | Comments: 0 | Open/ Source 54.12 KB

frames = [ """

222. Flower For You | Owner: abh | Views: 580 | Comments: 0 | Open/ Source 31.69 KB

frames = [ """ :+*+=. .::::

223. Beauty Calculator | Owner: abh | Views: 237 | Comments: 0 | Open/ Source 5.22 KB

<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8"> <title>Calculating Your Beauty</title> <meta nam

224. LeetCode - Merge Sorted Array - Python | Owner: abh | Views: 140 | Comments: 0 | Open/ Source 337 B

class Solution: def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None: """ Do not r

225. LeetCode - Largest Positive Integer That Exists With Its Negative - Python | Owner: abh | Views: 167 | Comments: 0 | Open/ Source 274 B

class Solution: def findMaxK(self, nums: List[int]) -> int: nums.sort() l = -1 for n in nums:

227. is_divisible_by.py | Owner: abh | Views: 163 | Comments: 0 | Open/ Source 750 B

TESTCCASES = [ { "positional": (25, 5), "keyword": {}, "return": True, "msg": "", },

228. is_perfect_square.py | Owner: abh | Views: 588 | Comments: 0 | Open/ Source 926 B

TESTCASES = [ { "positional": (2,), "keyword": {}, "return": False, "msg": "", }, {

229. is_divisible_by.py | Owner: abh | Views: 625 | Comments: 0 | Open/ Source 115 B

def is_divisible_by(num, div): return num % div != 0 def is_divisible_by(num, div): return num / div == 0

230. divisors.py | Owner: abh | Views: 208 | Comments: 0 | Open/ Source 326 B

def divisors(n: int): ds = [] for i in range(1, n+1): if not n % i: ds.append(i) return ds def

231. is_perfect_square.py | Owner: abh | Views: 221 | Comments: 0 | Open/ Source 79 B

def is_perfect_square(n): sqrt = int(n ** 0.5) return sqrt * sqrt == n

232. triangle_number.py | Owner: abh | Views: 199 | Comments: 0 | Open/ Source 245 B

def triangle_number(n): t = 0 for i in range(1, n+1): t += i return t def triangle_number(n): return su

233. is_prime.py | Owner: abh | Views: 186 | Comments: 0 | Open/ Source 460 B

def is_prime(n): if n < 2: return False devisors = 0 for i in range(1, n+1): if n % i == 0:

234. you3.png | Owner: abh | Views: 107 | Comments: 0 | Open/ Source 22.93 KB

235. you2.png | Owner: abh | Views: 110 | Comments: 0 | Open/ Source 20.51 KB

236. you1.png | Owner: abh | Views: 146 | Comments: 0 | Open/ Source 15.11 KB

237. you.png | Owner: abh | Views: 108 | Comments: 0 | Open/ Source 18.06 KB

238. The Moon | Owner: abh | Views: 493 | Comments: 0 | Open/ Source 2.1 KB

<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8"> <title>The MOON</title> <meta name="viewport" co

239. 720p.png | Owner: abh | Views: 100 | Comments: 0 | Open/ Source 38.63 KB

240. 480p.png | Owner: abh | Views: 88 | Comments: 0 | Open/ Source 4.08 KB

241. 360p.png | Owner: abh | Views: 90 | Comments: 0 | Open/ Source 11.77 KB

242. 240p.png | Owner: abh | Views: 100 | Comments: 0 | Open/ Source 7.19 KB

243. 144p.png | Owner: abh | Views: 249 | Comments: 0 | Open/ Source 1.66 KB

244. 1080p.png | Owner: abh | Views: 150 | Comments: 0 | Open/ Source 438.61 KB

245. Auto Update Testing | Owner: abh | Views: 732 | Comments: 0 | Open/ Source 659 B

from textual.app import App from textual.containers import ScrollableContainer from textual.widget import Widget from threadi

246. LeetCode - Squares of a Sorted Array - Python | Owner: abh | Views: 211 | Comments: 0 | Open/ Source 129 B

class Solution: def sortedSquares(self, nums: List[int]) -> List[int]: return list(sorted(map(lambda a:a*a, nums))

247. LeetCode - Maximum Odd Binary Number - Python | Owner: abh | Views: 193 | Comments: 0 | Open/ Source 217 B

class Solution: def maximumOddBinaryNumber(self, s: str) -> str: if s.count("1") == 1: return ("0" *

248. TRX Manager | Owner: abh | Views: 189 | Comments: 0 | Open/ Source 5.1 KB

from datetime import date from os import system, listdir from sys import argv class Transaction: def __init__(self,

249. BrainF#ck Interpreter | Owner: abh | Views: 219 | Comments: 0 | Open/ Source 3.29 KB

#!/usr/bin/python from sys import argv from os import system def help(): print( "Usages: ./bf <op

250. ticket.py | Owner: abh | Views: 239 | Comments: 4 | Open/ Source 1.31 KB

from requests import get, post def get_token(): r = get("https://helpdesk.agrauniv.online/Home/NewTicket") html = r

251. is_consonant.py | Owner: abh | Views: 219 | Comments: 0 | Open/ Source 1007 B

TESTCASES = [ { "positional": ("H",), "keyword": {}, "return": True, "msg": "" }, {

252. is_isogram.py | Owner: abh | Views: 179 | Comments: 0 | Open/ Source 814 B

TESTCASES = [ { "positional": ("Hello",), "keyword": {}, "return": False, "msg": "" },

253. is_even.py | Owner: abh | Views: 172 | Comments: 0 | Open/ Source 959 B

TESTCASES = [ { "positional": (2,), "keyword": {}, "return": True, "msg": "", }, {

254. TESTS.py | Owner: abh | Views: 215 | Comments: 0 | Open/ Source 1.61 KB

class Test: def __init__(self, function): self.passed = 0 self.failed = 0 self.function = function

255. are_anagrams.py | Owner: abh | Views: 202 | Comments: 0 | Open/ Source 789 B

TESTCCASES = [ { "positional": ("string", "string",), "keyword": {}, "return": True, "msg":

256. func.py | Owner: abh | Views: 179 | Comments: 0 | Open/ Source 818 B

TESTCASES = [ { # test case structure "positional": ("arguments", "in", "tuples",), # Positional arguments as Tupl

257. __init__.py | Owner: abh | Views: 177 | Comments: 0 | Open/ Source 21 B

from .TESTS import *

258. is_consonant.py | Owner: abh | Views: 177 | Comments: 0 | Open/ Source 739 B

def is_consonant(char): consonants = [ "b", "c", "d", "f", "g", "h", "j", "k", "l", "m", "n", "p", "

259. is_vowel.py | Owner: abh | Views: 224 | Comments: 0 | Open/ Source 265 B

def is_vowel(char): vowels = ["a", "e", "i", "o", "u", "A", "E", "I", "O", "U"] return char in vowels def is_vowel(char

260. is_isogram.py | Owner: abh | Views: 221 | Comments: 0 | Open/ Source 190 B

def is_isogram(s): s = s.lower() for c in s: if s.count(c) > 1: return False return True def is

261. is_pangram.py | Owner: abh | Views: 206 | Comments: 0 | Open/ Source 279 B

def is_pangram(text): letters = "abcdefghijklmnopqrstuvwxyz" for char in text: if not char.lower() in letters:

262. are_anagrams.py | Owner: abh | Views: 320 | Comments: 0 | Open/ Source 345 B

def are_anagrams(s1, s2): if len(s1) != len(s2): return False for c in s1: if s1.count(c) != s2.count(c)

263. LeetCode - Insert Delete GetRandom O(1) - Duplicates allowed - Python | Owner: abh | Views: 201 | Comments: 0 | Open/ Source 686 B

from random import choice class RandomizedCollection: def __init__(self): self.values = [] def insert(se

264. LeetCode - Insert Delete GetRandom O(1) - Python | Owner: abh | Views: 249 | Comments: 0 | Open/ Source 679 B

from random import choice class RandomizedSet: def __init__(self): self.values = [] def insert(self, val

265. Asking for Going Out | Owner: abh | Views: 287 | Comments: 0 | Open/ Source 1004 B

<div id="main"> <h1>Momos khane chaloge ?</h1> <button id="yes" onclick="yes()"> Yes </button> <button id="no"

266. ankit.txt | Owner: abh | Views: 6 | Comments: 0 | Open/ Source 15 B

+91 70170 57629

267. conferm-delete.html | Owner: abh | Views: 231 | Comments: 0 | Open/ Source 466 B

<!--conferm-delete.html--> <h1>Do you really want to delete the file {{ file.name }} at {{ file.path }}?</h1> {% if file.type in

268. dashboard.html | Owner: abh | Views: 235 | Comments: 0 | Open/ Source 879 B

<!--dashboard.html--> <a href="/edit?filepathnew.html"><h4 style="display:inline-block;">Make new file</h4></a>&nbsp; <a href="/

269. user-files.html | Owner: abh | Views: 226 | Comments: 0 | Open/ Source 144 B

<!-- user-files.html --> {% for file in files %} {{ loop.index }}<a href=" {{ file.path }}">{{ file.name }}</a> {{ file.size }}<

270. media-edit.html | Owner: abh | Views: 199 | Comments: 0 | Open/ Source 1.1 KB

<!-- media-edit.html --> <form action="/action/edit-media" method="POST"> <input type="hidden" name="oldname" value="{{ path[ses

271. search-result.html | Owner: abh | Views: 226 | Comments: 0 | Open/ Source 775 B

<!-- search-result.html --> <form class="search-form" action="/search" method="GET" style="margin:20p;"> <input type="text" name

272. edit.html | Owner: abh | Views: 207 | Comments: 0 | Open/ Source 1001 B

<!-- edit.html --> <form action="/action/edit" method="POST"> <input type="text" name="path" value="{{ path }}" /> Mode: {% if

273. home.html | Owner: abh | Views: 233 | Comments: 0 | Open/ Source 629 B

<h1>HTMLify your dreams</h1> <center><p>Make your HTML files live</p> <form class="search-form" action="/search" method="GET" st

274. registration.html | Owner: abh | Views: 239 | Comments: 0 | Open/ Source 389 B

<!-- registration.html --> <form action="/action/registration" method="POST"> <input type="text" name="username" placeholder="us

275. file-upload.html | Owner: abh | Views: 234 | Comments: 0 | Open/ Source 258 B

<!-- file-uplaod.html --> <form action="/action/upload" method="POST" enctype="multipart/form-data"> <input type="file" name="fi

276. login.html | Owner: abh | Views: 246 | Comments: 0 | Open/ Source 221 B

<!-- login.html --> <form action="/action/login" method="POST"> <input type="text" name="username" placeholder="username" /><br>

277. conferm-delete.html | Owner: abh | Views: 220 | Comments: 0 | Open/ Source 530 B

<!--conferm-delete.html--> <h1>Do you really want to delete the file {{ file.name }} at {{ file.path }}?</h1> {% if file.type in

278. dashboard.html | Owner: abh | Views: 229 | Comments: 0 | Open/ Source 1.62 KB

<!DOCTYPE html> <html> <head> <title>Dashboard - {{ session["user"]["username"] }}</title> {% include "stylesheet.html"

279. nav-bar.html | Owner: abh | Views: 202 | Comments: 0 | Open/ Source 658 B

<div class="links"> <a href="/">Home</a> {% if not session.get("user") %} <a href="/login">Log in</a> <a href="/regist

280. git-clone.html | Owner: abh | Views: 230 | Comments: 0 | Open/ Source 1.51 KB

<!DOCTYPE html> <html> <head> <title>Git Clone</title> {% include 'stylesheet.html' %} <style> </style> </h

281. file-show.html | Owner: abh | Views: 208 | Comments: 0 | Open/ Source 3.91 KB

<!DOCTYPE html> <html> <head> <title>{{ file.name }}</title> {% include "stylesheet.html" %} <link rel="stylesheet"

282. locked-file.html | Owner: abh | Views: 226 | Comments: 0 | Open/ Source 505 B

<!DOCTYPE html> <html> <head> <title>File is locked</title> {% include "stylesheet.html" %} </head> <body> <h1>HTMLi

283. user-files.html | Owner: abh | Views: 264 | Comments: 0 | Open/ Source 144 B

<!-- user-files.html --> {% for file in files %} {{ loop.index }}<a href=" {{ file.path }}">{{ file.name }}</a> {{ file.size }}<

284. profile.html | Owner: abh | Views: 217 | Comments: 0 | Open/ Source 2.27 KB

<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8"> <meta name="viewport" content="width=device-width, initia

285. notifications.html | Owner: abh | Views: 200 | Comments: 0 | Open/ Source 947 B

<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8"> <meta name="viewport" content="width=device-width, initial-scale=

286. search-bar.html | Owner: abh | Views: 236 | Comments: 0 | Open/ Source 963 B

<div class="search-form"> <form action="/search" method="GET"> <input type="text" name="q" value="{{ q }}" placehold

287. media-edit.html | Owner: abh | Views: 213 | Comments: 0 | Open/ Source 1.75 KB

<!DOCTYPE html> <html> <head> <title>Editing - {{ path }}</title> {% include "stylesheet.html" %} </head> <body> <h1

288. search-result.html | Owner: abh | Views: 201 | Comments: 0 | Open/ Source 1.53 KB

<!-- search-result.html --> <!DOCTYPE html> <html> <head> <title>HTMLify Search - {{ q }}</title> {% include "stylesheet

289. extras.html | Owner: abh | Views: 201 | Comments: 0 | Open/ Source 98 B

<!-- Extras file, containts of this file will be available in all templates just above </head> -->

290. edit.html | Owner: abh | Views: 249 | Comments: 0 | Open/ Source 2.03 KB

<!DOCTYPE html> <html> <head> <title>Editing - {{ path }}</title> {% include "stylesheet.html" %} <link rel="styleshee

291. home.html | Owner: abh | Views: 206 | Comments: 0 | Open/ Source 1.59 KB

<!DOCTYPE html> <html> <head> <title>HTMLify your dreams</title> {% include "stylesheet.html" %} </head> <body> <h1>

292. registration.html | Owner: abh | Views: 265 | Comments: 0 | Open/ Source 944 B

<!DOCTYPE html> <html> <head> <title>Registration</title> {% include "stylesheet.html" %} <style> </style> </he

293. file-upload.html | Owner: abh | Views: 205 | Comments: 0 | Open/ Source 936 B

<!DOCTYPE html> <html> <head> <title>Media Upload</title> {% include "stylesheet.html" %} <style> </style> </hea

294. login.html | Owner: abh | Views: 221 | Comments: 0 | Open/ Source 769 B

<!DOCTYPE html> <html> <head> <title>Login</title> {% include "stylesheet.html" %} <style> </style> </head> <bo

295. stylesheet.html | Owner: abh | Views: 208 | Comments: 0 | Open/ Source 11.0 KB

<meta name="viewport" content="width=device-width, initial-scale=1"> <style> /* registration page style*/ .registration-form

296. requirements.txt | Owner: abh | Views: 169 | Comments: 0 | Open/ Source 54 B

flask flask_sqlalchemy flask_migrate requests pygments

297. models.py | Owner: abh | Views: 182 | Comments: 0 | Open/ Source 5.54 KB

from flask import request from flask_sqlalchemy import * from datetime import datetime from pygments import highlight, lexers, f

298. setup.py | Owner: abh | Views: 190 | Comments: 0 | Open/ Source 1020 B

from os import system from sys import version_info as ver ver = ver.major from random import randint try: from app import a

299. README.md | Owner: abh | Views: 241 | Comments: 2 | Open/ Source 10 B

# HTMLify

300. config.py | Owner: abh | Views: 183 | Comments: 0 | Open/ Source 159 B

SECRET_KEY="REPLACE_WITH_YOUR_SECRATE_KEY_OR_RUN_SETUP.PY" SESSION_TOKENS_LIMIT=1024 MAX_FILE_UPLOAD_LIMIT=32 GIT_COMMAND_PATH =

301. utils.py | Owner: abh | Views: 211 | Comments: 0 | Open/ Source 5.88 KB

from random import randint from requests import get from models import users, files, db from os import remove, system, path from

302. app.py | Owner: abh | Views: 216 | Comments: 0 | Open/ Source 24.99 KB

#HTMLify from flask import * from flask_migrate import * from random import randint, shuffle from hashlib import md5 from os im

303. LeetCod3 - Check if Array is Good - Python | Owner: abh | Views: 204 | Comments: 0 | Open/ Source 171 B

class Solution: def isGood(self, nums: List[int]) -> bool: nums.sort() good = list(range(1, len(nums))) +

304. LeetCode - Time Needed to Rearrange a Binary String - Python | Owner: abh | Views: 246 | Comments: 0 | Open/ Source 200 B

class Solution: def secondsToRemoveOccurrences(self, s: str) -> int: secs = 0 while "01" in s:

305. LeetCode - Number of Laser Beams in a Bank - C# | Owner: abh | Views: 270 | Comments: 1 | Open/ Source 525 B

public class Solution { public int NumberOfBeams(string[] bank) { int pre_lesers = 0; int beams = 0;

306. LeetCode - Number of Laser Beams in a Bank - Python | Owner: abh | Views: 211 | Comments: 0 | Open/ Source 322 B

class Solution: def numberOfBeams(self, bank: List[str]) -> int: beams = 0 pre_lesers = 0 for fl

307. word_frequency.py | Owner: abh | Views: 187 | Comments: 0 | Open/ Source 198 B

def word_frequency(text: str) -> dict: words = text.split() word_f = {} for word in words: w = word.strip(".

308. char_frequency.py | Owner: abh | Views: 201 | Comments: 0 | Open/ Source 113 B

def char_frequency(string): freq = {} for c in string: freq[c] = freq.get(c,0)+1 return freq

309. encrypt_xor_cipher.py | Owner: abh | Views: 218 | Comments: 0 | Open/ Source 130 B

def encrypt_xor_cipher(text, key): cipher = "" for char in text: cipher += chr(ord(char) ^ key) return ciphe

310. LeetCode - Convert an Array Into a 2D Array With Conditions - Python | Owner: abh | Views: 232 | Comments: 0 | Open/ Source 380 B

class Solution: def findMatrix(self, nums: List[int]) -> List[List[int]]: mat = [] for n in nums:

311. LeetCode - Assign Cookies - Python | Owner: abh | Views: 209 | Comments: 0 | Open/ Source 311 B

class Solution: def findContentChildren(self, g: List[int], s: List[int]) -> int: g.sort() s.sort()

312. T8QoUm3.png | Owner: abh | Views: 13 | Comments: 0 | Open/ Source 855.67 KB

313. gklpkg | Owner: abh | Views: 21 | Comments: 0 | Open/ Source 1.21 MB

314. Remove All Target from array with O(n) | Owner: abh | Views: 228 | Comments: 0 | Open/ Source 286 B

def remove_target(target, array): array = array.copy() ofset = 0 for i in range(len(array)): if array[i]

315. encrypt_caesar_cipher.py | Owner: abh | Views: 271 | Comments: 0 | Open/ Source 284 B

def encrypt_caesar_cipher(text, shift): cipher = "" for char in text: if char.isalpha(): offset = 65

316. yas.html | Owner: abh | Views: 352 | Comments: 0 | Open/ Source 686 B

<!--You are star--> <meta name="viewport" content="width=device-width, initial-scale=1.0"> <center> <div id="main"> <h1

317. encrypt_rot13.py | Owner: abh | Views: 251 | Comments: 0 | Open/ Source 266 B

def encrypt_rot13(text): cipher = "" for char in text: if char.isalpha(): offset = 65 if char.isuppe

318. ncr.py | Owner: abh | Views: 243 | Comments: 0 | Open/ Source 290 B

def ncr(n, r): numerator = 1 denominator = 1 for i in range(r): numerator *= n - i denominator *= i

319. gcd.py | Owner: abh | Views: 272 | Comments: 0 | Open/ Source 138 B

def gcd(a, b): if b == 0: return a return gcd(b, a % b) def gcd(a, b): while b: a, b = b, a % b

320. npr.py | Owner: abh | Views: 353 | Comments: 0 | Open/ Source 153 B

def npr(n, r): return factorial(n) // factorial(n-r) def npr(n, r): result = 1 for i in range(r): result *=

321. LeetCode - First Letter to Appear Twice - JavaScript | Owner: abh | Views: 130 | Comments: 0 | Open/ Source 241 B

/** * @param {string} s * @return {character} */ var repeatedCharacter = function(s) { seen = []; for (let i=0;

322. LeetCode - First Letter to Appear Twice - Python | Owner: abh | Views: 242 | Comments: 0 | Open/ Source 185 B

class Solution: def repeatedCharacter(self, s: str) -> str: seen = set() for c in s: if c in

323. LeetCode - Search a 2D Matrix - Python | Owner: abh | Views: 370 | Comments: 0 | Open/ Source 200 B

class Solution: def searchMatrix(self, matrix: List[List[int]], target: int) -> bool: for row in matrix:

324. LeetCode - Reverse Only Letters - Python | Owner: abh | Views: 256 | Comments: 0 | Open/ Source 393 B

class Solution: def reverseOnlyLetters(self, s: str) -> str: s = list(s) chars = "qwertyuiopasdfghjklzxcv

325. rbott.py | Owner: abh | Views: 249 | Comments: 0 | Open/ Source 2.05 KB

from random import randint from time import sleep class Grid: def __init__(self, bots = [].copy()): self.width

326. home-template.html | Owner: abh | Views: 301 | Comments: 0 | Open/ Source 3.79 KB

<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8"> <meta name="viewport" content="width=device-width,

327. HTMLify Logo (Transparent) | Owner: abh | Views: 98 | Comments: 0 | Open/ Source 14.02 KB

328. HTMLify Logo | Owner: abh | Views: 81 | Comments: 0 | Open/ Source 10.38 KB

329. LeetCode - Patients With a Condition - MySQL | Owner: abh | Views: 262 | Comments: 4 | Open/ Source 128 B

# Write your MySQL query statement below SELECT * FROM patients WHERE conditions LIKE '% DIAB1%' or conditions LIKE 'DIAB1%' ;

330. QyPGNW9.png | Owner: abh | Views: 1 | Comments: 0 | Open/ Source 751.25 KB

331. f5s02uC.png | Owner: abh | Views: 10 | Comments: 0 | Open/ Source 871.7 KB

332. HyrZYYc.png | Owner: abh | Views: 23 | Comments: 0 | Open/ Source 1.13 MB

333. GXZIvwU.png | Owner: abh | Views: 18 | Comments: 0 | Open/ Source 962.1 KB

334. Do you notice? | Owner: abh | Views: 184 | Comments: 3 | Open/ Source 35.92 KB

335. cbrt.py | Owner: abh | Views: 312 | Comments: 0 | Open/ Source 37 B

def cbrt(n): return n ** (1/3)

336. whr.py | Owner: abh | Views: 248 | Comments: 0 | Open/ Source 56 B

def whr(waist: "cm", hip: "cm"): return waist / hip

337. bmi.py | Owner: abh | Views: 259 | Comments: 0 | Open/ Source 68 B

def bmi(weight: "kg", height: "m"): return weight / height ** 2

338. LeetCode - Find Champion I - Python | Owner: abh | Views: 250 | Comments: 1 | Open/ Source 340 B

class Solution: def findChampion(self, grid: List[List[int]]) -> int: n = len(grid) strongerthancount = [

339. preview feature | Owner: abh | Views: 696 | Comments: 1 | Open/ Source 5.59 KB

<!DOCTYPE html> <html> <head> <title>Editing - updates/preview-feature.html</title> <meta name="viewport" content="wi

340. LeetCode - How Many Numbers Are Smaller Than the Current Number - Python | Owner: abh | Views: 240 | Comments: 0 | Open/ Source 256 B

class Solution: def smallerNumbersThanCurrent(self, nums: List[int]) -> List[int]: smallercount = [] sort

341. LeetCode - Separate the Digits in an Array - Python | Owner: abh | Views: 258 | Comments: 0 | Open/ Source 483 B

class Solution: def separateDigits(self, nums: List[int]) -> List[int]: saprated = [] for num in nums:

342. LeetCode - Chunk Array - JavaScript | Owner: abh | Views: 111 | Comments: 0 | Open/ Source 391 B

/** * @param {Array} arr * @param {number} size * @return {Array} */ var chunk = function(arr, size) { const chunk

343. LeetCode - Shuffle String - Python | Owner: abh | Views: 355 | Comments: 0 | Open/ Source 206 B

class Solution: def restoreString(self, s: str, indices: List[int]) -> str: shuffeld = "" for i in range(

344. LeetCode - Create Target Array in the Given Order - Python | Owner: abh | Views: 243 | Comments: 0 | Open/ Source 223 B

class Solution: def createTargetArray(self, nums: List[int], index: List[int]) -> List[int]: target = []

345. LeetCode - Matrix Diagonal Sum - Python | Owner: abh | Views: 235 | Comments: 0 | Open/ Source 282 B

class Solution: def diagonalSum(self, mat: List[List[int]]) -> int: i = 0 s = 0 if len(mat)%2:

346. LeetCode - Fibonacci Number - JavaScript | Owner: abh | Views: 124 | Comments: 1 | Open/ Source 309 B

/** * @param {number} n * @return {number} */ var fib = function(n) { if (n == 0) return 0; if (n == 1

347. LeetCode - Fibonacci Number - Rust | Owner: abh | Views: 271 | Comments: 1 | Open/ Source 354 B

impl Solution { pub fn fib(n: i32) -> i32 { if (n == 0){ return 0; } if (n == 1){

348. LeetCode - Fibonacci Number - Python | Owner: abh | Views: 283 | Comments: 0 | Open/ Source 256 B

class Solution: def fib(self, n: int) -> int: if n == 0: return 0 if n == 1: re

349. LeetCode - Add Two Integers - Scala | Owner: abh | Views: 275 | Comments: 1 | Open/ Source 100 B

object Solution { def sum(num1: Int, num2: Int): Int = { return num1 + num2; } }

350. LeetCode - Add Two Integers - Ruby | Owner: abh | Views: 315 | Comments: 1 | Open/ Source 119 B

# @param {Integer} num1 # @param {Integer} num2 # @return {Integer} def sum(num1, num2) return num1 + num2 end

351. LeetCode - Add Two Integers - Rust | Owner: abh | Views: 259 | Comments: 0 | Open/ Source 101 B

impl Solution { pub fn sum(num1: i32, num2: i32) -> i32 { return num1 + num2; } }

352. LeetCode - Add Two Integers - JavaScript | Owner: abh | Views: 143 | Comments: 0 | Open/ Source 142 B

/** * @param {number} num1 * @param {number} num2 * @return {number} */ var sum = function(num1, num2) { return nu

353. LeetCode - Add Two Integers - Python | Owner: abh | Views: 251 | Comments: 0 | Open/ Source 92 B

class Solution: def sum(self, num1: int, num2: int) -> int: return num1 + num2

354. Page Replacment Algotithems in Python | Owner: abh | Views: 296 | Comments: 2 | Open/ Source 452 B

# Page Replacment Smulator def FIFO(string: list["anything"], frames=3): page = [None]*frames pages = [] statu

355. tr_typist_4.png | Owner: abh | Views: 181 | Comments: 0 | Open/ Source 4.37 KB

356. tr_typist_1.png | Owner: abh | Views: 159 | Comments: 0 | Open/ Source 3.64 KB

357. tr_typist_2.png | Owner: abh | Views: 168 | Comments: 0 | Open/ Source 5.14 KB

358. tr_typist_3.png | Owner: abh | Views: 164 | Comments: 0 | Open/ Source 3.42 KB

359. tr_typist_5.png | Owner: abh | Views: 182 | Comments: 0 | Open/ Source 6.92 KB

360. tr_typist_6.png | Owner: abh | Views: 170 | Comments: 0 | Open/ Source 7.22 KB

361. LeetCode - Find Followers Count - MySQL | Owner: abh | Views: 261 | Comments: 0 | Open/ Source 103 B

SELECT user_id, count(follower_id) as followers_count FROM Followers GROUP BY user_id ORDER BY user_id;

362. LeetCode - Allow One Function Call - JavaScript | Owner: abh | Views: 130 | Comments: 0 | Open/ Source 415 B

/** * @param {Function} fn * @return {Function} */ var once = function(fn) { let called = false; return function(.

363. upper.py | Owner: abh | Views: 379 | Comments: 0 | Open/ Source 673 B

def upper(s: str) -> str: u = "QWERTYUIOPASDFGHJKLZXCVBNM" l = "qwertyuiopasdfghjklzxcvbnm" for c in s: if c

364. pow.py | Owner: abh | Views: 254 | Comments: 0 | Open/ Source 120 B

def pow(x, y: int): p = 1 while y: p *= x y -= 1 return p def pow(x, y): return x ** y

365. lcm.py | Owner: abh | Views: 298 | Comments: 0 | Open/ Source 408 B

def lcm(a: int, b: int) -> int: max = a if a > b else b while True: if not (max % a and max % b): re

366. sqrt.py | Owner: abh | Views: 237 | Comments: 0 | Open/ Source 507 B

def sqrt(n): return n ** 0.5 def sqrt(n): return n ** (1/2) def sqrt(n :int): i = 0 while i*i < n: i +

367. sum.py | Owner: abh | Views: 781 | Comments: 2 | Open/ Source 314 B

def sum(*nums): s = 0 for i in nums: s += i return s def sum(*nums: int): s = 0 for n in nums:

368. factorial.py | Owner: abh | Views: 225 | Comments: 0 | Open/ Source 232 B

#Calculate the factorial of given number def factorial(n: int) -> int: if n == 0: return 1 return factorial(n-1

369. mode.py | Owner: abh | Views: 297 | Comments: 0 | Open/ Source 331 B

def mode(numbers): if not numbers: return [] mode = [] max_count = 0 for num in numbers: count =

370. is_leap_year.py | Owner: abh | Views: 235 | Comments: 0 | Open/ Source 101 B

def is_leap_year(year): if not year % 100: return not year % 400 return not year % 4

371. is_palindrome.py | Owner: abh | Views: 224 | Comments: 0 | Open/ Source 606 B

#Check the given string, number or list is palindrome or not. def is_palindrome(n: int) -> bool: r = 0 t = n while

372. is_armstrong.py | Owner: abh | Views: 244 | Comments: 0 | Open/ Source 314 B

def is_armstrong(n: int): n = str(n) p = len(n) s = 0 for d in n: s += int(d)**p return int(n) == s

373. is_valid_email.py | Owner: abh | Views: 261 | Comments: 0 | Open/ Source 220 B

def is_valid_email(email): parts = email.split("@") if len(parts) == 2: username, domain = parts if user

374. lower.py | Owner: abh | Views: 249 | Comments: 0 | Open/ Source 672 B

def lower(s: str) -> str: u = "QWERTYUIOPASDFGHJKLZXCVBNM" l = "qwertyuiopasdfghjklzxcvbnm" for c in s: if c

375. README.md | Owner: abh | Views: 679 | Comments: 0 | Open/ Source 422 B

# ABHDEF This is a series of function which I started through my instagram account [@abh.py](https://www.instagram.com/abh.py) a

376. is_happy.py | Owner: abh | Views: 219 | Comments: 0 | Open/ Source 454 B

def is_happy(n: int): n = str(n) while len(n) != 1: s = 0 for d in n: s += int(d)*int(d)

377. mean.py | Owner: abh | Views: 225 | Comments: 0 | Open/ Source 303 B

def mean(*nums): s = 0 c = 0 for n in nums: s += n c += 1 return s / c def mean(nums): s =

378. average.py | Owner: abh | Views: 279 | Comments: 0 | Open/ Source 315 B

def average(*nums): s = 0 c = 0 for n in nums: s += n c += 1 return s / c def average(*nums):

379. digital_sum.py | Owner: abh | Views: 242 | Comments: 0 | Open/ Source 255 B

def digital_sum(n: int): s = 0 while n: s += n % 10 n //= 10 return s def digital_sum(n: int):

380. is_even.py | Owner: abh | Views: 295 | Comments: 0 | Open/ Source 290 B

def is_even(n: int) -> bool: if n == 1: return False if n == 0: return True return is_even(n-2) def

381. roman_to_int.py | Owner: abh | Views: 229 | Comments: 0 | Open/ Source 339 B

def roman_to_int(s): romans = {'I': 1, 'V': 5,'X': 10, 'L': 50, 'C': 100, 'D': 500, 'M': 1000} result = 0

382. len.py | Owner: abh | Views: 250 | Comments: 0 | Open/ Source 174 B

def len(obj) -> int: c = 0 while obj: c += 1 obj = obj[1:] return c def len(obj) -> int: c = 0

383. median.py | Owner: abh | Views: 244 | Comments: 0 | Open/ Source 288 B

def median(series): s = series.copy() s.sort() n = len(s) if n % 2 == 1: return s[n // 2] return (s[

384. is_odd.py | Owner: abh | Views: 629 | Comments: 0 | Open/ Source 285 B

def is_odd(n: int) -> bool: if n == 1: return True if n == 0: return False return is_odd(n-2) def i

385. LeetCode - Return Length of Arguments Passed - JavaScript | Owner: abh | Views: 157 | Comments: 0 | Open/ Source 208 B

/** * @param {...(null|boolean|number|string|Array|Object)} args * @return {number} */ var argumentsLength = function(...

386. LeetCode - Function Composition - JavaScript | Owner: abh | Views: 103 | Comments: 0 | Open/ Source 348 B

/** * @param {Function[]} functions * @return {Function} */ var compose = function(functions) { return functio

387. LeetCode - Counter II - JavaScript | Owner: abh | Views: 117 | Comments: 0 | Open/ Source 633 B

/** * @param {integer} init * @return { increment: Function, decrement: Function, reset: Function } */ var createCounter

388. LeetCode - Counter - JavaScript | Owner: abh | Views: 119 | Comments: 0 | Open/ Source 289 B

/** * @param {number} n * @return {Function} counter */ var createCounter = function(n) { let count = n; return

389. LeetCode - Create Hello World Function - JavaScript | Owner: abh | Views: 124 | Comments: 0 | Open/ Source 220 B

/** * @return {Function} */ var createHelloWorld = function() { return function(...args) { return "Hell

390. LeetCode - To Be Or Not To Be - JavaScript | Owner: abh | Views: 144 | Comments: 0 | Open/ Source 572 B

/** * @param {string} val * @return {Object} */ var expect = function(val) { return {"toBe": function (v

391. LeetCode - Article Views I - MySQL | Owner: abh | Views: 292 | Comments: 0 | Open/ Source 90 B

SELECT DISTINCT author_id AS id FROM Views WHERE author_id = viewer_id ORDER BY author_id;

392. LeetCode - Invalid Tweets - MySQL | Owner: abh | Views: 272 | Comments: 0 | Open/ Source 60 B

SELECT tweet_id FROM Tweets WHERE CHAR_LENGTH(content) > 15;

393. LeetCode - Recyclable and Low Fat Products - MySQL | Owner: abh | Views: 231 | Comments: 0 | Open/ Source 74 B

SELECT product_id FROM Products WHERE low_fats = 'Y' AND recyclable = 'Y';

394. LeetCode - Find Customer Referee - MySQL | Owner: abh | Views: 242 | Comments: 0 | Open/ Source 70 B

SELECT name FROM Customer WHERE referee_id != 2 OR referee_id IS NULL;

395. LeetCode - Big Countries | Owner: abh | Views: 259 | Comments: 0 | Open/ Source 89 B

SELECT name, population, area FROM world WHERE area >= 3000000 or population >= 25000000;

396. A Number After a Double Reversal | Owner: abh | Views: 131 | Comments: 0 | Open/ Source 179 B

/** * @param {number} num * @return {boolean} */ var isSameAfterReversals = function(num) { if (num) return

397. LeetCode - A Number After a Double Reversal - Rust | Owner: abh | Views: 267 | Comments: 0 | Open/ Source 203 B

impl Solution { pub fn is_same_after_reversals(num: i32) -> bool { if (num != 0){ return num % 10 !=

398. LeetCode- A Number After a Double Reversal - Python | Owner: abh | Views: 241 | Comments: 0 | Open/ Source 128 B

class Solution: def isSameAfterReversals(self, num: int) -> bool: if not num: return True return num % 10

399. jojo1.png | Owner: abh | Views: 147 | Comments: 0 | Open/ Source 0 B

400. portfolio/badges/gh_pullshark.png | Owner: abh | Views: 182 | Comments: 0 | Open/ Source 0 B

401. portfolio/badges/hr_python_level_1_stars_2.png | Owner: abh | Views: 182 | Comments: 0 | Open/ Source 0 B

402. portfolio/badges/hr_python_level_1_stars_1.png | Owner: abh | Views: 187 | Comments: 0 | Open/ Source 0 B

403. portfolio/badges/pe_award_03.png | Owner: abh | Views: 185 | Comments: 0 | Open/ Source 0 B

404. portfolio/badges/pe_award_02.png | Owner: abh | Views: 179 | Comments: 0 | Open/ Source 0 B

405. portfolio/badges/pe_award_01.png | Owner: abh | Views: 207 | Comments: 0 | Open/ Source 0 B

406. Achievements | Owner: abh | Views: 421 | Comments: 0 | Open/ Source 5.56 KB

<!DOCTYPE html> <html> <head> <title>Achievements - Aman Babu Hemant</title> <meta name="viewport" content="width=de

407. | Owner: abh | Views: 94 | Comments: 0 | Open/ Source 707 B

/* Reset some default browser styles */ body, h1, p, header, main, footer { margin: 0; padding: 0; } body {

408. [FIX] CSS ISSUE | Owner: abh | Views: 285 | Comments: 0 | Open/ Source 405 B

<!DOCTYPE html> <html> <head> <link rel="stylesheet" type="text/css" href="css-issue.css"> <title>CSS issue fixed</t

409. grklpkd.png | Owner: abh | Views: 31 | Comments: 0 | Open/ Source 0 B

410. vcbcgpt.py | Owner: abh | Views: 1 | Comments: 0 | Open/ Source 615 B

from moviepy.editor import VideoFileClip # Input video file and output compressed file input_file = 'input_video.mp4' outpu

411. Honey-Singh-2.jpg | Owner: abh | Views: 187 | Comments: 0 | Open/ Source 0 B

412. mods.txt | Owner: abh | Views: 601 | Comments: 0 | Open/ Source 1.77 KB

aiohttp aiosignal alembic android anyio argon2-cffi argon2-cffi-bindings asgiref astroid asttokens async-timeout attrs audiostre

413. Cartoonizer by Shru | Owner: abh | Views: 2 | Comments: 0 | Open/ Source 944 B

import cv2 cap = cv2.VideoCapture("dolphin.mp4") height = int(cap.get(cv2.CAP_PROP_FRAME_HEIGHT)) width = int(cap.get(cv2.C

414. No body loves you | Owner: abh | Views: 485 | Comments: 0 | Open/ Source 282 B

<head> <meta name="viewport" content="width=device-width, initial-scale=1"> </head> <title>Nobody loves you</title> <center>

415. LeetCode - Number of Good Pairs - Rust | Owner: abh | Views: 346 | Comments: 1 | Open/ Source 325 B

impl Solution { pub fn num_identical_pairs(nums: Vec<i32>) -> i32 { let mut count = 0; for i in 0..nums.l

416. qcfc.py | Owner: abh | Views: 346 | Comments: 2 | Open/ Source 2.36 KB

#quiz ans cheker for college #07/10/2023 def ans(): return open("ans.txt").read().split("\n")[:-1] def std(no):

417. lklb.png | Owner: abh | Views: 11 | Comments: 0 | Open/ Source 0 B

418. gklg.png | Owner: abh | Views: 7 | Comments: 0 | Open/ Source 0 B

419. artizote.png | Owner: abh | Views: 125 | Comments: 0 | Open/ Source 0 B

420. profile-page-template.html | Owner: abh | Views: 268 | Comments: 0 | Open/ Source 1.35 KB

<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8"> <meta name="viewport" content="width=device-width, in

421. dp-dark.png | Owner: abh | Views: 120 | Comments: 0 | Open/ Source 0 B

422. gklp.png | Owner: abh | Views: 11 | Comments: 0 | Open/ Source 0 B

423. artizote.apk | Owner: abh | Views: 158 | Comments: 0 | Open/ Source 0 B

424. Mitigate port scanning.py | Owner: abh | Views: 277 | Comments: 1 | Open/ Source 1.1 KB

import subprocess import re import collections import time # Configurações log_file = '/var/log/syslog' threshold = 4 b

425. post.html | Owner: abh | Views: 287 | Comments: 0 | Open/ Source 4.83 KB

<!-- post.html --> {% extends "base.html" %} {% block title %}{{ post.title }}{% endblock %} {% block meta %}{{ post.meta }}{

426. home.html | Owner: abh | Views: 289 | Comments: 0 | Open/ Source 881 B

b'<!DOCTYPE html>\n<html>\n<head>\n <title>HTMLify your dreams</title>\n {% include "stylesheet.html" %}\n</head>\n<body>\

427. welcome.html | Owner: abh | Views: 398 | Comments: 0 | Open/ Source 499 B

<h1>Welcome to HTMLify</h1> <p>Here you can share you codes :)<br>And HTML can be parse so you can make your static site here

428. 01sqjlpevg | Owner: abh | Views: 190 | Comments: 0 | Open/ Source 12 B