Skip to content

techtrendings.com

Let's explore

Menu
Menu

Month: January 2023

Implement Trie Data Structure in C++- LeetCode

Posted on January 19, 2023January 19, 2023 by Avidlearner

A trie (pronounced as “try”) or prefix tree is a tree data structure used to efficiently store and retrieve keys in a dataset of strings. There are various applications of this data structure, such as autocomplete and spellchecker. Implement the Trie class: Input [“Trie”, “insert”, “search”, “search”, “startsWith”, “insert”, “search”] [[], [“apple”], [“apple”], [“app”], [“app”], [“app”], [“app”]] Output: [null,… Continue reading

How TLS Works

Posted on January 18, 2023January 18, 2023 by Avidlearner

TLS (Transport Layer Security) is a security protocol that is used to establish a secure communication channel between two systems, typically a web server and a web client (such as a web browser). Here is a high-level overview of how the TLS Handshake works:

C++ – Factory Design Pattern – Creation Design Pattern

Posted on January 18, 2023January 18, 2023 by Avidlearner

The Factory design pattern is a creational design pattern that provides an interface for creating objects in a superclass, but allows subclasses to alter the type of objects that will be created. Here’s an example of how the Factory pattern might be implemented in C++: In this example, the Product class is an interface that… Continue reading

C++ – Strategy Design Pattern – Behavioral Design Pattern

Posted on January 18, 2023January 18, 2023 by Avidlearner

The Strategy design pattern is a behavioral design pattern that defines a family of algorithms, encapsulates each one, and makes them interchangeable. It lets the algorithm vary independently from clients that use it. Here’s an example of how the Strategy pattern might be implemented in C++: In this example, the Strategy class is an interface… Continue reading

LFU Cache Implementation – LeetCode

Posted on January 18, 2023January 18, 2023 by Avidlearner

Design and implement a data structure for a Least Frequently Used (LFU) cache. Implement the LFUCache class: Example 1: Input [“LFUCache”, “put”, “put”, “get”, “put”, “get”, “get”, “put”, “get”, “get”, “get”] [[2], [1, 1], [2, 2], [1], [3, 3], [2], [3], [4, 4], [1], [3], [4]] Output [null, null, null, 1, null, -1, 3, null, -1, 3, 4] This… Continue reading

Recent Posts

  • Implement Trie Data Structure in C++- LeetCode
  • How TLS Works
  • C++ – Factory Design Pattern – Creation Design Pattern
  • C++ – Strategy Design Pattern – Behavioral Design Pattern
  • LFU Cache Implementation – LeetCode

Recent Comments

  • automatically like friends photos on instagram on Program to find unpaired element in an Array in C++|Leetcode |techtrendings
  • Twicsy on Program to find unpaired element in an Array in C++|Leetcode |techtrendings

Archives

  • January 2023
  • November 2022
  • August 2022
  • June 2022
  • May 2022
  • March 2022
  • February 2022
  • January 2022

Categories

  • Algorithm
  • Algorithm
  • C++
  • Design Patterns
  • Multithreading
  • OS Concepts
  • Programming
  • Uncategorized

Meta

  • Log in
  • Entries feed
  • Comments feed
  • WordPress.org

Join Our Mailing List for the Latest News and Updates.

© 2023 techtrendings.com | Powered by Superbs Personal Blog theme