All Resources

Showing the most recent resources. The latest one is from 2020-01-23.
  • Bazriya.com:Online shopping sites ,Womans clothing ,jewellery ,mobile,Herbal store ,Kamiya sindoor,Spiritual,body stocking, ,Free Shipping ,COD,Easy return
    Article  Added by bazriya // www.bazriya.com // 3 days ago
  • TutorialandExample share an Article on Java Queue Interface with Example.
    Article  Added by TutorialandExample // www.tutorialandexample.com // 14 days ago
  • Multiple approaches to validating user inputs from controllers.
    Tutorial  Added by kamer // link.medium.com // 24 days ago
  • TutorialandExample is the Fastest Growing tutorial sites for Java, Php, SQL, Machine Learning, Data science, Artificial Intelligence and Angular 8 etc.
    Article  Added by TutorialandExample // www.tutorialandexample.com // 25 days ago
  • Javatpoint is most Famous world wide Website for Java. It Provides to point to point Learning Java Programming for beginners and Professionals.
    Tutorial  Added by javatpoint // www.javatpoint.com // 25 days ago
  • Tool  Added by callicoder // www.jsonformatter.io // 3 months ago
  • Tool  Added by callicoder // www.base64encoder.io // 3 months ago
  • Tool  Added by callicoder // www.base64decoder.io // 3 months ago
  • Tool  Added by callicoder // www.asciitable.xyz // 3 months ago
  • Given an array where elements are sorted in ascending order, convert it to a height balanced BST.

    A height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.
    Article  Added by callicoder // www.callicoder.com // 3 months ago
  • Given a binary tree, determine if it is height-balanced.

    A height-balanced binary tree is defined as: a binary tree in which the depth of the two subtrees of every node never differ by more than 1.
    Tutorial  Added by callicoder // www.callicoder.com // 3 months ago
  • Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).
    Tutorial  Added by callicoder // www.callicoder.com // 3 months ago
  • Given two binary trees, write a function to check if they are the same or not.

    Two binary trees are considered the same if they are structurally identical and the nodes have the same value.
    Article  Added by callicoder // www.callicoder.com // 3 months ago
  • Given a string containing just the characters (, ), {, }, [ and ], determine if the input string is valid.

    An input string is valid if:

    Open brackets must be closed by the same type of brackets.
    Article  Added by callicoder // www.callicoder.com // 3 months ago
  • Merge two sorted linked lists and return it as a new list. The new list should also be sorted.
    Article  Added by callicoder // www.callicoder.com // 3 months ago
  • Given a string s, find the longest palindromic substring in s.
    Article  Added by callicoder // www.callicoder.com // 3 months ago
  • Given an integer array numbers, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
    Article  Added by callicoder // www.callicoder.com // 3 months ago
  • You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.

    You may assume the two numbers do not contain any leading zero, except the number 0 itself.
    Article  Added by callicoder // www.callicoder.com // 3 months ago
  • Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations:
    get(key) - Get the value (will always be positive) of the key if the key exists in the cache, otherwise return -1.
    put(key, value) - Set or insert the value for the given key in the cache. When the cache has reached its capacity, it should invalidate the least recently used item before inserting a new item.
    The cache is initialized with a positive capacity.
    Article  Added by callicoder // www.callicoder.com // 3 months ago
  • Tutorial  Added by callicoder // www.callicoder.com // 3 months ago
  • Given an array of integers, return the indices of the two numbers whose sum is equal to a given target.
    You may assume that each input would have exactly one solution, and you may not use the same element twice.
    Tutorial  Added by callicoder // www.callicoder.com // 3 months ago
  • Learn about securing reactive REST endpoints with spring Webflux security. We will implement token-based authentication and authorization using JWT provider.
    Article  Added by only2dhir // www.devglan.com // 5 months ago
  • In this tutorial, we will learn how to upload images or files from a React Js app with Spring MVC Rest. We will have a React app with and without Axios integrated with it to push selected files in the browser to the server via REST.
    Article  Added by only2dhir // www.devglan.com // 6 months ago
  • In this article you can learn preface to java virtual machine and architecture with detailed explanation.
    Article  Added by EdwardWilson // www.flowerbrackets.com // 6 months ago
  • System.gc() is an API provided in java, Android, C# and other popular languages. When invoked it will make its best effort to clear accumulated unreferenced object (i.e. garbage) from memory.
    Tutorial  Added by suryababy // blog.heaphero.io // 6 months ago
  • This article is all about Base64 Encoding, you'll learn how to encode Base64 string , Use free online tool to Encode Base64 Data.
    Article  Added by onlineutility9 // www.onlineutility.in // 6 months ago
  • This article is all about Base64 Decoding, you'll learn how to decode Base64 string , Use free online tool to Decode Base64 Data.
    Article  Added by onlineutility9 // www.onlineutility.in // 6 months ago
  • Update  Added by iskimos // bell-sw.com // 6 months ago
  • A book that teaches you everything you need to create end-to-end analytics pipelines in Spark.
    Book  Added by vonlatinski // mng.bz // 7 months ago
  • RSA(Rivest-Shamir-Adleman) is an Asymmetric encryption technique that uses two different keys as public and private keys to perform the encryption and decryption. With RSA, you can encrypt sensitive information with a public key and a matching private key is used to decrypt the encrypted message. Asymmetric encryption is mostly used when there are 2 different endpoints are involved such as VPN client and server, SSH, etc.

    Below is the tool for encryption and decryption.
    Tool  Added by only2dhir // www.devglan.com // 7 months ago