>>HeavyCoders

PlaceNameGitHub
  • 1

    Aditya Raj Bhagat

  • 2

    thecoderash

  • 3

    Ishan Purohit

  • 4

    Rony

  • 5

    Hans Pattnaik

>>Latest Merged Pull Requests

PlaceNamePull
  • 1

    UI change

  • 2

    Refactor

  • 3

    Updated Readme.md

  • 4

    DELETED: Create Rohan-2107_Sum_of_Nodes.cpp

  • 5

    DELETED: Create Rohan-2107_Binary_Search.cpp

  • 6

    DELETED: Create Rohan-2107_Postfix_to_prefix.cpp

  • 7

    UI change

  • 8

    Updated Readme

  • 9

    DELETED: font style changed

  • 10

    DELETED: updated Read.me

  • 11

    updated Read.me

  • 12

    DELETED: Create Rohan-2107_Max_in_Binary_tree.c

  • 13

    DELETED: Create Rohan-2107_DFS.c

  • 14

    Update README.md

  • 15

    DELETED: Create Rohan-2107_Height_of_the_tree.c

  • 16

    DELETED: Create cpp program for searching in linked list

  • 17

    DELETED: Updated readme

  • 18

    DELETED: worked on Issue#22

  • 19

    DELETED: worked on Issue #26

  • 20

    DELETED: Worked on Issue #9

  • 21

    DELETED: Worked on Issue #6

  • 22

    DELETED: Contributed to Issue#11

  • 23

    UI change and refactoring.

  • 24

    DELETED: Added program in C to search an element in linked list

  • 25

    DELETED: Ishan 77 css flexbox

  • 26

    DELETED: Ishan 77 queues

  • 27

    DELETED: Added my name in contributors.md

  • 28

    DELETED: queue_array

  • 29

    DELETED: Ishan 77 btree

  • 30

    DELETED: shell sort

  • 31

    Ishan 77 animations

  • 32

    DELETED: Binary Tree

  • 33

    CSS grid

  • 34

    DELETED: sorting

  • 35

    DELETED: Add files via upload

  • 36

    DELETED: Issue21

  • 37

    DELETED: Issue20

  • 38

    DELETED: Issue16

  • 39

    DELETED: Added inorder for trees in java

  • 40

    DELETED: Implemented bfs on trees

  • 41

    DELETED: Implemented dfs for trees

  • 42

    DELETED: Added linear search in C and C++

  • 43

    DELETED: Issue27

  • 44

    DELETED: Worked on issue #29

  • 45

    Changes style

Go to Leaderboard
Let’s connect